./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9100830150c2f30db5aaccf2063c94758406a4876f8aaece5f31a0f269bbd441
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 22:25:21,025 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 22:25:21,027 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 22:25:21,046 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 22:25:21,047 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 22:25:21,048 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 22:25:21,049 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 22:25:21,050 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 22:25:21,051 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 22:25:21,051 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 22:25:21,052 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 22:25:21,053 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 22:25:21,053 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 22:25:21,054 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 22:25:21,054 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 22:25:21,055 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 22:25:21,056 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 22:25:21,057 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 22:25:21,058 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 22:25:21,059 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 22:25:21,060 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 22:25:21,061 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 22:25:21,062 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 22:25:21,062 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 22:25:21,065 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 22:25:21,065 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 22:25:21,065 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 22:25:21,066 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 22:25:21,066 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 22:25:21,067 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 22:25:21,067 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 22:25:21,067 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 22:25:21,068 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 22:25:21,069 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 22:25:21,069 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 22:25:21,070 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 22:25:21,070 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 22:25:21,070 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 22:25:21,070 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 22:25:21,071 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 22:25:21,071 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 22:25:21,072 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 22:25:21,087 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 22:25:21,087 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 22:25:21,087 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 22:25:21,087 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 22:25:21,088 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 22:25:21,088 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 22:25:21,088 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 22:25:21,088 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 22:25:21,088 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 22:25:21,089 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 22:25:21,089 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 22:25:21,090 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 22:25:21,090 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:25:21,091 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 22:25:21,091 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 22:25:21,092 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9100830150c2f30db5aaccf2063c94758406a4876f8aaece5f31a0f269bbd441
[2024-03-11 22:25:21,251 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 22:25:21,275 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 22:25:21,279 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 22:25:21,281 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 22:25:21,281 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 22:25:21,283 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2024-03-11 22:25:22,238 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 22:25:22,500 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 22:25:22,500 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-in-array.i
[2024-03-11 22:25:22,511 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3806a0406/b5e873b8c4174d52b94544fcf31cc27d/FLAGdf791e042
[2024-03-11 22:25:22,833 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/3806a0406/b5e873b8c4174d52b94544fcf31cc27d
[2024-03-11 22:25:22,836 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 22:25:22,837 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 22:25:22,838 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 22:25:22,838 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 22:25:22,841 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 22:25:22,841 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:25:22" (1/1) ...
[2024-03-11 22:25:22,842 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550a840a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:22, skipping insertion in model container
[2024-03-11 22:25:22,843 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 10:25:22" (1/1) ...
[2024-03-11 22:25:22,848 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 22:25:22,888 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 22:25:23,007 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:25:23,137 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:25:23,143 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 22:25:23,153 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-11 22:25:23,177 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 22:25:23,211 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 22:25:23,212 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23 WrapperNode
[2024-03-11 22:25:23,212 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 22:25:23,213 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 22:25:23,213 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 22:25:23,213 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 22:25:23,218 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,233 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,251 INFO  L138                Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97
[2024-03-11 22:25:23,252 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 22:25:23,252 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 22:25:23,252 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 22:25:23,252 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 22:25:23,259 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,259 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,263 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,263 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,271 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,273 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,275 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,276 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,278 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 22:25:23,279 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 22:25:23,279 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 22:25:23,279 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 22:25:23,280 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (1/1) ...
[2024-03-11 22:25:23,284 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 22:25:23,292 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:23,301 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-11 22:25:23,303 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-11 22:25:23,339 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 22:25:23,339 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-11 22:25:23,340 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 22:25:23,340 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-11 22:25:23,340 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 22:25:23,340 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 22:25:23,341 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-11 22:25:23,341 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 22:25:23,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 22:25:23,341 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 22:25:23,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 22:25:23,343 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 22:25:23,474 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 22:25:23,476 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 22:25:23,670 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 22:25:23,676 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 22:25:23,677 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 22:25:23,678 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:25:23 BoogieIcfgContainer
[2024-03-11 22:25:23,679 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 22:25:23,680 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 22:25:23,680 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 22:25:23,683 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 22:25:23,683 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 10:25:22" (1/3) ...
[2024-03-11 22:25:23,683 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57772f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:25:23, skipping insertion in model container
[2024-03-11 22:25:23,683 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 10:25:23" (2/3) ...
[2024-03-11 22:25:23,684 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57772f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 10:25:23, skipping insertion in model container
[2024-03-11 22:25:23,684 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 10:25:23" (3/3) ...
[2024-03-11 22:25:23,685 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i
[2024-03-11 22:25:23,691 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 22:25:23,698 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 22:25:23,698 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-11 22:25:23,698 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 22:25:23,787 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-11 22:25:23,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,869 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:25:23,870 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:25:23,874 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:25:23,874 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,878 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,881 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:25:23,888 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,890 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 252 flow
[2024-03-11 22:25:23,919 INFO  L130       PetriNetUnfolder]: 6/186 cut-off events.
[2024-03-11 22:25:23,920 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-11 22:25:23,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 186 events. 6/186 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 357 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 92. Up to 4 conditions per place. 
[2024-03-11 22:25:23,922 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2160
[2024-03-11 22:25:26,630 INFO  L134        LiptonReduction]: Checked pairs total: 10110
[2024-03-11 22:25:26,631 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2024-03-11 22:25:26,644 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:25:26,649 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@671a0df9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:25:26,650 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-11 22:25:26,653 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:25:26,653 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:25:26,653 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:26,654 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:26,654 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:26,658 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:26,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 2110203502, now seen corresponding path program 1 times
[2024-03-11 22:25:26,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:26,666 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292995680]
[2024-03-11 22:25:26,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:26,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:26,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:27,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:27,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:27,055 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292995680]
[2024-03-11 22:25:27,056 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292995680] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:27,056 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:27,056 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:27,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526436442]
[2024-03-11 22:25:27,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:27,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:27,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:27,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:27,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:27,378 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197
[2024-03-11 22:25:27,381 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,382 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:27,382 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197
[2024-03-11 22:25:27,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:27,581 INFO  L130       PetriNetUnfolder]: 136/491 cut-off events.
[2024-03-11 22:25:27,581 INFO  L131       PetriNetUnfolder]: For 8/12 co-relation queries the response was YES.
[2024-03-11 22:25:27,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 831 conditions, 491 events. 136/491 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2634 event pairs, 41 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 746. Up to 213 conditions per place. 
[2024-03-11 22:25:27,585 INFO  L137   encePairwiseOnDemand]: 181/197 looper letters, 45 selfloop transitions, 23 changer transitions 0/97 dead transitions.
[2024-03-11 22:25:27,585 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 97 transitions, 338 flow
[2024-03-11 22:25:27,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:27,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:27,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 658 transitions.
[2024-03-11 22:25:27,599 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.55668358714044
[2024-03-11 22:25:27,599 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 658 transitions.
[2024-03-11 22:25:27,600 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 658 transitions.
[2024-03-11 22:25:27,602 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:27,603 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 658 transitions.
[2024-03-11 22:25:27,607 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,613 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,614 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,616 INFO  L175             Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 6 states and 658 transitions.
[2024-03-11 22:25:27,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 97 transitions, 338 flow
[2024-03-11 22:25:27,619 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 97 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:27,621 INFO  L231             Difference]: Finished difference. Result has 69 places, 80 transitions, 292 flow
[2024-03-11 22:25:27,622 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=69, PETRI_TRANSITIONS=80}
[2024-03-11 22:25:27,625 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places.
[2024-03-11 22:25:27,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 292 flow
[2024-03-11 22:25:27,626 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,626 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:27,626 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:27,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 22:25:27,627 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:27,627 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:27,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448158064, now seen corresponding path program 1 times
[2024-03-11 22:25:27,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:27,628 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031246554]
[2024-03-11 22:25:27,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:27,628 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:27,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:27,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:27,678 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:27,678 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031246554]
[2024-03-11 22:25:27,678 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031246554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:27,679 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:27,679 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:25:27,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336913011]
[2024-03-11 22:25:27,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:27,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:25:27,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:27,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:25:27,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:25:27,720 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 197
[2024-03-11 22:25:27,721 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 292 flow. Second operand  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,721 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:27,721 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 197
[2024-03-11 22:25:27,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:27,820 INFO  L130       PetriNetUnfolder]: 75/431 cut-off events.
[2024-03-11 22:25:27,820 INFO  L131       PetriNetUnfolder]: For 99/103 co-relation queries the response was YES.
[2024-03-11 22:25:27,822 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 838 conditions, 431 events. 75/431 cut-off events. For 99/103 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2391 event pairs, 10 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 711. Up to 90 conditions per place. 
[2024-03-11 22:25:27,823 INFO  L137   encePairwiseOnDemand]: 193/197 looper letters, 22 selfloop transitions, 3 changer transitions 2/89 dead transitions.
[2024-03-11 22:25:27,823 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 374 flow
[2024-03-11 22:25:27,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:25:27,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:25:27,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions.
[2024-03-11 22:25:27,826 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5951776649746193
[2024-03-11 22:25:27,826 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 469 transitions.
[2024-03-11 22:25:27,826 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions.
[2024-03-11 22:25:27,827 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:27,827 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions.
[2024-03-11 22:25:27,828 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,830 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,830 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,830 INFO  L175             Difference]: Start difference. First operand has 69 places, 80 transitions, 292 flow. Second operand 4 states and 469 transitions.
[2024-03-11 22:25:27,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 374 flow
[2024-03-11 22:25:27,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 374 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:27,835 INFO  L231             Difference]: Finished difference. Result has 74 places, 81 transitions, 308 flow
[2024-03-11 22:25:27,835 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=74, PETRI_TRANSITIONS=81}
[2024-03-11 22:25:27,836 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 15 predicate places.
[2024-03-11 22:25:27,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 308 flow
[2024-03-11 22:25:27,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:27,837 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:27,837 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:27,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 22:25:27,837 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:27,838 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:27,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1143403716, now seen corresponding path program 1 times
[2024-03-11 22:25:27,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:27,838 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334057500]
[2024-03-11 22:25:27,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:27,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:27,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:27,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:27,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:27,985 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334057500]
[2024-03-11 22:25:27,986 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334057500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:27,986 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:27,986 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:27,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726951263]
[2024-03-11 22:25:27,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:27,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:27,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:27,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:27,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:28,191 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 197
[2024-03-11 22:25:28,192 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 308 flow. Second operand  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,192 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:28,192 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 197
[2024-03-11 22:25:28,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:28,386 INFO  L130       PetriNetUnfolder]: 273/845 cut-off events.
[2024-03-11 22:25:28,387 INFO  L131       PetriNetUnfolder]: For 339/348 co-relation queries the response was YES.
[2024-03-11 22:25:28,389 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 845 events. 273/845 cut-off events. For 339/348 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5087 event pairs, 40 based on Foata normal form. 5/825 useless extension candidates. Maximal degree in co-relation 1909. Up to 380 conditions per place. 
[2024-03-11 22:25:28,391 INFO  L137   encePairwiseOnDemand]: 174/197 looper letters, 71 selfloop transitions, 50 changer transitions 1/152 dead transitions.
[2024-03-11 22:25:28,391 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 818 flow
[2024-03-11 22:25:28,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:28,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:28,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-11 22:25:28,394 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5423011844331641
[2024-03-11 22:25:28,394 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-11 22:25:28,394 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-11 22:25:28,394 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:28,395 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-11 22:25:28,396 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,398 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,399 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,399 INFO  L175             Difference]: Start difference. First operand has 74 places, 81 transitions, 308 flow. Second operand 6 states and 641 transitions.
[2024-03-11 22:25:28,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 818 flow
[2024-03-11 22:25:28,402 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 152 transitions, 815 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:28,404 INFO  L231             Difference]: Finished difference. Result has 83 places, 129 transitions, 778 flow
[2024-03-11 22:25:28,404 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=778, PETRI_PLACES=83, PETRI_TRANSITIONS=129}
[2024-03-11 22:25:28,405 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places.
[2024-03-11 22:25:28,405 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 129 transitions, 778 flow
[2024-03-11 22:25:28,405 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,405 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:28,406 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:28,406 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 22:25:28,406 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:28,406 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:28,406 INFO  L85        PathProgramCache]: Analyzing trace with hash -2008836030, now seen corresponding path program 1 times
[2024-03-11 22:25:28,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:28,407 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531075085]
[2024-03-11 22:25:28,407 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:28,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:28,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:28,657 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:28,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:28,658 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531075085]
[2024-03-11 22:25:28,658 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531075085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:28,658 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:28,658 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:28,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326126197]
[2024-03-11 22:25:28,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:28,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:28,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:28,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:28,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:28,772 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197
[2024-03-11 22:25:28,773 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 129 transitions, 778 flow. Second operand  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:28,773 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:28,773 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197
[2024-03-11 22:25:28,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:29,317 INFO  L130       PetriNetUnfolder]: 495/1281 cut-off events.
[2024-03-11 22:25:29,318 INFO  L131       PetriNetUnfolder]: For 1253/1267 co-relation queries the response was YES.
[2024-03-11 22:25:29,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4152 conditions, 1281 events. 495/1281 cut-off events. For 1253/1267 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 8062 event pairs, 83 based on Foata normal form. 2/1205 useless extension candidates. Maximal degree in co-relation 3944. Up to 935 conditions per place. 
[2024-03-11 22:25:29,326 INFO  L137   encePairwiseOnDemand]: 167/197 looper letters, 138 selfloop transitions, 107 changer transitions 6/267 dead transitions.
[2024-03-11 22:25:29,326 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 267 transitions, 1868 flow
[2024-03-11 22:25:29,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:29,330 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:29,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions.
[2024-03-11 22:25:29,331 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5752961082910322
[2024-03-11 22:25:29,331 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 680 transitions.
[2024-03-11 22:25:29,332 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions.
[2024-03-11 22:25:29,332 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:29,332 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions.
[2024-03-11 22:25:29,334 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:29,337 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:29,338 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:29,338 INFO  L175             Difference]: Start difference. First operand has 83 places, 129 transitions, 778 flow. Second operand 6 states and 680 transitions.
[2024-03-11 22:25:29,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 267 transitions, 1868 flow
[2024-03-11 22:25:29,346 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 267 transitions, 1852 flow, removed 5 selfloop flow, removed 2 redundant places.
[2024-03-11 22:25:29,349 INFO  L231             Difference]: Finished difference. Result has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:25:29,350 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1622, PETRI_PLACES=89, PETRI_TRANSITIONS=233}
[2024-03-11 22:25:29,350 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 30 predicate places.
[2024-03-11 22:25:29,350 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 233 transitions, 1622 flow
[2024-03-11 22:25:29,351 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:29,351 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:29,351 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:29,351 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 22:25:29,351 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:29,352 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:29,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1403069832, now seen corresponding path program 1 times
[2024-03-11 22:25:29,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:29,352 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836640379]
[2024-03-11 22:25:29,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:29,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:29,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:29,695 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:29,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:29,695 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836640379]
[2024-03-11 22:25:29,696 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836640379] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:29,696 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693092400]
[2024-03-11 22:25:29,696 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:29,697 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:29,697 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:29,701 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:29,704 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-11 22:25:29,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:29,804 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:25:29,811 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:29,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:29,983 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:30,009 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,011 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:30,045 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,046 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,047 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:30,085 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,086 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,087 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:30,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:30,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:30,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:30,171 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:30,195 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-11 22:25:30,215 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0))))) is different from false
[2024-03-11 22:25:30,236 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_229) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))))) is different from false
[2024-03-11 22:25:30,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-11 22:25:30,340 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [693092400] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:30,340 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:30,340 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25
[2024-03-11 22:25:30,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559719939]
[2024-03-11 22:25:30,341 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:30,341 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-03-11 22:25:30,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:30,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-03-11 22:25:30,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=460, Unknown=3, NotChecked=138, Total=702
[2024-03-11 22:25:30,436 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 197
[2024-03-11 22:25:30,437 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 233 transitions, 1622 flow. Second operand  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:30,438 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:30,438 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 197
[2024-03-11 22:25:30,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:31,124 INFO  L130       PetriNetUnfolder]: 625/1459 cut-off events.
[2024-03-11 22:25:31,125 INFO  L131       PetriNetUnfolder]: For 2534/2534 co-relation queries the response was YES.
[2024-03-11 22:25:31,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6008 conditions, 1459 events. 625/1459 cut-off events. For 2534/2534 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8869 event pairs, 88 based on Foata normal form. 10/1361 useless extension candidates. Maximal degree in co-relation 5782. Up to 1332 conditions per place. 
[2024-03-11 22:25:31,133 INFO  L137   encePairwiseOnDemand]: 187/197 looper letters, 277 selfloop transitions, 12 changer transitions 8/299 dead transitions.
[2024-03-11 22:25:31,134 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:25:31,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-11 22:25:31,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-11 22:25:31,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions.
[2024-03-11 22:25:31,136 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3598984771573604
[2024-03-11 22:25:31,136 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 709 transitions.
[2024-03-11 22:25:31,136 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 709 transitions.
[2024-03-11 22:25:31,137 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:31,137 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 709 transitions.
[2024-03-11 22:25:31,138 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 70.9) internal successors, (709), 10 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:31,140 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:31,141 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:31,141 INFO  L175             Difference]: Start difference. First operand has 89 places, 233 transitions, 1622 flow. Second operand 10 states and 709 transitions.
[2024-03-11 22:25:31,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 299 transitions, 2568 flow
[2024-03-11 22:25:31,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 299 transitions, 2448 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:31,159 INFO  L231             Difference]: Finished difference. Result has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:25:31,159 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1543, PETRI_PLACES=99, PETRI_TRANSITIONS=236}
[2024-03-11 22:25:31,159 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 40 predicate places.
[2024-03-11 22:25:31,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 236 transitions, 1543 flow
[2024-03-11 22:25:31,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 61.592592592592595) internal successors, (1663), 27 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:31,161 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:31,161 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:31,173 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 22:25:31,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:31,362 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:31,362 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:31,363 INFO  L85        PathProgramCache]: Analyzing trace with hash 1125172485, now seen corresponding path program 1 times
[2024-03-11 22:25:31,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:31,363 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713097907]
[2024-03-11 22:25:31,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:31,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:31,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:31,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:31,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:31,673 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713097907]
[2024-03-11 22:25:31,673 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713097907] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:31,673 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798089268]
[2024-03-11 22:25:31,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:31,673 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:31,673 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:31,674 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:31,677 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-11 22:25:31,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:31,791 INFO  L263         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:25:31,794 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:31,815 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:31,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:31,904 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:31,934 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:31,935 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:31,969 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:31,969 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:32,011 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:32,012 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:32,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:32,019 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:32,138 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-11 22:25:32,161 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_342 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_342 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_342) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:32,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:32,245 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798089268] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:32,245 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:32,245 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:25:32,245 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357123526]
[2024-03-11 22:25:32,245 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:32,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:25:32,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:32,246 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:25:32,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=453, Unknown=7, NotChecked=90, Total=650
[2024-03-11 22:25:32,367 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 197
[2024-03-11 22:25:32,369 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 236 transitions, 1543 flow. Second operand  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:32,369 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:32,369 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 197
[2024-03-11 22:25:32,369 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:35,621 INFO  L130       PetriNetUnfolder]: 691/1603 cut-off events.
[2024-03-11 22:25:35,621 INFO  L131       PetriNetUnfolder]: For 2897/2897 co-relation queries the response was YES.
[2024-03-11 22:25:35,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 1603 events. 691/1603 cut-off events. For 2897/2897 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10024 event pairs, 57 based on Foata normal form. 0/1505 useless extension candidates. Maximal degree in co-relation 6542. Up to 948 conditions per place. 
[2024-03-11 22:25:35,630 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 266 selfloop transitions, 208 changer transitions 27/503 dead transitions.
[2024-03-11 22:25:35,630 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 503 transitions, 4091 flow
[2024-03-11 22:25:35,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-11 22:25:35,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-11 22:25:35,633 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1474 transitions.
[2024-03-11 22:25:35,634 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3741116751269036
[2024-03-11 22:25:35,634 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1474 transitions.
[2024-03-11 22:25:35,634 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1474 transitions.
[2024-03-11 22:25:35,635 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:35,635 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1474 transitions.
[2024-03-11 22:25:35,637 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 73.7) internal successors, (1474), 20 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:35,641 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:35,642 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 197.0) internal successors, (4137), 21 states have internal predecessors, (4137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:35,642 INFO  L175             Difference]: Start difference. First operand has 99 places, 236 transitions, 1543 flow. Second operand 20 states and 1474 transitions.
[2024-03-11 22:25:35,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 503 transitions, 4091 flow
[2024-03-11 22:25:35,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 503 transitions, 4061 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-03-11 22:25:35,660 INFO  L231             Difference]: Finished difference. Result has 121 places, 339 transitions, 3078 flow
[2024-03-11 22:25:35,661 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3078, PETRI_PLACES=121, PETRI_TRANSITIONS=339}
[2024-03-11 22:25:35,661 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 62 predicate places.
[2024-03-11 22:25:35,661 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 339 transitions, 3078 flow
[2024-03-11 22:25:35,662 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 59.65384615384615) internal successors, (1551), 26 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:35,662 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:35,662 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:35,667 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-11 22:25:35,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:35,865 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:35,865 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:35,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -649414092, now seen corresponding path program 1 times
[2024-03-11 22:25:35,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:35,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138419470]
[2024-03-11 22:25:35,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:35,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:35,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:36,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:36,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:36,187 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138419470]
[2024-03-11 22:25:36,187 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138419470] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:36,187 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205356661]
[2024-03-11 22:25:36,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:36,187 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:36,187 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:36,188 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:36,193 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-11 22:25:36,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:36,286 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:25:36,290 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:36,308 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:36,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:36,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:36,439 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:36,439 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:36,488 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:36,489 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:36,527 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:36,528 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:36,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:36,540 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:36,571 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:25:36,710 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_455 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_455) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:36,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:36,803 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205356661] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:36,803 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:36,803 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:25:36,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828496059]
[2024-03-11 22:25:36,804 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:36,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:25:36,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:36,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:25:36,805 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=8, NotChecked=90, Total=650
[2024-03-11 22:25:36,903 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2024-03-11 22:25:36,905 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 339 transitions, 3078 flow. Second operand  has 26 states, 26 states have (on average 56.76923076923077) internal successors, (1476), 26 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:36,905 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:36,905 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2024-03-11 22:25:36,905 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:39,716 INFO  L130       PetriNetUnfolder]: 732/1719 cut-off events.
[2024-03-11 22:25:39,716 INFO  L131       PetriNetUnfolder]: For 5942/5942 co-relation queries the response was YES.
[2024-03-11 22:25:39,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9426 conditions, 1719 events. 732/1719 cut-off events. For 5942/5942 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11131 event pairs, 36 based on Foata normal form. 0/1643 useless extension candidates. Maximal degree in co-relation 9146. Up to 916 conditions per place. 
[2024-03-11 22:25:39,742 INFO  L137   encePairwiseOnDemand]: 146/197 looper letters, 381 selfloop transitions, 221 changer transitions 10/614 dead transitions.
[2024-03-11 22:25:39,743 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 614 transitions, 6245 flow
[2024-03-11 22:25:39,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:25:39,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:25:39,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1369 transitions.
[2024-03-11 22:25:39,747 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3657493988779054
[2024-03-11 22:25:39,747 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1369 transitions.
[2024-03-11 22:25:39,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1369 transitions.
[2024-03-11 22:25:39,748 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:39,748 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1369 transitions.
[2024-03-11 22:25:39,750 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 72.05263157894737) internal successors, (1369), 19 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:39,754 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:39,754 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:39,755 INFO  L175             Difference]: Start difference. First operand has 121 places, 339 transitions, 3078 flow. Second operand 19 states and 1369 transitions.
[2024-03-11 22:25:39,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 614 transitions, 6245 flow
[2024-03-11 22:25:39,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 614 transitions, 6093 flow, removed 48 selfloop flow, removed 8 redundant places.
[2024-03-11 22:25:39,794 INFO  L231             Difference]: Finished difference. Result has 136 places, 428 transitions, 4562 flow
[2024-03-11 22:25:39,794 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4562, PETRI_PLACES=136, PETRI_TRANSITIONS=428}
[2024-03-11 22:25:39,795 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 77 predicate places.
[2024-03-11 22:25:39,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 428 transitions, 4562 flow
[2024-03-11 22:25:39,796 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.76923076923077) internal successors, (1476), 26 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:39,796 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:39,796 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:39,802 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 22:25:39,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:39,997 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:39,998 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:39,998 INFO  L85        PathProgramCache]: Analyzing trace with hash -1789107804, now seen corresponding path program 1 times
[2024-03-11 22:25:39,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:39,999 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352520793]
[2024-03-11 22:25:39,999 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:40,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:40,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:40,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:40,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:40,299 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352520793]
[2024-03-11 22:25:40,300 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352520793] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:40,300 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336830223]
[2024-03-11 22:25:40,300 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:40,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:40,301 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:40,302 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:40,304 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-11 22:25:40,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:40,421 INFO  L263         TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:25:40,424 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:40,455 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:40,536 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:40,567 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,568 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:40,602 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,603 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,604 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:40,641 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,642 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,642 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:40,719 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:40,720 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:40,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:40,749 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:40,765 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 22:25:40,823 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37)))) is different from false
[2024-03-11 22:25:41,118 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37))) (forall ((v_threadThread1of1ForFork0_~t~0.base_37 Int)) (or (forall ((v_ArrVal_568 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of1ForFork0_~t~0.base_37 v_ArrVal_568) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of1ForFork0_#in~arg.base| v_threadThread1of1ForFork0_~t~0.base_37)))))) is different from false
[2024-03-11 22:25:41,277 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:41,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-11 22:25:41,283 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:41,285 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-11 22:25:41,291 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-03-11 22:25:41,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:41,357 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [336830223] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:41,358 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:41,358 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27
[2024-03-11 22:25:41,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381371544]
[2024-03-11 22:25:41,359 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:41,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-11 22:25:41,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:41,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-11 22:25:41,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=521, Unknown=15, NotChecked=150, Total=812
[2024-03-11 22:25:41,496 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 197
[2024-03-11 22:25:41,497 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 428 transitions, 4562 flow. Second operand  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:41,497 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:41,497 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 197
[2024-03-11 22:25:41,497 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:42,365 INFO  L130       PetriNetUnfolder]: 695/1629 cut-off events.
[2024-03-11 22:25:42,365 INFO  L131       PetriNetUnfolder]: For 8878/8880 co-relation queries the response was YES.
[2024-03-11 22:25:42,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10292 conditions, 1629 events. 695/1629 cut-off events. For 8878/8880 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10381 event pairs, 46 based on Foata normal form. 39/1634 useless extension candidates. Maximal degree in co-relation 10006. Up to 1496 conditions per place. 
[2024-03-11 22:25:42,378 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 432 selfloop transitions, 27 changer transitions 1/462 dead transitions.
[2024-03-11 22:25:42,379 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 462 transitions, 5716 flow
[2024-03-11 22:25:42,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-11 22:25:42,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-11 22:25:42,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 674 transitions.
[2024-03-11 22:25:42,381 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34213197969543147
[2024-03-11 22:25:42,381 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 674 transitions.
[2024-03-11 22:25:42,381 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 674 transitions.
[2024-03-11 22:25:42,382 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:42,382 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 674 transitions.
[2024-03-11 22:25:42,383 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 67.4) internal successors, (674), 10 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:42,385 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:42,385 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 197.0) internal successors, (2167), 11 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:42,385 INFO  L175             Difference]: Start difference. First operand has 136 places, 428 transitions, 4562 flow. Second operand 10 states and 674 transitions.
[2024-03-11 22:25:42,385 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 462 transitions, 5716 flow
[2024-03-11 22:25:42,421 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 462 transitions, 5562 flow, removed 56 selfloop flow, removed 11 redundant places.
[2024-03-11 22:25:42,429 INFO  L231             Difference]: Finished difference. Result has 132 places, 414 transitions, 4314 flow
[2024-03-11 22:25:42,429 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=4252, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4314, PETRI_PLACES=132, PETRI_TRANSITIONS=414}
[2024-03-11 22:25:42,431 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 73 predicate places.
[2024-03-11 22:25:42,432 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 414 transitions, 4314 flow
[2024-03-11 22:25:42,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 58.55172413793103) internal successors, (1698), 29 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:42,433 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:42,433 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:42,441 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-11 22:25:42,633 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:42,634 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:42,634 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:42,634 INFO  L85        PathProgramCache]: Analyzing trace with hash -1574926783, now seen corresponding path program 1 times
[2024-03-11 22:25:42,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:42,635 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788405297]
[2024-03-11 22:25:42,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:42,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:42,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:42,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:25:42,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:42,827 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788405297]
[2024-03-11 22:25:42,827 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788405297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:42,827 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:42,828 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:42,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849695501]
[2024-03-11 22:25:42,828 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:42,828 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:42,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:42,829 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:42,829 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:43,104 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197
[2024-03-11 22:25:43,105 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 414 transitions, 4314 flow. Second operand  has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:43,105 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:43,105 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197
[2024-03-11 22:25:43,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:43,436 INFO  L130       PetriNetUnfolder]: 586/1493 cut-off events.
[2024-03-11 22:25:43,436 INFO  L131       PetriNetUnfolder]: For 9872/9954 co-relation queries the response was YES.
[2024-03-11 22:25:43,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 1493 events. 586/1493 cut-off events. For 9872/9954 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9988 event pairs, 31 based on Foata normal form. 24/1475 useless extension candidates. Maximal degree in co-relation 8695. Up to 792 conditions per place. 
[2024-03-11 22:25:43,449 INFO  L137   encePairwiseOnDemand]: 186/197 looper letters, 194 selfloop transitions, 47 changer transitions 16/459 dead transitions.
[2024-03-11 22:25:43,449 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 459 transitions, 5349 flow
[2024-03-11 22:25:43,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:43,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:43,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions.
[2024-03-11 22:25:43,451 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5642978003384095
[2024-03-11 22:25:43,451 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 667 transitions.
[2024-03-11 22:25:43,451 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions.
[2024-03-11 22:25:43,451 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:43,451 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions.
[2024-03-11 22:25:43,452 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:43,453 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:43,454 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:43,454 INFO  L175             Difference]: Start difference. First operand has 132 places, 414 transitions, 4314 flow. Second operand 6 states and 667 transitions.
[2024-03-11 22:25:43,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 459 transitions, 5349 flow
[2024-03-11 22:25:43,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 459 transitions, 5289 flow, removed 0 selfloop flow, removed 8 redundant places.
[2024-03-11 22:25:43,497 INFO  L231             Difference]: Finished difference. Result has 134 places, 439 transitions, 4838 flow
[2024-03-11 22:25:43,497 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=4262, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4838, PETRI_PLACES=134, PETRI_TRANSITIONS=439}
[2024-03-11 22:25:43,497 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 75 predicate places.
[2024-03-11 22:25:43,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 439 transitions, 4838 flow
[2024-03-11 22:25:43,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:43,498 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:43,498 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:43,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 22:25:43,498 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:43,498 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:43,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 719039965, now seen corresponding path program 2 times
[2024-03-11 22:25:43,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:43,499 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594367172]
[2024-03-11 22:25:43,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:43,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:43,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:43,877 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:43,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:43,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594367172]
[2024-03-11 22:25:43,878 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594367172] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:43,878 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169185227]
[2024-03-11 22:25:43,878 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:25:43,878 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:43,878 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:43,879 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:43,883 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-11 22:25:44,049 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:25:44,049 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:25:44,051 INFO  L263         TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjunts are in the unsatisfiable core
[2024-03-11 22:25:44,054 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:44,060 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:25:44,105 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:25:44,106 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 25
[2024-03-11 22:25:44,153 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:44,164 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:44,179 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:44,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:44,202 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:44,202 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:44,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:44,237 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:44,255 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:44,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:44,304 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:44,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:44,311 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:44,333 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:25:44,635 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_757 (Array Int Int)) (v_ArrVal_756 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_756) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_757) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-03-11 22:25:44,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 4 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-11 22:25:44,739 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169185227] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:44,740 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:44,740 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16
[2024-03-11 22:25:44,740 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850021688]
[2024-03-11 22:25:44,740 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:44,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-03-11 22:25:44,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:44,741 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-03-11 22:25:44,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=175, Unknown=15, NotChecked=58, Total=306
[2024-03-11 22:25:44,928 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 197
[2024-03-11 22:25:44,929 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 439 transitions, 4838 flow. Second operand  has 18 states, 18 states have (on average 57.166666666666664) internal successors, (1029), 18 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:44,929 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:44,929 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 197
[2024-03-11 22:25:44,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:47,337 INFO  L130       PetriNetUnfolder]: 678/1579 cut-off events.
[2024-03-11 22:25:47,338 INFO  L131       PetriNetUnfolder]: For 10362/10370 co-relation queries the response was YES.
[2024-03-11 22:25:47,342 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 1579 events. 678/1579 cut-off events. For 10362/10370 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10197 event pairs, 28 based on Foata normal form. 35/1600 useless extension candidates. Maximal degree in co-relation 10161. Up to 470 conditions per place. 
[2024-03-11 22:25:47,349 INFO  L137   encePairwiseOnDemand]: 150/197 looper letters, 388 selfloop transitions, 233 changer transitions 56/679 dead transitions.
[2024-03-11 22:25:47,350 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 679 transitions, 8262 flow
[2024-03-11 22:25:47,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:25:47,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:25:47,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1327 transitions.
[2024-03-11 22:25:47,353 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3545284531124766
[2024-03-11 22:25:47,353 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:47,353 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:47,353 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:47,353 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1327 transitions.
[2024-03-11 22:25:47,356 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 69.84210526315789) internal successors, (1327), 19 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:47,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:47,360 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 197.0) internal successors, (3940), 20 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:47,360 INFO  L175             Difference]: Start difference. First operand has 134 places, 439 transitions, 4838 flow. Second operand 19 states and 1327 transitions.
[2024-03-11 22:25:47,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 679 transitions, 8262 flow
[2024-03-11 22:25:47,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 679 transitions, 8104 flow, removed 79 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:47,427 INFO  L231             Difference]: Finished difference. Result has 156 places, 436 transitions, 5502 flow
[2024-03-11 22:25:47,427 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=4690, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5502, PETRI_PLACES=156, PETRI_TRANSITIONS=436}
[2024-03-11 22:25:47,427 INFO  L288   CegarLoopForPetriNet]: 59 programPoint places, 97 predicate places.
[2024-03-11 22:25:47,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 436 transitions, 5502 flow
[2024-03-11 22:25:47,428 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 57.166666666666664) internal successors, (1029), 18 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:47,428 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:47,428 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 22:25:47,435 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-11 22:25:47,629 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-11 22:25:47,630 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-11 22:25:47,630 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:47,630 INFO  L85        PathProgramCache]: Analyzing trace with hash -103590415, now seen corresponding path program 1 times
[2024-03-11 22:25:47,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:47,631 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45221401]
[2024-03-11 22:25:47,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:47,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:47,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:25:47,659 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 22:25:47,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 22:25:47,701 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 22:25:47,701 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 22:25:47,702 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-11 22:25:47,703 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-11 22:25:47,703 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-11 22:25:47,703 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-11 22:25:47,703 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-11 22:25:47,703 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-11 22:25:47,704 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-11 22:25:47,704 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-11 22:25:47,704 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-11 22:25:47,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-11 22:25:47,704 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:47,706 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 22:25:47,706 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 22:25:47,719 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-11 22:25:47,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,740 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:25:47,740 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:25:47,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 721 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:25:47,740 INFO  L82        GeneralOperation]: Start removeDead. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,741 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,741 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 22:25:47,741 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,742 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 139 transitions, 296 flow
[2024-03-11 22:25:47,758 INFO  L130       PetriNetUnfolder]: 11/329 cut-off events.
[2024-03-11 22:25:47,758 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-11 22:25:47,759 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 343 conditions, 329 events. 11/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 721 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 188. Up to 8 conditions per place. 
[2024-03-11 22:25:47,762 INFO  L119        LiptonReduction]: Number of co-enabled transitions 5160
[2024-03-11 22:25:50,273 INFO  L134        LiptonReduction]: Checked pairs total: 24448
[2024-03-11 22:25:50,273 INFO  L136        LiptonReduction]: Total number of compositions: 77
[2024-03-11 22:25:50,275 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 22:25:50,275 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@671a0df9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 22:25:50,275 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-11 22:25:50,277 INFO  L130       PetriNetUnfolder]: 0/15 cut-off events.
[2024-03-11 22:25:50,277 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 22:25:50,277 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:50,277 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:50,278 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:50,278 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:50,278 INFO  L85        PathProgramCache]: Analyzing trace with hash 1025009828, now seen corresponding path program 1 times
[2024-03-11 22:25:50,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:50,278 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484910119]
[2024-03-11 22:25:50,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:50,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:50,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:50,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:50,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:50,388 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484910119]
[2024-03-11 22:25:50,388 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484910119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:50,388 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:50,388 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:50,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418993578]
[2024-03-11 22:25:50,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:50,388 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:50,388 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:50,389 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:50,389 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:50,589 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 216
[2024-03-11 22:25:50,590 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 154 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:50,590 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:50,590 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 216
[2024-03-11 22:25:50,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:51,153 INFO  L130       PetriNetUnfolder]: 2688/5657 cut-off events.
[2024-03-11 22:25:51,153 INFO  L131       PetriNetUnfolder]: For 191/349 co-relation queries the response was YES.
[2024-03-11 22:25:51,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10270 conditions, 5657 events. 2688/5657 cut-off events. For 191/349 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 39599 event pairs, 783 based on Foata normal form. 0/5257 useless extension candidates. Maximal degree in co-relation 4885. Up to 3254 conditions per place. 
[2024-03-11 22:25:51,168 INFO  L137   encePairwiseOnDemand]: 196/216 looper letters, 67 selfloop transitions, 42 changer transitions 0/141 dead transitions.
[2024-03-11 22:25:51,168 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 141 transitions, 526 flow
[2024-03-11 22:25:51,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:51,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:51,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions.
[2024-03-11 22:25:51,170 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902777777777778
[2024-03-11 22:25:51,170 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 765 transitions.
[2024-03-11 22:25:51,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions.
[2024-03-11 22:25:51,170 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:51,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions.
[2024-03-11 22:25:51,171 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,173 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,173 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,173 INFO  L175             Difference]: Start difference. First operand has 71 places, 68 transitions, 154 flow. Second operand 6 states and 765 transitions.
[2024-03-11 22:25:51,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 141 transitions, 526 flow
[2024-03-11 22:25:51,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 141 transitions, 526 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:51,175 INFO  L231             Difference]: Finished difference. Result has 81 places, 110 transitions, 446 flow
[2024-03-11 22:25:51,175 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=81, PETRI_TRANSITIONS=110}
[2024-03-11 22:25:51,175 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places.
[2024-03-11 22:25:51,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 110 transitions, 446 flow
[2024-03-11 22:25:51,176 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,176 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:51,176 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:51,176 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 22:25:51,176 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:51,176 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:51,176 INFO  L85        PathProgramCache]: Analyzing trace with hash 702034174, now seen corresponding path program 1 times
[2024-03-11 22:25:51,176 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:51,177 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410416631]
[2024-03-11 22:25:51,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:51,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:51,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:51,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:51,205 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:51,205 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410416631]
[2024-03-11 22:25:51,205 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410416631] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:51,205 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:51,205 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 22:25:51,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492814071]
[2024-03-11 22:25:51,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:51,206 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-11 22:25:51,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:51,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-11 22:25:51,206 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-11 22:25:51,251 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 216
[2024-03-11 22:25:51,251 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 110 transitions, 446 flow. Second operand  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,251 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:51,251 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 216
[2024-03-11 22:25:51,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:51,567 INFO  L130       PetriNetUnfolder]: 1404/3806 cut-off events.
[2024-03-11 22:25:51,567 INFO  L131       PetriNetUnfolder]: For 1064/1237 co-relation queries the response was YES.
[2024-03-11 22:25:51,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8227 conditions, 3806 events. 1404/3806 cut-off events. For 1064/1237 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 29037 event pairs, 471 based on Foata normal form. 0/3548 useless extension candidates. Maximal degree in co-relation 3324. Up to 1373 conditions per place. 
[2024-03-11 22:25:51,579 INFO  L137   encePairwiseOnDemand]: 212/216 looper letters, 29 selfloop transitions, 3 changer transitions 2/119 dead transitions.
[2024-03-11 22:25:51,579 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 119 transitions, 538 flow
[2024-03-11 22:25:51,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 22:25:51,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 22:25:51,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions.
[2024-03-11 22:25:51,580 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6168981481481481
[2024-03-11 22:25:51,580 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 533 transitions.
[2024-03-11 22:25:51,580 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions.
[2024-03-11 22:25:51,580 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:51,580 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions.
[2024-03-11 22:25:51,581 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,582 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,582 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,582 INFO  L175             Difference]: Start difference. First operand has 81 places, 110 transitions, 446 flow. Second operand 4 states and 533 transitions.
[2024-03-11 22:25:51,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 119 transitions, 538 flow
[2024-03-11 22:25:51,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 538 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 22:25:51,586 INFO  L231             Difference]: Finished difference. Result has 86 places, 112 transitions, 466 flow
[2024-03-11 22:25:51,586 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=86, PETRI_TRANSITIONS=112}
[2024-03-11 22:25:51,587 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 15 predicate places.
[2024-03-11 22:25:51,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 466 flow
[2024-03-11 22:25:51,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,587 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:51,587 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:51,587 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 22:25:51,587 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:51,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:51,588 INFO  L85        PathProgramCache]: Analyzing trace with hash 978159371, now seen corresponding path program 1 times
[2024-03-11 22:25:51,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:51,588 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799161131]
[2024-03-11 22:25:51,588 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:51,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:51,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:51,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:51,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:51,679 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799161131]
[2024-03-11 22:25:51,679 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799161131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:51,679 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:51,679 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:51,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006237004]
[2024-03-11 22:25:51,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:51,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:51,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:51,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:51,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:51,899 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 216
[2024-03-11 22:25:51,900 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 466 flow. Second operand  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:51,900 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:51,900 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 216
[2024-03-11 22:25:51,900 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:52,956 INFO  L130       PetriNetUnfolder]: 6027/11517 cut-off events.
[2024-03-11 22:25:52,956 INFO  L131       PetriNetUnfolder]: For 5796/5964 co-relation queries the response was YES.
[2024-03-11 22:25:52,971 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29319 conditions, 11517 events. 6027/11517 cut-off events. For 5796/5964 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 84864 event pairs, 1195 based on Foata normal form. 19/11173 useless extension candidates. Maximal degree in co-relation 29191. Up to 6562 conditions per place. 
[2024-03-11 22:25:52,996 INFO  L137   encePairwiseOnDemand]: 189/216 looper letters, 114 selfloop transitions, 104 changer transitions 1/252 dead transitions.
[2024-03-11 22:25:52,997 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 252 transitions, 1498 flow
[2024-03-11 22:25:52,998 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:52,998 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:52,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions.
[2024-03-11 22:25:52,999 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5763888888888888
[2024-03-11 22:25:52,999 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 747 transitions.
[2024-03-11 22:25:52,999 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions.
[2024-03-11 22:25:52,999 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:52,999 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions.
[2024-03-11 22:25:53,000 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:53,001 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:53,002 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:53,002 INFO  L175             Difference]: Start difference. First operand has 86 places, 112 transitions, 466 flow. Second operand 6 states and 747 transitions.
[2024-03-11 22:25:53,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 252 transitions, 1498 flow
[2024-03-11 22:25:53,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 252 transitions, 1495 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:53,012 INFO  L231             Difference]: Finished difference. Result has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:25:53,012 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=95, PETRI_TRANSITIONS=215}
[2024-03-11 22:25:53,012 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 24 predicate places.
[2024-03-11 22:25:53,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 215 transitions, 1492 flow
[2024-03-11 22:25:53,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:53,013 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:53,013 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:53,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 22:25:53,013 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:53,014 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:53,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -445029695, now seen corresponding path program 1 times
[2024-03-11 22:25:53,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:53,014 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095862936]
[2024-03-11 22:25:53,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:53,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:53,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:53,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:53,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:53,169 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095862936]
[2024-03-11 22:25:53,169 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095862936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:25:53,170 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:25:53,170 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:25:53,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217886482]
[2024-03-11 22:25:53,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:25:53,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:25:53,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:53,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:25:53,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:25:53,274 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 216
[2024-03-11 22:25:53,274 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 215 transitions, 1492 flow. Second operand  has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:53,275 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:53,275 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 216
[2024-03-11 22:25:53,275 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:25:55,324 INFO  L130       PetriNetUnfolder]: 10401/18217 cut-off events.
[2024-03-11 22:25:55,325 INFO  L131       PetriNetUnfolder]: For 22474/22699 co-relation queries the response was YES.
[2024-03-11 22:25:55,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61662 conditions, 18217 events. 10401/18217 cut-off events. For 22474/22699 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 130190 event pairs, 3271 based on Foata normal form. 4/17410 useless extension candidates. Maximal degree in co-relation 43305. Up to 14680 conditions per place. 
[2024-03-11 22:25:55,415 INFO  L137   encePairwiseOnDemand]: 182/216 looper letters, 236 selfloop transitions, 178 changer transitions 0/433 dead transitions.
[2024-03-11 22:25:55,415 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 433 transitions, 3380 flow
[2024-03-11 22:25:55,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:25:55,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:25:55,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions.
[2024-03-11 22:25:55,417 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6095679012345679
[2024-03-11 22:25:55,417 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 790 transitions.
[2024-03-11 22:25:55,418 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions.
[2024-03-11 22:25:55,418 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:25:55,418 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions.
[2024-03-11 22:25:55,419 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:55,420 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:55,421 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:55,421 INFO  L175             Difference]: Start difference. First operand has 95 places, 215 transitions, 1492 flow. Second operand 6 states and 790 transitions.
[2024-03-11 22:25:55,421 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 433 transitions, 3380 flow
[2024-03-11 22:25:55,447 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 433 transitions, 3370 flow, removed 5 selfloop flow, removed 1 redundant places.
[2024-03-11 22:25:55,451 INFO  L231             Difference]: Finished difference. Result has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:25:55,451 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2975, PETRI_PLACES=102, PETRI_TRANSITIONS=377}
[2024-03-11 22:25:55,451 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 31 predicate places.
[2024-03-11 22:25:55,452 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 377 transitions, 2975 flow
[2024-03-11 22:25:55,452 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:55,452 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:25:55,452 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:25:55,452 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 22:25:55,453 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:25:55,453 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:25:55,453 INFO  L85        PathProgramCache]: Analyzing trace with hash 1325300838, now seen corresponding path program 1 times
[2024-03-11 22:25:55,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:25:55,453 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549260499]
[2024-03-11 22:25:55,453 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:55,454 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:25:55,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:55,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:55,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:25:55,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549260499]
[2024-03-11 22:25:55,715 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549260499] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:25:55,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857345142]
[2024-03-11 22:25:55,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:25:55,715 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:25:55,715 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:25:55,716 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:25:55,718 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-11 22:25:55,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:25:55,858 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:25:55,863 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:25:55,884 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:25:55,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:25:55,974 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:25:56,003 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:56,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:25:56,039 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:25:56,039 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:25:56,083 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:25:56,085 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:25:56,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:25:56,096 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:25:56,139 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:25:56,155 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1044 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:25:56,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:25:56,283 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857345142] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:25:56,283 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:25:56,283 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23
[2024-03-11 22:25:56,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684275762]
[2024-03-11 22:25:56,283 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:25:56,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-11 22:25:56,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:25:56,284 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-11 22:25:56,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=417, Unknown=2, NotChecked=86, Total=600
[2024-03-11 22:25:56,310 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 65 out of 216
[2024-03-11 22:25:56,311 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 377 transitions, 2975 flow. Second operand  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:25:56,311 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:25:56,311 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 216
[2024-03-11 22:25:56,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:01,062 INFO  L130       PetriNetUnfolder]: 16562/27029 cut-off events.
[2024-03-11 22:26:01,062 INFO  L131       PetriNetUnfolder]: For 50816/50822 co-relation queries the response was YES.
[2024-03-11 22:26:01,117 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109425 conditions, 27029 events. 16562/27029 cut-off events. For 50816/50822 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 187783 event pairs, 4731 based on Foata normal form. 6/24531 useless extension candidates. Maximal degree in co-relation 73100. Up to 19181 conditions per place. 
[2024-03-11 22:26:01,211 INFO  L137   encePairwiseOnDemand]: 183/216 looper letters, 551 selfloop transitions, 371 changer transitions 1/926 dead transitions.
[2024-03-11 22:26:01,212 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 926 transitions, 8498 flow
[2024-03-11 22:26:01,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:26:01,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:26:01,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1563 transitions.
[2024-03-11 22:26:01,214 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4020061728395062
[2024-03-11 22:26:01,214 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1563 transitions.
[2024-03-11 22:26:01,214 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1563 transitions.
[2024-03-11 22:26:01,215 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:01,215 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1563 transitions.
[2024-03-11 22:26:01,217 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 86.83333333333333) internal successors, (1563), 18 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:01,220 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:01,220 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:01,221 INFO  L175             Difference]: Start difference. First operand has 102 places, 377 transitions, 2975 flow. Second operand 18 states and 1563 transitions.
[2024-03-11 22:26:01,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 926 transitions, 8498 flow
[2024-03-11 22:26:01,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 926 transitions, 8378 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-11 22:26:01,607 INFO  L231             Difference]: Finished difference. Result has 133 places, 653 transitions, 6935 flow
[2024-03-11 22:26:01,607 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6935, PETRI_PLACES=133, PETRI_TRANSITIONS=653}
[2024-03-11 22:26:01,608 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 62 predicate places.
[2024-03-11 22:26:01,608 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 653 transitions, 6935 flow
[2024-03-11 22:26:01,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 67.84) internal successors, (1696), 25 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:01,609 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:01,609 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:01,616 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-11 22:26:01,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-11 22:26:01,810 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:01,811 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:01,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -832876641, now seen corresponding path program 1 times
[2024-03-11 22:26:01,812 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:01,812 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949803287]
[2024-03-11 22:26:01,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:01,813 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:01,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:02,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:02,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:02,057 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949803287]
[2024-03-11 22:26:02,057 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949803287] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:02,057 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52991921]
[2024-03-11 22:26:02,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:02,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:02,057 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:02,059 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:26:02,060 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-11 22:26:02,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:02,196 INFO  L263         TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:26:02,202 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:02,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:26:02,342 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:26:02,365 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,366 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:26:02,404 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,405 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,406 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:26:02,445 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,447 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,448 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,449 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:26:02,495 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:02,495 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:02,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:02,524 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:02,547 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false
[2024-03-11 22:26:02,566 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))))) is different from false
[2024-03-11 22:26:02,585 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2)))))) is different from false
[2024-03-11 22:26:02,606 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))))) is different from false
[2024-03-11 22:26:02,622 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:02,623 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:26:02,629 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:02,629 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:26:02,632 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:26:02,642 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:02,643 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:26:02,647 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:02,648 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:26:02,652 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:02,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:26:02,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-11 22:26:02,723 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [52991921] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:02,723 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:02,723 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2024-03-11 22:26:02,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723698317]
[2024-03-11 22:26:02,723 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:02,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-03-11 22:26:02,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:02,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-03-11 22:26:02,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=461, Unknown=4, NotChecked=188, Total=756
[2024-03-11 22:26:02,902 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 67 out of 216
[2024-03-11 22:26:02,903 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 653 transitions, 6935 flow. Second operand  has 28 states, 28 states have (on average 69.53571428571429) internal successors, (1947), 28 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:02,903 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:02,903 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 216
[2024-03-11 22:26:02,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:09,275 INFO  L130       PetriNetUnfolder]: 19305/31862 cut-off events.
[2024-03-11 22:26:09,275 INFO  L131       PetriNetUnfolder]: For 116138/116144 co-relation queries the response was YES.
[2024-03-11 22:26:09,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 154893 conditions, 31862 events. 19305/31862 cut-off events. For 116138/116144 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 227943 event pairs, 3529 based on Foata normal form. 230/29273 useless extension candidates. Maximal degree in co-relation 134976. Up to 15974 conditions per place. 
[2024-03-11 22:26:09,531 INFO  L137   encePairwiseOnDemand]: 186/216 looper letters, 841 selfloop transitions, 489 changer transitions 0/1333 dead transitions.
[2024-03-11 22:26:09,531 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 1333 transitions, 15562 flow
[2024-03-11 22:26:09,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-11 22:26:09,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-11 22:26:09,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1382 transitions.
[2024-03-11 22:26:09,534 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.39988425925925924
[2024-03-11 22:26:09,534 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1382 transitions.
[2024-03-11 22:26:09,534 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1382 transitions.
[2024-03-11 22:26:09,534 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:09,534 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1382 transitions.
[2024-03-11 22:26:09,535 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 86.375) internal successors, (1382), 16 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:09,538 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 216.0) internal successors, (3672), 17 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:09,538 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 216.0) internal successors, (3672), 17 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:09,538 INFO  L175             Difference]: Start difference. First operand has 133 places, 653 transitions, 6935 flow. Second operand 16 states and 1382 transitions.
[2024-03-11 22:26:09,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 1333 transitions, 15562 flow
[2024-03-11 22:26:10,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1333 transitions, 15515 flow, removed 22 selfloop flow, removed 1 redundant places.
[2024-03-11 22:26:10,901 INFO  L231             Difference]: Finished difference. Result has 154 places, 931 transitions, 11989 flow
[2024-03-11 22:26:10,902 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=6889, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=11989, PETRI_PLACES=154, PETRI_TRANSITIONS=931}
[2024-03-11 22:26:10,902 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 83 predicate places.
[2024-03-11 22:26:10,902 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 931 transitions, 11989 flow
[2024-03-11 22:26:10,903 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 69.53571428571429) internal successors, (1947), 28 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:10,903 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:10,903 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:10,912 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-11 22:26:11,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-11 22:26:11,105 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:11,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:11,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 491266937, now seen corresponding path program 1 times
[2024-03-11 22:26:11,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:11,106 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885522140]
[2024-03-11 22:26:11,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:11,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:11,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:11,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:11,164 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:11,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885522140]
[2024-03-11 22:26:11,164 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885522140] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:11,164 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871983967]
[2024-03-11 22:26:11,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:11,164 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:11,164 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:11,165 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:26:11,166 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-11 22:26:11,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:11,270 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 22:26:11,272 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:11,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:11,311 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:11,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:11,349 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871983967] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:11,349 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:11,349 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-11 22:26:11,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362957684]
[2024-03-11 22:26:11,349 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:11,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-11 22:26:11,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:11,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-11 22:26:11,350 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-11 22:26:11,454 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 216
[2024-03-11 22:26:11,455 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 931 transitions, 11989 flow. Second operand  has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:11,455 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:11,455 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 216
[2024-03-11 22:26:11,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:13,433 INFO  L130       PetriNetUnfolder]: 6334/13137 cut-off events.
[2024-03-11 22:26:13,433 INFO  L131       PetriNetUnfolder]: For 64325/68196 co-relation queries the response was YES.
[2024-03-11 22:26:13,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65016 conditions, 13137 events. 6334/13137 cut-off events. For 64325/68196 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 106661 event pairs, 537 based on Foata normal form. 734/13270 useless extension candidates. Maximal degree in co-relation 59863. Up to 5422 conditions per place. 
[2024-03-11 22:26:13,709 INFO  L137   encePairwiseOnDemand]: 209/216 looper letters, 148 selfloop transitions, 7 changer transitions 18/846 dead transitions.
[2024-03-11 22:26:13,709 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 846 transitions, 10949 flow
[2024-03-11 22:26:13,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 22:26:13,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 22:26:13,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 893 transitions.
[2024-03-11 22:26:13,710 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5906084656084656
[2024-03-11 22:26:13,710 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 893 transitions.
[2024-03-11 22:26:13,710 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 893 transitions.
[2024-03-11 22:26:13,711 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:13,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 893 transitions.
[2024-03-11 22:26:13,712 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:13,713 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:13,713 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:13,713 INFO  L175             Difference]: Start difference. First operand has 154 places, 931 transitions, 11989 flow. Second operand 7 states and 893 transitions.
[2024-03-11 22:26:13,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 846 transitions, 10949 flow
[2024-03-11 22:26:14,013 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 846 transitions, 10777 flow, removed 68 selfloop flow, removed 5 redundant places.
[2024-03-11 22:26:14,023 INFO  L231             Difference]: Finished difference. Result has 157 places, 792 transitions, 9860 flow
[2024-03-11 22:26:14,023 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=10022, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9860, PETRI_PLACES=157, PETRI_TRANSITIONS=792}
[2024-03-11 22:26:14,024 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 86 predicate places.
[2024-03-11 22:26:14,024 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 792 transitions, 9860 flow
[2024-03-11 22:26:14,024 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 124.0) internal successors, (1116), 9 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:14,024 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:14,024 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:14,032 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-03-11 22:26:14,225 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-11 22:26:14,226 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:14,226 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:14,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007172311, now seen corresponding path program 1 times
[2024-03-11 22:26:14,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:14,227 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265648340]
[2024-03-11 22:26:14,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:14,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:14,246 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:14,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:14,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:14,494 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265648340]
[2024-03-11 22:26:14,494 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265648340] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:14,494 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505557798]
[2024-03-11 22:26:14,494 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:14,494 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:14,494 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:14,495 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:26:14,498 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-11 22:26:14,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:14,604 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-11 22:26:14,606 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:14,630 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:26:14,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:26:14,716 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:26:14,754 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:14,754 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:26:14,826 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:14,826 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:26:14,865 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:14,866 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:14,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:14,878 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:14,896 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1374 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1374 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:26:14,914 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-11 22:26:14,982 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1374 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:26:15,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:26:15,080 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [505557798] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:15,081 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:15,081 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24
[2024-03-11 22:26:15,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537156157]
[2024-03-11 22:26:15,081 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:15,081 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2024-03-11 22:26:15,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:15,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2024-03-11 22:26:15,082 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650
[2024-03-11 22:26:15,083 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 216
[2024-03-11 22:26:15,084 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 792 transitions, 9860 flow. Second operand  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:15,084 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:15,084 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 216
[2024-03-11 22:26:15,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:22,629 INFO  L130       PetriNetUnfolder]: 16470/27524 cut-off events.
[2024-03-11 22:26:22,629 INFO  L131       PetriNetUnfolder]: For 132938/132944 co-relation queries the response was YES.
[2024-03-11 22:26:22,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148110 conditions, 27524 events. 16470/27524 cut-off events. For 132938/132944 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 195506 event pairs, 3849 based on Foata normal form. 6/25403 useless extension candidates. Maximal degree in co-relation 141328. Up to 18797 conditions per place. 
[2024-03-11 22:26:22,853 INFO  L137   encePairwiseOnDemand]: 152/216 looper letters, 840 selfloop transitions, 571 changer transitions 8/1422 dead transitions.
[2024-03-11 22:26:22,854 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1422 transitions, 18141 flow
[2024-03-11 22:26:22,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:26:22,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:26:22,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1546 transitions.
[2024-03-11 22:26:22,856 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3976337448559671
[2024-03-11 22:26:22,856 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1546 transitions.
[2024-03-11 22:26:22,857 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1546 transitions.
[2024-03-11 22:26:22,857 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:22,857 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1546 transitions.
[2024-03-11 22:26:22,859 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.88888888888889) internal successors, (1546), 18 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:22,862 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:22,862 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:22,862 INFO  L175             Difference]: Start difference. First operand has 157 places, 792 transitions, 9860 flow. Second operand 18 states and 1546 transitions.
[2024-03-11 22:26:22,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 1422 transitions, 18141 flow
[2024-03-11 22:26:24,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1422 transitions, 17732 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-03-11 22:26:24,136 INFO  L231             Difference]: Finished difference. Result has 172 places, 1135 transitions, 15337 flow
[2024-03-11 22:26:24,137 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=9486, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=300, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=15337, PETRI_PLACES=172, PETRI_TRANSITIONS=1135}
[2024-03-11 22:26:24,137 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 101 predicate places.
[2024-03-11 22:26:24,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 1135 transitions, 15337 flow
[2024-03-11 22:26:24,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 64.88461538461539) internal successors, (1687), 26 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:24,138 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:24,138 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:24,148 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-03-11 22:26:24,339 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:24,340 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:24,340 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:24,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -1248194675, now seen corresponding path program 1 times
[2024-03-11 22:26:24,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:24,341 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106789670]
[2024-03-11 22:26:24,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:24,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:24,361 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:24,644 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:24,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:24,644 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106789670]
[2024-03-11 22:26:24,644 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106789670] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:24,644 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868413863]
[2024-03-11 22:26:24,645 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:24,645 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:24,645 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:24,646 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:26:24,647 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-11 22:26:24,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:24,791 INFO  L263         TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 26 conjunts are in the unsatisfiable core
[2024-03-11 22:26:24,796 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:24,820 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9
[2024-03-11 22:26:24,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:26:24,944 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:24,945 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:26:24,978 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:24,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:24,980 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:26:25,017 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:25,018 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:25,019 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:25,020 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:26:25,066 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:25,067 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:25,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:25,097 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:25,116 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-11 22:26:25,132 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-11 22:26:25,152 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-11 22:26:25,176 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))) is different from false
[2024-03-11 22:26:25,197 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:25,198 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-11 22:26:25,203 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:25,203 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-11 22:26:25,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:26:25,216 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:25,218 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-11 22:26:25,224 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:25,224 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:26:25,231 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:26:25,231 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-11 22:26:25,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:25,292 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868413863] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:25,292 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:25,292 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26
[2024-03-11 22:26:25,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200139607]
[2024-03-11 22:26:25,292 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:25,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2024-03-11 22:26:25,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:25,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2024-03-11 22:26:25,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=461, Unknown=4, NotChecked=188, Total=756
[2024-03-11 22:26:25,389 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 216
[2024-03-11 22:26:25,390 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 1135 transitions, 15337 flow. Second operand  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:25,390 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:25,390 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 216
[2024-03-11 22:26:25,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:34,548 INFO  L130       PetriNetUnfolder]: 19254/32305 cut-off events.
[2024-03-11 22:26:34,548 INFO  L131       PetriNetUnfolder]: For 216161/216175 co-relation queries the response was YES.
[2024-03-11 22:26:34,697 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 205885 conditions, 32305 events. 19254/32305 cut-off events. For 216161/216175 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 236548 event pairs, 3070 based on Foata normal form. 371/30989 useless extension candidates. Maximal degree in co-relation 189959. Up to 14027 conditions per place. 
[2024-03-11 22:26:34,832 INFO  L137   encePairwiseOnDemand]: 179/216 looper letters, 1206 selfloop transitions, 801 changer transitions 2/2012 dead transitions.
[2024-03-11 22:26:34,832 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2012 transitions, 29964 flow
[2024-03-11 22:26:34,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2024-03-11 22:26:34,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2024-03-11 22:26:34,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1403 transitions.
[2024-03-11 22:26:34,834 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3820806100217865
[2024-03-11 22:26:34,834 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1403 transitions.
[2024-03-11 22:26:34,834 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1403 transitions.
[2024-03-11 22:26:34,835 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:34,835 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1403 transitions.
[2024-03-11 22:26:34,837 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 82.52941176470588) internal successors, (1403), 17 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:34,839 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 216.0) internal successors, (3888), 18 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:34,839 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 216.0) internal successors, (3888), 18 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:34,839 INFO  L175             Difference]: Start difference. First operand has 172 places, 1135 transitions, 15337 flow. Second operand 17 states and 1403 transitions.
[2024-03-11 22:26:34,839 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2012 transitions, 29964 flow
[2024-03-11 22:26:36,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 2012 transitions, 29508 flow, removed 207 selfloop flow, removed 9 redundant places.
[2024-03-11 22:26:36,925 INFO  L231             Difference]: Finished difference. Result has 188 places, 1616 transitions, 25319 flow
[2024-03-11 22:26:36,926 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=15145, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=393, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=25319, PETRI_PLACES=188, PETRI_TRANSITIONS=1616}
[2024-03-11 22:26:36,926 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 117 predicate places.
[2024-03-11 22:26:36,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 1616 transitions, 25319 flow
[2024-03-11 22:26:36,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 28 states have (on average 66.60714285714286) internal successors, (1865), 28 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:36,926 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:36,927 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:36,934 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-11 22:26:37,127 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:37,128 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:37,129 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:37,129 INFO  L85        PathProgramCache]: Analyzing trace with hash -445281091, now seen corresponding path program 1 times
[2024-03-11 22:26:37,129 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:37,129 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459795527]
[2024-03-11 22:26:37,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:37,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:37,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:37,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 22:26:37,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:37,313 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459795527]
[2024-03-11 22:26:37,314 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459795527] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 22:26:37,314 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 22:26:37,314 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-11 22:26:37,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661718637]
[2024-03-11 22:26:37,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 22:26:37,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-11 22:26:37,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:37,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-11 22:26:37,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-11 22:26:37,613 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 113 out of 216
[2024-03-11 22:26:37,613 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1616 transitions, 25319 flow. Second operand  has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:37,613 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:37,614 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 216
[2024-03-11 22:26:37,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:26:42,377 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L1017-2-->L1017-4: Formula: (= |v_#race_187| (store |v_#race_188| v_threadThread2of2ForFork0_~t~0.base_19 (store (select |v_#race_188| v_threadThread2of2ForFork0_~t~0.base_19) v_threadThread2of2ForFork0_~t~0.offset_19 |v_threadThread2of2ForFork0_#t~nondet4_19|)))  InVars {#race=|v_#race_188|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  OutVars{#race=|v_#race_187|, threadThread2of2ForFork0_~t~0.offset=v_threadThread2of2ForFork0_~t~0.offset_19, threadThread2of2ForFork0_#t~nondet4=|v_threadThread2of2ForFork0_#t~nondet4_19|, threadThread2of2ForFork0_~t~0.base=v_threadThread2of2ForFork0_~t~0.base_19}  AuxVars[]  AssignedVars[#race, threadThread2of2ForFork0_#t~nondet4][283], [Black: 370#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 376#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 362#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 366#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 768#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), 766#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_main_~breads_total~0#1|)), Black: 372#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 360#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 356#(and (= |ULTIMATE.start_main_#t~mem9#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 374#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1044 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1044 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1044) threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset)))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), threadThread1of2ForFork0InUse, Black: 379#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 358#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.base| 2) |ULTIMATE.start_main_~#ts~0#1.base|)), threadThread2of2ForFork0InUse, 957#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 146#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 147#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 145#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0)), Black: 144#(= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0), 46#threadEXITtrue, 142#true, Black: 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 1173#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 165#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 1183#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1192#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 168#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 1190#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| (store (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 1185#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (forall ((v_ArrVal_1487 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1487) |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), 364#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|)), Black: 1175#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1188#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1043#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0)), Black: 177#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)), Black: 179#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 175#true, Black: 180#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 178#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 163#true, 107#L1017-4true, 105#L1026-14true, Black: 974#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1374 (Array Int Int))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select (store |#race| |ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1374) threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset)))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 961#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 970#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 965#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), 1203#true, Black: 579#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 976#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ threadThread1of2ForFork0_~t~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 3 threadThread1of2ForFork0_~t~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) (+ 2 threadThread1of2ForFork0_~t~0.offset))) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset))), Black: 581#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0)), Black: 589#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 591#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (forall ((v_ArrVal_1157 (Array Int Int))) (= (select (select (store (store |#race| |ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (+ 3 |ULTIMATE.start_main_~#ts~0#1.offset|) 0)) threadThread1of2ForFork0_~t~0.base v_ArrVal_1157) |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 596#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |ULTIMATE.start_main_~#ts~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), Black: 594#(and (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) (+ |ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|) 0) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), 587#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |ULTIMATE.start_main_~#ts~0#1.offset| 0)), 1181#(and (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 201#(<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#ts~0#1.base|) |ULTIMATE.start_main_~#ts~0#1.offset|)) |ULTIMATE.start_main_~#ts~0#1.base|), Black: 368#(and (<= (+ threadThread1of2ForFork0_~t~0.base 2) |ULTIMATE.start_main_~#ts~0#1.base|) (<= (+ 2 |threadThread1of2ForFork0_#in~arg.base|) |ULTIMATE.start_main_~#ts~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| threadThread1of2ForFork0_~t~0.base) threadThread1of2ForFork0_~t~0.offset)))])
[2024-03-11 22:26:42,377 INFO  L383   tUnfolder$Statistics]: this new event has 53 ancestors and is cut-off event
[2024-03-11 22:26:42,377 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:42,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:42,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 53 ancestors and is cut-off event
[2024-03-11 22:26:44,612 INFO  L130       PetriNetUnfolder]: 16034/28769 cut-off events.
[2024-03-11 22:26:44,612 INFO  L131       PetriNetUnfolder]: For 300301/307562 co-relation queries the response was YES.
[2024-03-11 22:26:44,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 200087 conditions, 28769 events. 16034/28769 cut-off events. For 300301/307562 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 230803 event pairs, 2888 based on Foata normal form. 791/28536 useless extension candidates. Maximal degree in co-relation 169772. Up to 17196 conditions per place. 
[2024-03-11 22:26:45,017 INFO  L137   encePairwiseOnDemand]: 201/216 looper letters, 1261 selfloop transitions, 173 changer transitions 1/1803 dead transitions.
[2024-03-11 22:26:45,017 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1803 transitions, 31107 flow
[2024-03-11 22:26:45,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-11 22:26:45,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-11 22:26:45,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions.
[2024-03-11 22:26:45,019 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.591820987654321
[2024-03-11 22:26:45,019 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 767 transitions.
[2024-03-11 22:26:45,019 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions.
[2024-03-11 22:26:45,019 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:26:45,019 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions.
[2024-03-11 22:26:45,021 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:45,023 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:45,023 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:45,023 INFO  L175             Difference]: Start difference. First operand has 188 places, 1616 transitions, 25319 flow. Second operand 6 states and 767 transitions.
[2024-03-11 22:26:45,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1803 transitions, 31107 flow
[2024-03-11 22:26:47,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 1803 transitions, 30516 flow, removed 279 selfloop flow, removed 6 redundant places.
[2024-03-11 22:26:47,128 INFO  L231             Difference]: Finished difference. Result has 192 places, 1775 transitions, 28187 flow
[2024-03-11 22:26:47,129 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=24752, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=28187, PETRI_PLACES=192, PETRI_TRANSITIONS=1775}
[2024-03-11 22:26:47,129 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 121 predicate places.
[2024-03-11 22:26:47,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 1775 transitions, 28187 flow
[2024-03-11 22:26:47,130 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:47,130 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:26:47,130 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:26:47,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-11 22:26:47,130 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:26:47,130 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:26:47,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -2066678485, now seen corresponding path program 2 times
[2024-03-11 22:26:47,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:26:47,130 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968014071]
[2024-03-11 22:26:47,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:26:47,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:26:47,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:26:47,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:47,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:26:47,546 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968014071]
[2024-03-11 22:26:47,547 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968014071] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:26:47,547 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569535780]
[2024-03-11 22:26:47,547 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:26:47,547 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:26:47,547 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:26:47,548 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:26:47,549 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-11 22:26:47,733 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:26:47,733 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:26:47,734 INFO  L263         TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core
[2024-03-11 22:26:47,738 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:26:47,801 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2024-03-11 22:26:47,812 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:26:48,022 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:26:48,068 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:26:48,107 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,108 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:26:48,158 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,159 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,160 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,160 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:26:48,225 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,227 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:48,246 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,246 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:48,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:48,295 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,296 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:26:48,375 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,376 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,377 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,378 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:26:48,379 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:26:48,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:26:48,418 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:26:48,567 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1673 Int) (v_ArrVal_1671 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1671))) (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1673))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1673 Int) (v_ArrVal_1671 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1671))) (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1673))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1673 Int) (v_ArrVal_1671 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1671))) (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1673))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1673 Int) (v_ArrVal_1671 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1671))) (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset| v_ArrVal_1673))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:26:49,881 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:49,881 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:26:49,901 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:49,901 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 212
[2024-03-11 22:26:49,911 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 190
[2024-03-11 22:26:49,975 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 104
[2024-03-11 22:26:50,090 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:50,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 42
[2024-03-11 22:26:50,113 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:50,114 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 67 treesize of output 60
[2024-03-11 22:26:50,121 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:26:50,131 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:26:50,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 110
[2024-03-11 22:26:50,142 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47
[2024-03-11 22:26:50,149 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 80
[2024-03-11 22:26:50,185 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:50,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:26:50,190 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:26:50,200 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:26:50,200 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 106
[2024-03-11 22:26:50,207 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47
[2024-03-11 22:26:50,215 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 88
[2024-03-11 22:26:50,247 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:26:50,247 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:26:50,253 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-11 22:26:50,264 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:26:50,264 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118
[2024-03-11 22:26:50,272 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53
[2024-03-11 22:26:50,279 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 88
[2024-03-11 22:26:50,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked.
[2024-03-11 22:26:50,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [569535780] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:26:50,958 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:26:50,958 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30
[2024-03-11 22:26:50,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693212699]
[2024-03-11 22:26:50,958 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:26:50,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-11 22:26:50,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:26:50,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-11 22:26:50,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=757, Unknown=23, NotChecked=58, Total=992
[2024-03-11 22:26:51,299 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 216
[2024-03-11 22:26:51,301 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1775 transitions, 28187 flow. Second operand  has 32 states, 32 states have (on average 59.875) internal successors, (1916), 32 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:26:51,301 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:26:51,301 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 216
[2024-03-11 22:26:51,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:27:10,374 INFO  L130       PetriNetUnfolder]: 20552/34450 cut-off events.
[2024-03-11 22:27:10,374 INFO  L131       PetriNetUnfolder]: For 367341/367365 co-relation queries the response was YES.
[2024-03-11 22:27:10,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 260699 conditions, 34450 events. 20552/34450 cut-off events. For 367341/367365 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 256076 event pairs, 3363 based on Foata normal form. 386/33292 useless extension candidates. Maximal degree in co-relation 241211. Up to 19862 conditions per place. 
[2024-03-11 22:27:10,742 INFO  L137   encePairwiseOnDemand]: 155/216 looper letters, 1236 selfloop transitions, 1314 changer transitions 43/2597 dead transitions.
[2024-03-11 22:27:10,742 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 2597 transitions, 43129 flow
[2024-03-11 22:27:10,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-11 22:27:10,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-11 22:27:10,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1519 transitions.
[2024-03-11 22:27:10,745 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3701267056530214
[2024-03-11 22:27:10,745 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1519 transitions.
[2024-03-11 22:27:10,745 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1519 transitions.
[2024-03-11 22:27:10,745 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:27:10,745 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1519 transitions.
[2024-03-11 22:27:10,747 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 79.94736842105263) internal successors, (1519), 19 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:27:10,750 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 216.0) internal successors, (4320), 20 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:27:10,750 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 216.0) internal successors, (4320), 20 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:27:10,750 INFO  L175             Difference]: Start difference. First operand has 192 places, 1775 transitions, 28187 flow. Second operand 19 states and 1519 transitions.
[2024-03-11 22:27:10,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 2597 transitions, 43129 flow
[2024-03-11 22:27:14,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 2597 transitions, 42889 flow, removed 120 selfloop flow, removed 0 redundant places.
[2024-03-11 22:27:14,978 INFO  L231             Difference]: Finished difference. Result has 216 places, 2058 transitions, 37195 flow
[2024-03-11 22:27:14,979 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=27953, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1068, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=37195, PETRI_PLACES=216, PETRI_TRANSITIONS=2058}
[2024-03-11 22:27:14,979 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 145 predicate places.
[2024-03-11 22:27:14,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 2058 transitions, 37195 flow
[2024-03-11 22:27:14,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 59.875) internal successors, (1916), 32 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:27:14,980 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:27:14,980 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:27:14,987 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-11 22:27:15,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:27:15,182 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:27:15,182 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:27:15,183 INFO  L85        PathProgramCache]: Analyzing trace with hash 1944919041, now seen corresponding path program 1 times
[2024-03-11 22:27:15,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:27:15,184 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655004653]
[2024-03-11 22:27:15,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:27:15,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:27:15,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:27:15,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:27:15,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:27:15,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655004653]
[2024-03-11 22:27:15,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655004653] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:27:15,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230058482]
[2024-03-11 22:27:15,969 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:27:15,969 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:27:15,969 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:27:15,970 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:27:15,972 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-11 22:27:16,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:27:16,148 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 65 conjunts are in the unsatisfiable core
[2024-03-11 22:27:16,154 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:27:16,190 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,194 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:27:16,766 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:27:16,766 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:27:16,777 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,778 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,780 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,780 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:27:16,919 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:27:16,920 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:27:16,927 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,929 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,930 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:16,930 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:27:17,179 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:27:17,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2024-03-11 22:27:17,186 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13
[2024-03-11 22:27:17,265 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:27:17,315 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:27:17,380 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,382 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:27:17,551 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,552 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,553 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,553 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:27:17,632 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,633 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,635 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:27:17,635 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:27:17,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:27:17,682 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:27:26,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:27:26,723 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [230058482] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:27:26,723 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:27:26,723 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 13] total 40
[2024-03-11 22:27:26,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784563760]
[2024-03-11 22:27:26,724 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:27:26,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 42 states
[2024-03-11 22:27:26,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:27:26,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2024-03-11 22:27:26,726 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1499, Unknown=20, NotChecked=0, Total=1722
[2024-03-11 22:27:30,545 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 216
[2024-03-11 22:27:30,548 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 2058 transitions, 37195 flow. Second operand  has 42 states, 42 states have (on average 51.26190476190476) internal successors, (2153), 42 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:27:30,548 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:27:30,548 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 216
[2024-03-11 22:27:30,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:27:34,284 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]
[2024-03-11 22:28:12,432 INFO  L130       PetriNetUnfolder]: 21693/36649 cut-off events.
[2024-03-11 22:28:12,433 INFO  L131       PetriNetUnfolder]: For 554152/554152 co-relation queries the response was YES.
[2024-03-11 22:28:12,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 312333 conditions, 36649 events. 21693/36649 cut-off events. For 554152/554152 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 271215 event pairs, 5613 based on Foata normal form. 19/35080 useless extension candidates. Maximal degree in co-relation 292814. Up to 33798 conditions per place. 
[2024-03-11 22:28:13,019 INFO  L137   encePairwiseOnDemand]: 192/216 looper letters, 2669 selfloop transitions, 146 changer transitions 122/2938 dead transitions.
[2024-03-11 22:28:13,020 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 2938 transitions, 54901 flow
[2024-03-11 22:28:13,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2024-03-11 22:28:13,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2024-03-11 22:28:13,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1797 transitions.
[2024-03-11 22:28:13,023 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2868773946360153
[2024-03-11 22:28:13,023 INFO  L72            ComplementDD]: Start complementDD. Operand 29 states and 1797 transitions.
[2024-03-11 22:28:13,023 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 29 states and 1797 transitions.
[2024-03-11 22:28:13,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:28:13,024 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 1797 transitions.
[2024-03-11 22:28:13,026 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 30 states, 29 states have (on average 61.96551724137931) internal successors, (1797), 29 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:13,030 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 30 states, 30 states have (on average 216.0) internal successors, (6480), 30 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:13,030 INFO  L81            ComplementDD]: Finished complementDD. Result  has 30 states, 30 states have (on average 216.0) internal successors, (6480), 30 states have internal predecessors, (6480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:13,030 INFO  L175             Difference]: Start difference. First operand has 216 places, 2058 transitions, 37195 flow. Second operand 29 states and 1797 transitions.
[2024-03-11 22:28:13,030 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 2938 transitions, 54901 flow
[2024-03-11 22:28:20,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 2938 transitions, 54677 flow, removed 80 selfloop flow, removed 12 redundant places.
[2024-03-11 22:28:20,118 INFO  L231             Difference]: Finished difference. Result has 250 places, 2191 transitions, 39946 flow
[2024-03-11 22:28:20,120 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=37000, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1962, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=39946, PETRI_PLACES=250, PETRI_TRANSITIONS=2191}
[2024-03-11 22:28:20,120 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 179 predicate places.
[2024-03-11 22:28:20,121 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 2191 transitions, 39946 flow
[2024-03-11 22:28:20,121 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 42 states, 42 states have (on average 51.26190476190476) internal successors, (2153), 42 states have internal predecessors, (2153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:20,121 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:28:20,121 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:28:20,127 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-11 22:28:20,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2024-03-11 22:28:20,322 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:28:20,323 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:28:20,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -865058449, now seen corresponding path program 2 times
[2024-03-11 22:28:20,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:28:20,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134551959]
[2024-03-11 22:28:20,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:28:20,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:28:20,353 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:28:21,120 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:28:21,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:28:21,121 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134551959]
[2024-03-11 22:28:21,121 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134551959] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:28:21,121 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936073611]
[2024-03-11 22:28:21,121 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:28:21,121 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:28:21,121 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:28:21,122 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:28:21,124 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-11 22:28:21,347 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:28:21,348 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:28:21,350 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 56 conjunts are in the unsatisfiable core
[2024-03-11 22:28:21,354 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:28:21,373 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:21,376 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:21,380 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:28:21,972 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:28:21,973 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:28:21,984 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:21,985 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:21,989 INFO  L321             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2024-03-11 22:28:21,989 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31
[2024-03-11 22:28:22,307 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:28:22,308 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:28:22,319 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-11 22:28:22,320 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13
[2024-03-11 22:28:22,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:28:22,508 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,509 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:28:22,582 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,583 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,584 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:28:22,664 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,665 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,667 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,668 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:28:22,744 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,747 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:22,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54
[2024-03-11 22:28:22,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:28:22,796 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:28:24,216 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse0 (forall ((v_ArrVal_1935 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (or .cse0 (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 1))))) (or .cse0 (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 2))))) (or .cse0 (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) (or (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse1 3)))) .cse0))) is different from false
[2024-03-11 22:28:24,388 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1935 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1935 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1935 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 3) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse1)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1935 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse1)) (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| .cse0 2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))))) is different from false
[2024-03-11 22:28:24,690 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1935 (Array Int Int))) (not (= .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1935 (Array Int Int))) (not (= .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ .cse0 .cse1 2) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ .cse0 .cse1 1)))) (forall ((v_ArrVal_1935 (Array Int Int))) (not (= .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_72| Int)) (or (forall ((v_ArrVal_1934 (Array Int Int))) (not (= (+ .cse0 .cse1 3) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1934) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_1935 (Array Int Int))) (not (= .cse2 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_72| v_ArrVal_1935) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (not (<= |v_ULTIMATE.start_main_#t~mem11#1.base_72| .cse3)))))) is different from false
[2024-03-11 22:28:24,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:28:24,697 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [936073611] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:28:24,697 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:28:24,697 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 39
[2024-03-11 22:28:24,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224434901]
[2024-03-11 22:28:24,697 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:28:24,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-03-11 22:28:24,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:28:24,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-03-11 22:28:24,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1220, Unknown=3, NotChecked=222, Total=1640
[2024-03-11 22:28:24,952 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 216
[2024-03-11 22:28:24,954 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 2191 transitions, 39946 flow. Second operand  has 41 states, 41 states have (on average 51.31707317073171) internal successors, (2104), 41 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:24,954 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:28:24,954 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 216
[2024-03-11 22:28:24,954 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:28:45,903 INFO  L130       PetriNetUnfolder]: 21678/36680 cut-off events.
[2024-03-11 22:28:45,903 INFO  L131       PetriNetUnfolder]: For 680032/680032 co-relation queries the response was YES.
[2024-03-11 22:28:46,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 333089 conditions, 36680 events. 21678/36680 cut-off events. For 680032/680032 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 271671 event pairs, 5775 based on Foata normal form. 16/35108 useless extension candidates. Maximal degree in co-relation 331955. Up to 33798 conditions per place. 
[2024-03-11 22:28:46,359 INFO  L137   encePairwiseOnDemand]: 194/216 looper letters, 2563 selfloop transitions, 87 changer transitions 64/2715 dead transitions.
[2024-03-11 22:28:46,359 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 2715 transitions, 53290 flow
[2024-03-11 22:28:46,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:28:46,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:28:46,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1123 transitions.
[2024-03-11 22:28:46,362 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2888374485596708
[2024-03-11 22:28:46,362 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1123 transitions.
[2024-03-11 22:28:46,362 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1123 transitions.
[2024-03-11 22:28:46,362 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:28:46,363 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1123 transitions.
[2024-03-11 22:28:46,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 62.388888888888886) internal successors, (1123), 18 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:46,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:46,367 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:46,367 INFO  L175             Difference]: Start difference. First operand has 250 places, 2191 transitions, 39946 flow. Second operand 18 states and 1123 transitions.
[2024-03-11 22:28:46,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 2715 transitions, 53290 flow
[2024-03-11 22:28:56,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 2715 transitions, 53048 flow, removed 114 selfloop flow, removed 5 redundant places.
[2024-03-11 22:28:56,498 INFO  L231             Difference]: Finished difference. Result has 270 places, 2250 transitions, 41225 flow
[2024-03-11 22:28:56,500 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=39706, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=41225, PETRI_PLACES=270, PETRI_TRANSITIONS=2250}
[2024-03-11 22:28:56,500 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 199 predicate places.
[2024-03-11 22:28:56,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 2250 transitions, 41225 flow
[2024-03-11 22:28:56,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 41 states have (on average 51.31707317073171) internal successors, (2104), 41 states have internal predecessors, (2104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:28:56,501 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:28:56,501 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:28:56,508 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-11 22:28:56,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-03-11 22:28:56,702 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:28:56,703 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:28:56,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 215115645, now seen corresponding path program 3 times
[2024-03-11 22:28:56,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:28:56,704 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700984073]
[2024-03-11 22:28:56,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:28:56,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:28:56,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:28:57,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:28:57,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:28:57,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700984073]
[2024-03-11 22:28:57,311 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700984073] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:28:57,311 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730534371]
[2024-03-11 22:28:57,311 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-11 22:28:57,312 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:28:57,312 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:28:57,314 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:28:57,316 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-11 22:28:57,508 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-11 22:28:57,508 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:28:57,510 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-03-11 22:28:57,516 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:28:57,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:28:58,158 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:28:58,158 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 65
[2024-03-11 22:28:58,174 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,189 INFO  L321             Elim1Store]: treesize reduction 23, result has 36.1 percent of original size
[2024-03-11 22:28:58,189 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 43
[2024-03-11 22:28:58,204 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:28:58,224 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20
[2024-03-11 22:28:58,394 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-11 22:28:58,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-11 22:28:58,474 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:28:58,539 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:28:58,642 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,643 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,644 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:28:58,799 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-11 22:28:58,810 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-11 22:28:58,891 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:28:58,925 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,927 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,928 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:28:58,929 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:28:59,001 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:28:59,036 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:28:59,064 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:28:59,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:28:59,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:28:59,213 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:28:59,240 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2085 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2085 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2085 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2085 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-11 22:29:07,799 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false
[2024-03-11 22:29:07,824 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) .cse2 v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) .cse2 v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) .cse2 v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2085 (Array Int Int)) (v_ArrVal_2084 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2079))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2084) .cse2 v_ArrVal_2085) c_threadThread1of2ForFork0_~t~0.base) .cse1))))) is different from false
[2024-03-11 22:29:08,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-11 22:29:08,237 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [730534371] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:29:08,237 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:29:08,238 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 35
[2024-03-11 22:29:08,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397312719]
[2024-03-11 22:29:08,238 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:29:08,239 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-03-11 22:29:08,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:29:08,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-03-11 22:29:08,240 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=950, Unknown=41, NotChecked=198, Total=1332
[2024-03-11 22:29:08,459 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 216
[2024-03-11 22:29:08,461 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 2250 transitions, 41225 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:08,461 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:29:08,461 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 216
[2024-03-11 22:29:08,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:29:38,383 INFO  L130       PetriNetUnfolder]: 24444/41088 cut-off events.
[2024-03-11 22:29:38,383 INFO  L131       PetriNetUnfolder]: For 805916/805916 co-relation queries the response was YES.
[2024-03-11 22:29:38,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 376232 conditions, 41088 events. 24444/41088 cut-off events. For 805916/805916 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 305210 event pairs, 5554 based on Foata normal form. 79/39579 useless extension candidates. Maximal degree in co-relation 375272. Up to 34982 conditions per place. 
[2024-03-11 22:29:38,988 INFO  L137   encePairwiseOnDemand]: 176/216 looper letters, 2804 selfloop transitions, 502 changer transitions 9/3316 dead transitions.
[2024-03-11 22:29:38,989 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 3316 transitions, 63143 flow
[2024-03-11 22:29:38,990 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-11 22:29:38,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-11 22:29:38,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2693 transitions.
[2024-03-11 22:29:38,993 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.31168981481481484
[2024-03-11 22:29:38,993 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2693 transitions.
[2024-03-11 22:29:38,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2693 transitions.
[2024-03-11 22:29:38,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:29:38,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2693 transitions.
[2024-03-11 22:29:38,996 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 67.325) internal successors, (2693), 40 states have internal predecessors, (2693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:39,001 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:39,002 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:39,002 INFO  L175             Difference]: Start difference. First operand has 270 places, 2250 transitions, 41225 flow. Second operand 40 states and 2693 transitions.
[2024-03-11 22:29:39,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 3316 transitions, 63143 flow
[2024-03-11 22:29:52,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3316 transitions, 62773 flow, removed 157 selfloop flow, removed 9 redundant places.
[2024-03-11 22:29:52,817 INFO  L231             Difference]: Finished difference. Result has 320 places, 2645 transitions, 50146 flow
[2024-03-11 22:29:52,818 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=40917, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=50146, PETRI_PLACES=320, PETRI_TRANSITIONS=2645}
[2024-03-11 22:29:52,819 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 249 predicate places.
[2024-03-11 22:29:52,819 INFO  L495      AbstractCegarLoop]: Abstraction has has 320 places, 2645 transitions, 50146 flow
[2024-03-11 22:29:52,819 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:52,819 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:29:52,819 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:29:52,826 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-03-11 22:29:53,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-03-11 22:29:53,021 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:29:53,021 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:29:53,022 INFO  L85        PathProgramCache]: Analyzing trace with hash -1767986921, now seen corresponding path program 4 times
[2024-03-11 22:29:53,022 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:29:53,022 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440261574]
[2024-03-11 22:29:53,023 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:29:53,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:29:53,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:29:53,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:29:53,582 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:29:53,582 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440261574]
[2024-03-11 22:29:53,582 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440261574] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:29:53,583 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638559264]
[2024-03-11 22:29:53,583 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-11 22:29:53,583 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:29:53,583 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:29:53,585 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:29:53,586 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-03-11 22:29:53,874 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-11 22:29:53,874 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:29:53,876 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-11 22:29:53,881 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:29:53,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:53,916 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:53,919 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32
[2024-03-11 22:29:53,985 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:29:54,474 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:29:54,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2024-03-11 22:29:54,645 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:29:54,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:29:54,772 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:29:54,871 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-11 22:29:54,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 35
[2024-03-11 22:29:54,935 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:54,936 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:29:55,001 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,003 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,004 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:29:55,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,081 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,083 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,083 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:29:55,174 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:29:55,197 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,198 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:29:55,244 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:29:55,274 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:29:55,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:29:55,378 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:29:55,437 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:29:55,437 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:29:55,459 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2223 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2223 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2223 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-11 22:29:55,501 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2222 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2222) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2223) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:29:56,657 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:56,657 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 56
[2024-03-11 22:29:56,666 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:29:56,666 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 72
[2024-03-11 22:29:56,672 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-11 22:29:56,674 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-11 22:29:56,692 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:29:56,692 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:29:56,698 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:29:56,698 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:29:56,704 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:29:56,704 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-11 22:29:56,960 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:29:56,960 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638559264] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:29:56,961 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:29:56,961 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 13] total 35
[2024-03-11 22:29:56,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124443964]
[2024-03-11 22:29:56,961 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:29:56,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 37 states
[2024-03-11 22:29:56,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:29:56,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2024-03-11 22:29:56,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=965, Unknown=81, NotChecked=134, Total=1332
[2024-03-11 22:29:57,362 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 216
[2024-03-11 22:29:57,364 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 2645 transitions, 50146 flow. Second operand  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:29:57,364 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:29:57,364 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 216
[2024-03-11 22:29:57,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:30:33,539 INFO  L130       PetriNetUnfolder]: 25604/42996 cut-off events.
[2024-03-11 22:30:33,539 INFO  L131       PetriNetUnfolder]: For 996316/996316 co-relation queries the response was YES.
[2024-03-11 22:30:34,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 421057 conditions, 42996 events. 25604/42996 cut-off events. For 996316/996316 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 320907 event pairs, 5677 based on Foata normal form. 37/41445 useless extension candidates. Maximal degree in co-relation 419773. Up to 35552 conditions per place. 
[2024-03-11 22:30:34,240 INFO  L137   encePairwiseOnDemand]: 185/216 looper letters, 3511 selfloop transitions, 613 changer transitions 33/4158 dead transitions.
[2024-03-11 22:30:34,241 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 4158 transitions, 84052 flow
[2024-03-11 22:30:34,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2024-03-11 22:30:34,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2024-03-11 22:30:34,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2495 transitions.
[2024-03-11 22:30:34,245 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.32085905349794236
[2024-03-11 22:30:34,245 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2495 transitions.
[2024-03-11 22:30:34,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2495 transitions.
[2024-03-11 22:30:34,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:30:34,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2495 transitions.
[2024-03-11 22:30:34,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 69.30555555555556) internal successors, (2495), 36 states have internal predecessors, (2495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:30:34,252 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 216.0) internal successors, (7992), 37 states have internal predecessors, (7992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:30:34,253 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 216.0) internal successors, (7992), 37 states have internal predecessors, (7992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:30:34,253 INFO  L175             Difference]: Start difference. First operand has 320 places, 2645 transitions, 50146 flow. Second operand 36 states and 2495 transitions.
[2024-03-11 22:30:34,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 4158 transitions, 84052 flow
[2024-03-11 22:30:53,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 4158 transitions, 82646 flow, removed 669 selfloop flow, removed 21 redundant places.
[2024-03-11 22:30:53,395 INFO  L231             Difference]: Finished difference. Result has 350 places, 3003 transitions, 59316 flow
[2024-03-11 22:30:53,396 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=49296, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=297, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=59316, PETRI_PLACES=350, PETRI_TRANSITIONS=3003}
[2024-03-11 22:30:53,396 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 279 predicate places.
[2024-03-11 22:30:53,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 3003 transitions, 59316 flow
[2024-03-11 22:30:53,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 37 states, 37 states have (on average 56.432432432432435) internal successors, (2088), 37 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:30:53,397 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:30:53,397 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:30:53,405 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2024-03-11 22:30:53,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-03-11 22:30:53,599 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:30:53,599 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:30:53,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 950756487, now seen corresponding path program 5 times
[2024-03-11 22:30:53,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:30:53,600 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73198225]
[2024-03-11 22:30:53,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:30:53,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:30:53,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:30:54,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:30:54,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:30:54,227 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73198225]
[2024-03-11 22:30:54,227 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73198225] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:30:54,227 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797601532]
[2024-03-11 22:30:54,228 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-11 22:30:54,228 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:30:54,228 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:30:54,229 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:30:54,231 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2024-03-11 22:30:54,453 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:30:54,453 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:30:54,455 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-03-11 22:30:54,462 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:30:54,476 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:54,478 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:54,484 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-03-11 22:30:54,485 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44
[2024-03-11 22:30:54,877 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:30:54,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 58
[2024-03-11 22:30:54,901 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18
[2024-03-11 22:30:55,113 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:30:55,113 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 68
[2024-03-11 22:30:55,295 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:30:55,372 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:30:55,498 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:30:55,499 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50
[2024-03-11 22:30:55,591 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:55,592 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:30:55,615 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:55,615 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:30:55,640 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:55,641 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:30:55,684 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:30:55,685 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:30:55,714 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:30:55,714 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:30:55,738 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:30:55,738 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:30:55,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:30:55,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:30:55,783 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:30:55,813 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2363 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2363) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2363 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2363) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2363 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2363) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2363 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2363) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:30:56,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:30:56,439 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797601532] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:30:56,440 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:30:56,440 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28
[2024-03-11 22:30:56,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340434782]
[2024-03-11 22:30:56,440 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:30:56,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-11 22:30:56,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:30:56,442 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-11 22:30:56,442 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=691, Unknown=17, NotChecked=54, Total=870
[2024-03-11 22:30:56,584 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:30:56,586 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 3003 transitions, 59316 flow. Second operand  has 30 states, 30 states have (on average 61.6) internal successors, (1848), 30 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:30:56,586 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:30:56,586 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:30:56,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:31:27,616 INFO  L130       PetriNetUnfolder]: 25506/42885 cut-off events.
[2024-03-11 22:31:27,617 INFO  L131       PetriNetUnfolder]: For 1157828/1157828 co-relation queries the response was YES.
[2024-03-11 22:31:28,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 436156 conditions, 42885 events. 25506/42885 cut-off events. For 1157828/1157828 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 320672 event pairs, 5805 based on Foata normal form. 40/41337 useless extension candidates. Maximal degree in co-relation 434111. Up to 39064 conditions per place. 
[2024-03-11 22:31:28,418 INFO  L137   encePairwiseOnDemand]: 187/216 looper letters, 3160 selfloop transitions, 236 changer transitions 46/3443 dead transitions.
[2024-03-11 22:31:28,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 3443 transitions, 73767 flow
[2024-03-11 22:31:28,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-11 22:31:28,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-11 22:31:28,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1328 transitions.
[2024-03-11 22:31:28,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34156378600823045
[2024-03-11 22:31:28,421 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1328 transitions.
[2024-03-11 22:31:28,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1328 transitions.
[2024-03-11 22:31:28,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:31:28,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1328 transitions.
[2024-03-11 22:31:28,423 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 73.77777777777777) internal successors, (1328), 18 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:31:28,425 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:31:28,425 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 216.0) internal successors, (4104), 19 states have internal predecessors, (4104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:31:28,425 INFO  L175             Difference]: Start difference. First operand has 350 places, 3003 transitions, 59316 flow. Second operand 18 states and 1328 transitions.
[2024-03-11 22:31:28,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 3443 transitions, 73767 flow
[2024-03-11 22:31:53,566 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 3443 transitions, 72795 flow, removed 447 selfloop flow, removed 12 redundant places.
[2024-03-11 22:31:53,620 INFO  L231             Difference]: Finished difference. Result has 361 places, 3060 transitions, 60687 flow
[2024-03-11 22:31:53,622 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=58344, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=60687, PETRI_PLACES=361, PETRI_TRANSITIONS=3060}
[2024-03-11 22:31:53,623 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 290 predicate places.
[2024-03-11 22:31:53,623 INFO  L495      AbstractCegarLoop]: Abstraction has has 361 places, 3060 transitions, 60687 flow
[2024-03-11 22:31:53,623 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 61.6) internal successors, (1848), 30 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:31:53,624 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:31:53,624 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:31:53,629 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2024-03-11 22:31:53,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2024-03-11 22:31:53,825 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:31:53,825 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:31:53,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 2060241705, now seen corresponding path program 6 times
[2024-03-11 22:31:53,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:31:53,826 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778399477]
[2024-03-11 22:31:53,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:31:53,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:31:53,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:31:54,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:31:54,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:31:54,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778399477]
[2024-03-11 22:31:54,505 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778399477] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:31:54,505 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031533788]
[2024-03-11 22:31:54,505 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-11 22:31:54,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:31:54,505 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:31:54,506 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:31:54,509 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2024-03-11 22:31:54,725 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-11 22:31:54,726 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:31:54,727 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 49 conjunts are in the unsatisfiable core
[2024-03-11 22:31:54,735 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:31:54,746 INFO  L321             Elim1Store]: treesize reduction 15, result has 6.3 percent of original size
[2024-03-11 22:31:54,746 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43
[2024-03-11 22:31:55,114 INFO  L321             Elim1Store]: treesize reduction 32, result has 31.9 percent of original size
[2024-03-11 22:31:55,115 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56
[2024-03-11 22:31:55,126 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:31:55,180 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:31:55,238 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:31:55,282 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:31:55,345 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-11 22:31:55,399 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:31:55,413 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:31:55,443 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:31:55,443 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:31:55,508 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:31:55,509 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:31:55,585 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:31:55,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:31:55,672 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:31:55,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:31:55,685 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:31:55,715 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2503 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2503 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2503 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2503 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:31:55,764 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-11 22:31:56,274 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) .cse2))))) is different from false
[2024-03-11 22:31:56,319 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) .cse3 v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) .cse3 v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) .cse3 v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2503 (Array Int Int)) (v_ArrVal_2502 (Array Int Int)) (v_ArrVal_2496 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2496))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2502) .cse3 v_ArrVal_2503) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false
[2024-03-11 22:31:56,579 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:31:56,580 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 59
[2024-03-11 22:31:56,587 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:31:56,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 154
[2024-03-11 22:31:56,593 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126
[2024-03-11 22:31:56,597 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118
[2024-03-11 22:31:56,607 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62
[2024-03-11 22:31:56,655 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:31:56,656 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 1
[2024-03-11 22:31:56,665 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:31:56,665 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 1
[2024-03-11 22:31:56,675 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:31:56,675 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 1
[2024-03-11 22:31:56,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:31:56,938 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031533788] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:31:56,939 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:31:56,939 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 34
[2024-03-11 22:31:56,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18537841]
[2024-03-11 22:31:56,939 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:31:56,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-11 22:31:56,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:31:56,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-11 22:31:56,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=831, Unknown=43, NotChecked=252, Total=1260
[2024-03-11 22:31:57,068 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:31:57,070 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 3060 transitions, 60687 flow. Second operand  has 36 states, 36 states have (on average 61.416666666666664) internal successors, (2211), 36 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:31:57,070 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:31:57,070 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:31:57,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:32:02,382 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-11 22:32:07,310 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-11 22:32:33,379 INFO  L130       PetriNetUnfolder]: 25508/42938 cut-off events.
[2024-03-11 22:32:33,380 INFO  L131       PetriNetUnfolder]: For 1201787/1201787 co-relation queries the response was YES.
[2024-03-11 22:32:33,989 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 440547 conditions, 42938 events. 25508/42938 cut-off events. For 1201787/1201787 co-relation queries the response was YES. Maximal size of possible extension queue 1014. Compared 321343 event pairs, 5805 based on Foata normal form. 10/41360 useless extension candidates. Maximal degree in co-relation 439242. Up to 39072 conditions per place. 
[2024-03-11 22:32:34,225 INFO  L137   encePairwiseOnDemand]: 178/216 looper letters, 3150 selfloop transitions, 297 changer transitions 48/3496 dead transitions.
[2024-03-11 22:32:34,226 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 3496 transitions, 75141 flow
[2024-03-11 22:32:34,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-11 22:32:34,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-11 22:32:34,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1594 transitions.
[2024-03-11 22:32:34,229 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3354377104377104
[2024-03-11 22:32:34,229 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1594 transitions.
[2024-03-11 22:32:34,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1594 transitions.
[2024-03-11 22:32:34,230 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:32:34,230 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1594 transitions.
[2024-03-11 22:32:34,231 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 72.45454545454545) internal successors, (1594), 22 states have internal predecessors, (1594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:32:34,233 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 216.0) internal successors, (4968), 23 states have internal predecessors, (4968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:32:34,234 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 216.0) internal successors, (4968), 23 states have internal predecessors, (4968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:32:34,234 INFO  L175             Difference]: Start difference. First operand has 361 places, 3060 transitions, 60687 flow. Second operand 22 states and 1594 transitions.
[2024-03-11 22:32:34,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 3496 transitions, 75141 flow
[2024-03-11 22:33:00,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 3496 transitions, 74765 flow, removed 160 selfloop flow, removed 10 redundant places.
[2024-03-11 22:33:00,368 INFO  L231             Difference]: Finished difference. Result has 378 places, 3114 transitions, 62315 flow
[2024-03-11 22:33:00,371 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=60319, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=238, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=62315, PETRI_PLACES=378, PETRI_TRANSITIONS=3114}
[2024-03-11 22:33:00,371 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 307 predicate places.
[2024-03-11 22:33:00,371 INFO  L495      AbstractCegarLoop]: Abstraction has has 378 places, 3114 transitions, 62315 flow
[2024-03-11 22:33:00,372 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 61.416666666666664) internal successors, (2211), 36 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:33:00,372 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:33:00,372 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:33:00,379 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0
[2024-03-11 22:33:00,573 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2024-03-11 22:33:00,574 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:33:00,575 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:33:00,575 INFO  L85        PathProgramCache]: Analyzing trace with hash -1247438649, now seen corresponding path program 7 times
[2024-03-11 22:33:00,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:33:00,576 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681027503]
[2024-03-11 22:33:00,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:33:00,577 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:33:00,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:33:01,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:33:01,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:33:01,238 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681027503]
[2024-03-11 22:33:01,238 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681027503] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:33:01,238 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369344319]
[2024-03-11 22:33:01,238 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-11 22:33:01,238 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:33:01,239 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:33:01,240 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:33:01,242 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2024-03-11 22:33:01,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:33:01,418 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-03-11 22:33:01,423 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:33:01,442 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:01,445 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:01,448 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:33:01,864 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:33:01,864 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:33:02,039 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:33:02,040 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:33:02,132 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:33:02,200 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:33:02,305 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:33:02,306 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:33:02,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:02,374 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-11 22:33:02,396 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:33:02,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:33:02,472 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:33:02,472 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:33:02,565 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:02,565 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:33:02,593 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:02,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:33:02,625 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:33:02,626 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:33:02,667 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:33:02,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:33:02,678 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:33:02,825 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-11 22:33:03,073 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_2641 (Array Int Int)) (v_ArrVal_2640 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2640) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2641) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-11 22:33:03,575 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:33:03,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 59
[2024-03-11 22:33:03,582 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:33:03,582 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 154
[2024-03-11 22:33:03,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 126
[2024-03-11 22:33:03,593 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66
[2024-03-11 22:33:03,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114
[2024-03-11 22:33:03,639 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:33:03,639 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 1
[2024-03-11 22:33:03,645 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:33:03,645 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 1
[2024-03-11 22:33:03,652 INFO  L321             Elim1Store]: treesize reduction 18, result has 5.3 percent of original size
[2024-03-11 22:33:03,652 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 1
[2024-03-11 22:33:03,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:33:03,948 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [369344319] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:33:03,948 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:33:03,948 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 14] total 34
[2024-03-11 22:33:03,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109438108]
[2024-03-11 22:33:03,949 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:33:03,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-11 22:33:03,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:33:03,949 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-11 22:33:03,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=939, Unknown=54, NotChecked=130, Total=1260
[2024-03-11 22:33:04,764 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 216
[2024-03-11 22:33:04,765 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 3114 transitions, 62315 flow. Second operand  has 36 states, 36 states have (on average 61.416666666666664) internal successors, (2211), 36 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:33:04,765 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:33:04,765 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 216
[2024-03-11 22:33:04,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:33:50,110 INFO  L130       PetriNetUnfolder]: 27758/46455 cut-off events.
[2024-03-11 22:33:50,110 INFO  L131       PetriNetUnfolder]: For 1340230/1340230 co-relation queries the response was YES.
[2024-03-11 22:33:50,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 482651 conditions, 46455 events. 27758/46455 cut-off events. For 1340230/1340230 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 349771 event pairs, 5798 based on Foata normal form. 78/44945 useless extension candidates. Maximal degree in co-relation 481379. Up to 37187 conditions per place. 
[2024-03-11 22:33:51,165 INFO  L137   encePairwiseOnDemand]: 184/216 looper letters, 3824 selfloop transitions, 1022 changer transitions 8/4855 dead transitions.
[2024-03-11 22:33:51,165 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 4855 transitions, 103900 flow
[2024-03-11 22:33:51,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-11 22:33:51,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-11 22:33:51,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2990 transitions.
[2024-03-11 22:33:51,169 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3460648148148148
[2024-03-11 22:33:51,169 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2990 transitions.
[2024-03-11 22:33:51,169 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2990 transitions.
[2024-03-11 22:33:51,169 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:33:51,170 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2990 transitions.
[2024-03-11 22:33:51,172 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 74.75) internal successors, (2990), 40 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:33:51,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:33:51,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:33:51,177 INFO  L175             Difference]: Start difference. First operand has 378 places, 3114 transitions, 62315 flow. Second operand 40 states and 2990 transitions.
[2024-03-11 22:33:51,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 4855 transitions, 103900 flow
[2024-03-11 22:34:21,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 4855 transitions, 103210 flow, removed 225 selfloop flow, removed 16 redundant places.
[2024-03-11 22:34:21,534 INFO  L231             Difference]: Finished difference. Result has 428 places, 3654 transitions, 77818 flow
[2024-03-11 22:34:21,535 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=61731, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=533, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=77818, PETRI_PLACES=428, PETRI_TRANSITIONS=3654}
[2024-03-11 22:34:21,536 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 357 predicate places.
[2024-03-11 22:34:21,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 428 places, 3654 transitions, 77818 flow
[2024-03-11 22:34:21,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 36 states, 36 states have (on average 61.416666666666664) internal successors, (2211), 36 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:34:21,536 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:34:21,536 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:34:21,563 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0
[2024-03-11 22:34:21,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2024-03-11 22:34:21,738 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:34:21,738 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:34:21,738 INFO  L85        PathProgramCache]: Analyzing trace with hash 397695499, now seen corresponding path program 1 times
[2024-03-11 22:34:21,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:34:21,739 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019890200]
[2024-03-11 22:34:21,739 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:34:21,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:34:21,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:34:22,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:34:22,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:34:22,200 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019890200]
[2024-03-11 22:34:22,200 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019890200] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:34:22,200 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640290075]
[2024-03-11 22:34:22,200 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:34:22,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:34:22,201 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:34:22,202 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:34:22,204 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2024-03-11 22:34:22,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:34:22,365 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-03-11 22:34:22,371 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:34:22,386 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:34:22,389 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:34:22,391 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:34:22,806 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:34:22,807 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 62
[2024-03-11 22:34:22,917 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:34:22,918 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 57
[2024-03-11 22:34:23,059 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:34:23,059 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:34:23,092 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-11 22:34:23,101 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-11 22:34:23,109 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-11 22:34:23,121 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:34:23,122 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-11 22:34:23,136 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:34:23,137 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-11 22:34:23,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:34:23,148 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:34:23,229 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:34:23,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27
[2024-03-11 22:34:23,232 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2024-03-11 22:34:23,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:34:23,497 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [640290075] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:34:23,497 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:34:23,497 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 22
[2024-03-11 22:34:23,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476450360]
[2024-03-11 22:34:23,497 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:34:23,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-11 22:34:23,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:34:23,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-11 22:34:23,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=461, Unknown=12, NotChecked=0, Total=552
[2024-03-11 22:34:26,732 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 56 out of 216
[2024-03-11 22:34:26,733 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 3654 transitions, 77818 flow. Second operand  has 24 states, 24 states have (on average 58.833333333333336) internal successors, (1412), 24 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:34:26,734 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:34:26,734 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 216
[2024-03-11 22:34:26,734 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:35:19,162 INFO  L130       PetriNetUnfolder]: 34545/57426 cut-off events.
[2024-03-11 22:35:19,162 INFO  L131       PetriNetUnfolder]: For 1948591/1948591 co-relation queries the response was YES.
[2024-03-11 22:35:20,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 630350 conditions, 57426 events. 34545/57426 cut-off events. For 1948591/1948591 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 448005 event pairs, 5625 based on Foata normal form. 220/55470 useless extension candidates. Maximal degree in co-relation 628758. Up to 33446 conditions per place. 
[2024-03-11 22:35:20,675 INFO  L137   encePairwiseOnDemand]: 191/216 looper letters, 4554 selfloop transitions, 1233 changer transitions 178/5966 dead transitions.
[2024-03-11 22:35:20,675 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 5966 transitions, 137998 flow
[2024-03-11 22:35:20,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-11 22:35:20,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-11 22:35:20,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2759 transitions.
[2024-03-11 22:35:20,678 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3193287037037037
[2024-03-11 22:35:20,678 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 2759 transitions.
[2024-03-11 22:35:20,678 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 2759 transitions.
[2024-03-11 22:35:20,679 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:35:20,679 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 2759 transitions.
[2024-03-11 22:35:20,681 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 68.975) internal successors, (2759), 40 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:35:20,686 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:35:20,686 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 216.0) internal successors, (8856), 41 states have internal predecessors, (8856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:35:20,686 INFO  L175             Difference]: Start difference. First operand has 428 places, 3654 transitions, 77818 flow. Second operand 40 states and 2759 transitions.
[2024-03-11 22:35:20,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 5966 transitions, 137998 flow
[2024-03-11 22:36:20,251 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 5966 transitions, 135124 flow, removed 1431 selfloop flow, removed 4 redundant places.
[2024-03-11 22:36:20,335 INFO  L231             Difference]: Finished difference. Result has 486 places, 4202 transitions, 92179 flow
[2024-03-11 22:36:20,337 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=75611, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=659, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2882, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=92179, PETRI_PLACES=486, PETRI_TRANSITIONS=4202}
[2024-03-11 22:36:20,338 INFO  L288   CegarLoopForPetriNet]: 71 programPoint places, 415 predicate places.
[2024-03-11 22:36:20,338 INFO  L495      AbstractCegarLoop]: Abstraction has has 486 places, 4202 transitions, 92179 flow
[2024-03-11 22:36:20,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 58.833333333333336) internal successors, (1412), 24 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:36:20,338 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 22:36:20,338 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 22:36:20,345 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0
[2024-03-11 22:36:20,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:36:20,539 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-11 22:36:20,540 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 22:36:20,540 INFO  L85        PathProgramCache]: Analyzing trace with hash -285841265, now seen corresponding path program 8 times
[2024-03-11 22:36:20,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 22:36:20,540 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031758569]
[2024-03-11 22:36:20,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 22:36:20,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 22:36:20,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 22:36:21,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:36:21,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 22:36:21,094 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031758569]
[2024-03-11 22:36:21,094 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031758569] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 22:36:21,094 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973564493]
[2024-03-11 22:36:21,094 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 22:36:21,094 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 22:36:21,094 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 22:36:21,095 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-11 22:36:21,096 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2024-03-11 22:36:21,355 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-11 22:36:21,355 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 22:36:21,357 INFO  L263         TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 61 conjunts are in the unsatisfiable core
[2024-03-11 22:36:21,362 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 22:36:21,400 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:21,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:21,404 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16
[2024-03-11 22:36:21,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-11 22:36:21,986 INFO  L321             Elim1Store]: treesize reduction 36, result has 23.4 percent of original size
[2024-03-11 22:36:21,986 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 62
[2024-03-11 22:36:22,277 INFO  L321             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-11 22:36:22,277 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 40
[2024-03-11 22:36:22,400 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-11 22:36:22,471 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,472 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-11 22:36:22,547 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,548 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,549 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-11 22:36:22,626 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,628 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,629 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,630 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-11 22:36:22,706 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 22:36:22,707 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:36:22,794 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-11 22:36:22,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:36:22,858 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 22:36:22,886 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2912 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2912 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2912 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2912 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-11 22:36:22,931 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-11 22:36:22,956 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2911 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2911) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2912) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-11 22:36:23,433 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:36:23,434 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2024-03-11 22:36:23,440 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 22:36:23,440 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 130
[2024-03-11 22:36:23,444 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 86
[2024-03-11 22:36:23,449 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39
[2024-03-11 22:36:23,469 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:36:23,469 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2024-03-11 22:36:23,475 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:36:23,476 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-03-11 22:36:23,480 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-11 22:36:23,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-03-11 22:36:23,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 22:36:23,954 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973564493] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 22:36:23,954 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 22:36:23,954 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 38
[2024-03-11 22:36:23,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726756203]
[2024-03-11 22:36:23,954 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 22:36:23,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-03-11 22:36:23,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 22:36:23,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-03-11 22:36:23,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1143, Unknown=29, NotChecked=216, Total=1560
[2024-03-11 22:36:24,532 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 216
[2024-03-11 22:36:24,533 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 4202 transitions, 92179 flow. Second operand  has 40 states, 40 states have (on average 47.275) internal successors, (1891), 40 states have internal predecessors, (1891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:36:24,533 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 22:36:24,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 216
[2024-03-11 22:36:24,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 22:37:45,372 INFO  L130       PetriNetUnfolder]: 43232/71243 cut-off events.
[2024-03-11 22:37:45,372 INFO  L131       PetriNetUnfolder]: For 2581504/2581504 co-relation queries the response was YES.
[2024-03-11 22:37:47,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 809489 conditions, 71243 events. 43232/71243 cut-off events. For 2581504/2581504 co-relation queries the response was YES. Maximal size of possible extension queue 1914. Compared 573406 event pairs, 7571 based on Foata normal form. 313/68574 useless extension candidates. Maximal degree in co-relation 809304. Up to 34439 conditions per place. 
[2024-03-11 22:37:47,863 INFO  L137   encePairwiseOnDemand]: 175/216 looper letters, 5721 selfloop transitions, 1401 changer transitions 84/7207 dead transitions.
[2024-03-11 22:37:47,863 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 7207 transitions, 165447 flow
[2024-03-11 22:37:47,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2024-03-11 22:37:47,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2024-03-11 22:37:47,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2585 transitions.
[2024-03-11 22:37:47,868 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.2783161068044789
[2024-03-11 22:37:47,868 INFO  L72            ComplementDD]: Start complementDD. Operand 43 states and 2585 transitions.
[2024-03-11 22:37:47,868 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 43 states and 2585 transitions.
[2024-03-11 22:37:47,870 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 22:37:47,870 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2585 transitions.
[2024-03-11 22:37:47,881 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 44 states, 43 states have (on average 60.116279069767444) internal successors, (2585), 43 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:37:47,889 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 44 states, 44 states have (on average 216.0) internal successors, (9504), 44 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:37:47,889 INFO  L81            ComplementDD]: Finished complementDD. Result  has 44 states, 44 states have (on average 216.0) internal successors, (9504), 44 states have internal predecessors, (9504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-11 22:37:47,890 INFO  L175             Difference]: Start difference. First operand has 486 places, 4202 transitions, 92179 flow. Second operand 43 states and 2585 transitions.
[2024-03-11 22:37:47,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 7207 transitions, 165447 flow
Killed by 15
