./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i --full-output --preprocessor.use.memory.slicer true --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:44:33,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:44:33,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 19:44:33,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:44:33,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:44:33,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:44:33,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:44:33,119 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:44:33,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:44:33,123 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:44:33,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:44:33,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:44:33,124 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:44:33,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:44:33,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:44:33,126 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:44:33,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:44:33,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:44:33,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:44:33,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:44:33,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:44:33,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:44:33,127 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 19:44:33,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:44:33,128 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:44:33,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:44:33,128 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:44:33,128 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:44:33,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:44:33,129 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 19:44:33,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:44:33,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:33,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:44:33,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:44:33,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:44:33,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:44:33,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:44:33,131 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:44:33,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> GemCutter 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 -> 0026ab1092a8a0465a20b39c2dea92fa9c4dc52098c477016ebc8544f5aaf0f0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 19:44:33,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:44:33,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:44:33,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:44:33,344 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:44:33,345 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:44:33,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-21 19:44:34,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:44:34,597 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:44:34,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-21 19:44:34,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b0a7fd668/fd1d2c8ac2e54e948cbba5fdf26c989b/FLAG6e3f3eaee [2023-11-21 19:44:34,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b0a7fd668/fd1d2c8ac2e54e948cbba5fdf26c989b [2023-11-21 19:44:34,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:44:34,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:44:34,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:34,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:44:34,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:44:34,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:34" (1/1) ... [2023-11-21 19:44:34,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5203d252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:34, skipping insertion in model container [2023-11-21 19:44:34,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:44:34" (1/1) ... [2023-11-21 19:44:34,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:44:34,846 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:44:35,002 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:35,015 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:44:35,024 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:44:35,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:44:35,070 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:44:35,076 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:44:35,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35 WrapperNode [2023-11-21 19:44:35,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:44:35,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:35,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:44:35,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:44:35,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,098 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,122 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-21 19:44:35,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:44:35,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:44:35,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:44:35,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:44:35,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,145 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,155 INFO L193 HeapSplitter]: Split 10 memory accesses to 4 slices as follows [1, 2, 4, 3] [2023-11-21 19:44:35,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:44:35,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:44:35,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:44:35,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:44:35,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (1/1) ... [2023-11-21 19:44:35,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:44:35,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:35,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 19:44:35,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:44:35,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 19:44:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 19:44:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 19:44:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:44:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:44:35,281 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 19:44:35,383 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:44:35,385 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:44:35,590 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:44:35,598 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:44:35,605 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:44:35,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:35 BoogieIcfgContainer [2023-11-21 19:44:35,607 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:44:35,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:44:35,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:44:35,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:44:35,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:44:34" (1/3) ... [2023-11-21 19:44:35,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc7f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:35, skipping insertion in model container [2023-11-21 19:44:35,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:44:35" (2/3) ... [2023-11-21 19:44:35,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efc7f0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:44:35, skipping insertion in model container [2023-11-21 19:44:35,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:44:35" (3/3) ... [2023-11-21 19:44:35,615 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2023-11-21 19:44:35,622 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:44:35,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:44:35,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 19:44:35,632 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:44:35,679 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 19:44:35,735 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:44:35,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:44:35,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:35,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:44:35,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-21 19:44:35,801 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:44:35,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 19:44:35,818 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@351c3697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:44:35,818 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:44:36,088 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:36,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash -983011726, now seen corresponding path program 1 times [2023-11-21 19:44:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:36,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110130041] [2023-11-21 19:44:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110130041] [2023-11-21 19:44:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110130041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:36,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:44:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650902052] [2023-11-21 19:44:36,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:36,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:44:36,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:36,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:44:36,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:44:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:36,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:36,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2023-11-21 19:44:36,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:36,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:36,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:44:36,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:36,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-21 19:44:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:36,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425687760] [2023-11-21 19:44:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:36,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:37,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:37,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425687760] [2023-11-21 19:44:37,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425687760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:44:37,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:44:37,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:44:37,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647856532] [2023-11-21 19:44:37,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:44:37,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:44:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:44:37,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:44:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:37,015 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:37,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2023-11-21 19:44:37,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:37,016 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:37,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:37,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:44:37,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:37,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:37,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1434386381, now seen corresponding path program 1 times [2023-11-21 19:44:37,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:37,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181358671] [2023-11-21 19:44:37,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:37,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:37,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181358671] [2023-11-21 19:44:37,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181358671] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:37,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732534924] [2023-11-21 19:44:37,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:37,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:37,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:37,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 19:44:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:37,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-21 19:44:37,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:37,939 INFO L378 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 [2023-11-21 19:44:38,017 INFO L378 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 [2023-11-21 19:44:38,041 INFO L378 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 [2023-11-21 19:44:38,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:38,090 INFO L378 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 [2023-11-21 19:44:38,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:38,129 INFO L378 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 [2023-11-21 19:44:38,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:38,250 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:38,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:38,279 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:44:38,359 WARN L854 $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_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:38,373 WARN L854 $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_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:40,486 INFO L378 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 [2023-11-21 19:44:40,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 19:44:40,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732534924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:40,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:40,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 19:44:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387432001] [2023-11-21 19:44:40,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:40,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:44:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:40,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:44:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=821, Unknown=3, NotChecked=180, Total=1122 [2023-11-21 19:44:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:40,526 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:40,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 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) [2023-11-21 19:44:40,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:40,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:40,526 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:44:41,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-21 19:44:41,304 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:41,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -624750547, now seen corresponding path program 2 times [2023-11-21 19:44:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964755340] [2023-11-21 19:44:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:42,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:42,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964755340] [2023-11-21 19:44:42,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964755340] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:42,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953112550] [2023-11-21 19:44:42,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:44:42,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:42,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:42,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:42,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 19:44:42,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:44:42,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:42,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 19:44:42,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:42,190 INFO L378 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 [2023-11-21 19:44:42,303 INFO L378 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 [2023-11-21 19:44:42,329 INFO L378 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 [2023-11-21 19:44:42,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:42,360 INFO L378 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 [2023-11-21 19:44:42,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:42,403 INFO L378 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 [2023-11-21 19:44:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:42,564 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:42,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:42,591 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:42,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:42,606 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:42,623 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:42,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:42,692 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:42,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:43,011 WARN L854 $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_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:43,025 WARN L854 $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_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:43,234 INFO L378 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 27 treesize of output 15 [2023-11-21 19:44:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953112550] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:43,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-21 19:44:43,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755330064] [2023-11-21 19:44:43,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:43,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 19:44:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 19:44:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1103, Unknown=23, NotChecked=138, Total=1406 [2023-11-21 19:44:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:43,326 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:43,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 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) [2023-11-21 19:44:43,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:43,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:43,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:44:43,327 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:44:44,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:44,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:44,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:44,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:44,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:44,578 INFO L85 PathProgramCache]: Analyzing trace with hash -862869011, now seen corresponding path program 1 times [2023-11-21 19:44:44,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:44,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759034412] [2023-11-21 19:44:44,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:44,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:45,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759034412] [2023-11-21 19:44:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759034412] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:45,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873584373] [2023-11-21 19:44:45,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:45,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:45,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:45,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:45,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 19:44:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:45,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-21 19:44:45,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:45,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:44:45,455 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:44:45,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:44:45,470 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:44:45,470 INFO L378 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 23 treesize of output 23 [2023-11-21 19:44:45,531 INFO L378 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 38 treesize of output 22 [2023-11-21 19:44:45,664 INFO L378 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 [2023-11-21 19:44:45,699 INFO L378 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 [2023-11-21 19:44:45,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:45,734 INFO L378 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 [2023-11-21 19:44:45,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:45,781 INFO L378 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 [2023-11-21 19:44:45,942 INFO L378 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 16 treesize of output 8 [2023-11-21 19:44:45,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:45,983 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:45,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:45,997 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:46,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:46,012 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:46,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:46,029 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:46,058 INFO L378 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 43 treesize of output 32 [2023-11-21 19:44:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:46,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:46,078 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_427 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:44:46,103 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:44:46,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse0 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse0 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse0 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse0 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:44:46,264 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 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) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:46,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 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|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_426) .cse1 v_ArrVal_427) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:46,390 INFO L378 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 30 treesize of output 18 [2023-11-21 19:44:46,512 INFO L378 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 30 [2023-11-21 19:44:46,550 INFO L378 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 10 treesize of output 8 [2023-11-21 19:44:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:44:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873584373] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:46,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:46,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 38 [2023-11-21 19:44:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622393723] [2023-11-21 19:44:46,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:46,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-21 19:44:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:46,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-21 19:44:46,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1002, Unknown=5, NotChecked=340, Total=1482 [2023-11-21 19:44:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:46,576 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:46,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 39 states have internal predecessors, (147), 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) [2023-11-21 19:44:46,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:46,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:46,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:44:46,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:46,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:48,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:44:48,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 19:44:48,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:48,913 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:44:48,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:44:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash -609284871, now seen corresponding path program 2 times [2023-11-21 19:44:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:44:48,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236062790] [2023-11-21 19:44:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:44:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:44:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:44:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:49,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:44:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236062790] [2023-11-21 19:44:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236062790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:44:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793161366] [2023-11-21 19:44:49,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:44:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:44:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:44:49,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:44:49,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 19:44:49,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:44:49,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:44:49,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-21 19:44:49,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:44:49,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:44:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:49,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 [2023-11-21 19:44:49,942 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:44:49,942 INFO L378 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 15 treesize of output 15 [2023-11-21 19:44:50,203 INFO L378 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 38 treesize of output 22 [2023-11-21 19:44:50,226 INFO L378 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 7 treesize of output 3 [2023-11-21 19:44:50,622 INFO L378 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 [2023-11-21 19:44:50,693 INFO L378 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 19 treesize of output 18 [2023-11-21 19:44:50,759 INFO L378 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 26 treesize of output 28 [2023-11-21 19:44:51,063 INFO L378 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 [2023-11-21 19:44:51,071 INFO L378 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 25 treesize of output 13 [2023-11-21 19:44:51,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:51,127 INFO L378 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 30 treesize of output 21 [2023-11-21 19:44:51,148 INFO L378 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 33 treesize of output 38 [2023-11-21 19:44:51,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:51,209 INFO L378 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 37 treesize of output 26 [2023-11-21 19:44:51,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:51,235 INFO L378 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 37 treesize of output 26 [2023-11-21 19:44:51,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:44:51,276 INFO L378 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 37 treesize of output 26 [2023-11-21 19:44:51,359 INFO L378 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 44 treesize of output 52 [2023-11-21 19:44:51,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:44:51,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:44:51,595 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:44:51,638 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:44:51,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:44:51,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:44:53,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (< .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (< .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))))) is different from false [2023-11-21 19:44:56,215 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 19:44:58,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~t~0.offset 1)) (.cse8 (+ 2 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_547 (Array Int Int)) (v_ArrVal_542 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_542) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_547))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 19:44:58,308 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:44:58,309 INFO L378 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 4 case distinctions, treesize of input 1150 treesize of output 960 [2023-11-21 19:44:58,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:44:58,327 INFO L378 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 408 treesize of output 374 [2023-11-21 19:44:58,337 INFO L378 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 120 treesize of output 116 [2023-11-21 19:44:58,344 INFO L378 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 249 treesize of output 233 [2023-11-21 19:44:58,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:58,497 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 19:44:58,497 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 658 treesize of output 489 [2023-11-21 19:44:58,510 INFO L378 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 80 treesize of output 78 [2023-11-21 19:44:58,514 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:58,516 INFO L378 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 184 treesize of output 158 [2023-11-21 19:44:58,539 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:58,548 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:44:58,548 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 690 treesize of output 1 [2023-11-21 19:44:58,553 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:44:58,559 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:44:58,559 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 442 treesize of output 1 [2023-11-21 19:44:58,887 INFO L378 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 34 [2023-11-21 19:44:58,889 INFO L378 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 38 treesize of output 26 [2023-11-21 19:44:59,082 INFO L378 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 49 treesize of output 37 [2023-11-21 19:44:59,085 INFO L378 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 40 treesize of output 32 [2023-11-21 19:44:59,135 INFO L378 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 10 treesize of output 8 [2023-11-21 19:44:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:44:59,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793161366] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:44:59,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:44:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 20] total 55 [2023-11-21 19:44:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327430722] [2023-11-21 19:44:59,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:44:59,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-21 19:44:59,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:44:59,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-21 19:44:59,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2155, Unknown=7, NotChecked=700, Total=3080 [2023-11-21 19:44:59,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:59,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:44:59,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 3.290909090909091) internal successors, (181), 56 states have internal predecessors, (181), 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) [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:44:59,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:04,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-21 19:45:04,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:04,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-21 19:45:04,578 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:04,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1568712949, now seen corresponding path program 3 times [2023-11-21 19:45:04,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273323152] [2023-11-21 19:45:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273323152] [2023-11-21 19:45:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273323152] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474629347] [2023-11-21 19:45:05,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:45:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:05,235 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:05,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 19:45:05,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 19:45:05,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:45:05,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-21 19:45:05,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:05,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:45:05,406 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:45:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:45:05,451 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:45:05,452 INFO L378 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 23 treesize of output 23 [2023-11-21 19:45:05,515 INFO L378 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 38 treesize of output 22 [2023-11-21 19:45:05,631 INFO L378 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 [2023-11-21 19:45:05,658 INFO L378 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 [2023-11-21 19:45:05,783 INFO L378 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 16 treesize of output 8 [2023-11-21 19:45:05,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:05,824 INFO L378 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 25 treesize of output 18 [2023-11-21 19:45:05,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:05,837 INFO L378 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 [2023-11-21 19:45:05,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:05,880 INFO L378 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 [2023-11-21 19:45:05,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:05,947 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:05,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:05,960 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:05,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:05,976 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:06,009 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:06,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:06,103 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:45:06,216 WARN L854 $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_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 19:45:06,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (+ 2 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:45:06,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) .cse2 v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) .cse2 v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) .cse2 v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) c_threadThread1of1ForFork0_~t~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_668) .cse2 v_ArrVal_669) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:45:06,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:06,437 INFO L378 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 186 treesize of output 178 [2023-11-21 19:45:06,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:06,444 INFO L378 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 119 treesize of output 83 [2023-11-21 19:45:06,447 INFO L378 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 21 treesize of output 17 [2023-11-21 19:45:06,466 INFO L378 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 24 [2023-11-21 19:45:06,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,476 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-21 19:45:06,476 INFO L378 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 23 treesize of output 1 [2023-11-21 19:45:06,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:06,551 INFO L378 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 30 treesize of output 18 [2023-11-21 19:45:06,650 INFO L378 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 30 [2023-11-21 19:45:06,684 INFO L378 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 10 treesize of output 8 [2023-11-21 19:45:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 19:45:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474629347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:06,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 40 [2023-11-21 19:45:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887512567] [2023-11-21 19:45:06,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-21 19:45:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-21 19:45:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1158, Unknown=50, NotChecked=292, Total=1640 [2023-11-21 19:45:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:06,708 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:06,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.7) internal successors, (148), 41 states have internal predecessors, (148), 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) [2023-11-21 19:45:06,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2023-11-21 19:45:06,709 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:45:09,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:09,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:45:09,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:09,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:09,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:09,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 195065691, now seen corresponding path program 4 times [2023-11-21 19:45:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101164662] [2023-11-21 19:45:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:09,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101164662] [2023-11-21 19:45:09,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101164662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:09,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764420750] [2023-11-21 19:45:09,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:45:09,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:09,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:09,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:09,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 19:45:10,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:45:10,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:45:10,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:45:10,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:10,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:45:10,089 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:45:10,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:45:10,145 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:45:10,145 INFO L378 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 23 treesize of output 23 [2023-11-21 19:45:10,274 INFO L378 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 38 treesize of output 22 [2023-11-21 19:45:10,278 INFO L378 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 7 treesize of output 3 [2023-11-21 19:45:10,502 INFO L378 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 [2023-11-21 19:45:10,615 INFO L378 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 16 treesize of output 8 [2023-11-21 19:45:10,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:10,644 INFO L378 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 16 treesize of output 11 [2023-11-21 19:45:10,654 INFO L378 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 19 treesize of output 18 [2023-11-21 19:45:10,688 INFO L378 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 26 treesize of output 28 [2023-11-21 19:45:10,731 INFO L378 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 33 treesize of output 38 [2023-11-21 19:45:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:10,780 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:10,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:10,794 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:10,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:10,808 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:10,862 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:10,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:10,908 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:45:11,119 WARN L854 $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_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_791 (Array Int Int)) (v_ArrVal_790 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_790) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_791) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:11,281 INFO L378 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 8 treesize of output 4 [2023-11-21 19:45:11,283 INFO L378 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 30 treesize of output 18 [2023-11-21 19:45:11,382 INFO L378 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 30 [2023-11-21 19:45:11,433 INFO L378 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 10 treesize of output 8 [2023-11-21 19:45:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764420750] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:11,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 43 [2023-11-21 19:45:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575540158] [2023-11-21 19:45:11,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:11,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-21 19:45:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:11,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-21 19:45:11,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1511, Unknown=54, NotChecked=162, Total=1892 [2023-11-21 19:45:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:11,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:11,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.2790697674418605) internal successors, (141), 44 states have internal predecessors, (141), 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) [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 19:45:11,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:45:15,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-21 19:45:15,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-21 19:45:15,405 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:15,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash 767573289, now seen corresponding path program 5 times [2023-11-21 19:45:15,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:15,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275651017] [2023-11-21 19:45:15,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:15,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275651017] [2023-11-21 19:45:15,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275651017] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:15,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100920448] [2023-11-21 19:45:15,953 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 19:45:15,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:15,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:15,954 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:15,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 19:45:16,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:45:16,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:45:16,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-21 19:45:16,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:16,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:45:16,207 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-11-21 19:45:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 24 [2023-11-21 19:45:16,250 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:45:16,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 15 [2023-11-21 19:45:16,369 INFO L378 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 29 treesize of output 17 [2023-11-21 19:45:16,372 INFO L378 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 [2023-11-21 19:45:16,656 INFO L378 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 16 treesize of output 8 [2023-11-21 19:45:16,687 INFO L378 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 [2023-11-21 19:45:16,723 INFO L378 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 19 treesize of output 18 [2023-11-21 19:45:16,762 INFO L378 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 26 treesize of output 28 [2023-11-21 19:45:16,808 INFO L378 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 33 treesize of output 38 [2023-11-21 19:45:16,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:16,855 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:16,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:16,865 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:16,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:16,876 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:16,921 INFO L378 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 37 treesize of output 26 [2023-11-21 19:45:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:16,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:17,042 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:45:17,155 WARN L854 $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_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_911 (Array Int Int)) (v_ArrVal_910 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_910) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_911) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:17,291 INFO L378 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 30 treesize of output 18 [2023-11-21 19:45:17,292 INFO L378 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 8 treesize of output 4 [2023-11-21 19:45:17,417 INFO L378 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 30 [2023-11-21 19:45:17,456 INFO L378 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 10 treesize of output 8 [2023-11-21 19:45:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100920448] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:17,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 17] total 44 [2023-11-21 19:45:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697091396] [2023-11-21 19:45:17,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-21 19:45:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:17,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-21 19:45:17,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1591, Unknown=45, NotChecked=166, Total=1980 [2023-11-21 19:45:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:17,480 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:17,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 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) [2023-11-21 19:45:17,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:17,480 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:45:17,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-21 19:45:21,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 19:45:21,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:45:21,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 19:45:21,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:21,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:21,414 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2023-11-21 19:45:21,415 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 19:45:21,417 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:21,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:45:21,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:21,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:45:21,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-21 19:45:21,422 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:45:21,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 19:45:21,422 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@351c3697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:21,422 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 19:45:21,434 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:45:21,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash 880109907, now seen corresponding path program 1 times [2023-11-21 19:45:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:21,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311960961] [2023-11-21 19:45:21,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:21,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311960961] [2023-11-21 19:45:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311960961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:21,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:21,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:45:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221723961] [2023-11-21 19:45:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:21,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:45:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:21,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:45:21,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:45:21,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:21,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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) [2023-11-21 19:45:21,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 19:45:21,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:45:21,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 578939384, now seen corresponding path program 1 times [2023-11-21 19:45:21,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:21,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815205538] [2023-11-21 19:45:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:21,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:21,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:21,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815205538] [2023-11-21 19:45:21,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815205538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:21,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:21,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:45:21,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978228789] [2023-11-21 19:45:21,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:21,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:21,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:21,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,590 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:21,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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) [2023-11-21 19:45:21,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:21,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 19:45:21,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:45:21,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash 911664888, now seen corresponding path program 1 times [2023-11-21 19:45:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153848117] [2023-11-21 19:45:21,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:21,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:21,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153848117] [2023-11-21 19:45:21,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153848117] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:21,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:21,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:45:21,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102533571] [2023-11-21 19:45:21,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:21,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:21,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:21,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 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) [2023-11-21 19:45:21,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:21,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:21,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:21,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 19:45:21,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 19:45:21,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -767136527, now seen corresponding path program 1 times [2023-11-21 19:45:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733837801] [2023-11-21 19:45:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:45:21,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 19:45:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 19:45:21,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 19:45:21,988 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 19:45:21,988 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 19:45:21,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 19:45:21,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 19:45:21,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-21 19:45:21,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 19:45:21,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 19:45:21,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 19:45:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 19:45:21,993 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 19:45:21,993 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 19:45:21,993 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 19:45:21,993 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 19:45:22,009 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 19:45:22,015 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:22,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:45:22,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:22,016 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 19:45:22,019 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:45:22,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 19:45:22,020 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@351c3697, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:45:22,020 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:45:22,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-11-21 19:45:22,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:22,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:22,102 INFO L85 PathProgramCache]: Analyzing trace with hash -747587998, now seen corresponding path program 1 times [2023-11-21 19:45:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608370817] [2023-11-21 19:45:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:22,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:22,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608370817] [2023-11-21 19:45:22,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608370817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:22,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:22,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:45:22,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439511] [2023-11-21 19:45:22,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:22,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:45:22,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:22,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:45:22,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:45:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,122 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:22,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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) [2023-11-21 19:45:22,122 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 19:45:22,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:22,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1853933115, now seen corresponding path program 1 times [2023-11-21 19:45:22,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:22,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088475629] [2023-11-21 19:45:22,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:22,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:22,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:22,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088475629] [2023-11-21 19:45:22,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088475629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:22,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:22,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:45:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207764884] [2023-11-21 19:45:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:22,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:22,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:22,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:22,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:22,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 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) [2023-11-21 19:45:22,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:22,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 19:45:22,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:22,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1838024101, now seen corresponding path program 1 times [2023-11-21 19:45:22,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:22,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610635475] [2023-11-21 19:45:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:22,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:22,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610635475] [2023-11-21 19:45:22,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610635475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:22,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296572603] [2023-11-21 19:45:22,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:22,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:22,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:22,914 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:22,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 19:45:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:23,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-21 19:45:23,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:23,084 INFO L378 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 [2023-11-21 19:45:23,161 INFO L378 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 [2023-11-21 19:45:23,183 INFO L378 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 [2023-11-21 19:45:23,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:23,209 INFO L378 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 [2023-11-21 19:45:23,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:23,243 INFO L378 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 [2023-11-21 19:45:23,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:23,346 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:23,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:23,365 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false [2023-11-21 19:45:23,425 WARN L854 $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_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1206 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1206) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-21 19:45:27,583 INFO L378 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 [2023-11-21 19:45:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-21 19:45:27,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296572603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:27,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:27,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2023-11-21 19:45:27,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578279189] [2023-11-21 19:45:27,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:27,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:45:27,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:27,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:45:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=863, Unknown=13, NotChecked=122, Total=1122 [2023-11-21 19:45:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:27,616 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:27,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.242424242424242) internal successors, (140), 34 states have internal predecessors, (140), 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) [2023-11-21 19:45:27,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:27,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:27,617 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:28,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:28,565 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:28,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash 475542021, now seen corresponding path program 2 times [2023-11-21 19:45:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145504360] [2023-11-21 19:45:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145504360] [2023-11-21 19:45:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145504360] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292587092] [2023-11-21 19:45:29,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:45:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:29,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:29,006 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:29,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 19:45:29,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:45:29,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:45:29,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-21 19:45:29,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:29,206 INFO L378 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 [2023-11-21 19:45:29,316 INFO L378 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 [2023-11-21 19:45:29,341 INFO L378 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 [2023-11-21 19:45:29,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:29,375 INFO L378 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 [2023-11-21 19:45:29,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:29,416 INFO L378 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 [2023-11-21 19:45:29,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,547 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:29,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,562 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:29,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,577 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:29,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,592 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:29,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:29,655 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:29,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:29,676 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1325 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1325 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1325 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1325 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false [2023-11-21 19:45:29,706 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-21 19:45:29,793 WARN L854 $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_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:29,805 WARN L854 $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_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1324 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1325) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 19:45:29,985 INFO L378 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 27 treesize of output 15 [2023-11-21 19:45:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-21 19:45:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292587092] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:30,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:30,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-21 19:45:30,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365782065] [2023-11-21 19:45:30,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:30,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 19:45:30,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 19:45:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=998, Unknown=4, NotChecked=268, Total=1406 [2023-11-21 19:45:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:30,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:30,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 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) [2023-11-21 19:45:30,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:30,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:30,052 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:30,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:30,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:31,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-21 19:45:31,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:31,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 454585013, now seen corresponding path program 1 times [2023-11-21 19:45:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:31,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267391833] [2023-11-21 19:45:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-21 19:45:31,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:31,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267391833] [2023-11-21 19:45:31,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267391833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:31,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:31,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:45:31,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749213128] [2023-11-21 19:45:31,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:31,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:31,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:31,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:31,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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) [2023-11-21 19:45:31,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:31,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:31,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 19:45:31,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:31,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2042055243, now seen corresponding path program 1 times [2023-11-21 19:45:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299578866] [2023-11-21 19:45:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:31,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-21 19:45:31,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:31,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299578866] [2023-11-21 19:45:31,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299578866] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:31,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:45:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720813314] [2023-11-21 19:45:31,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:31,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:31,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:31,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:31,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,730 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:31,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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) [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,731 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:31,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 19:45:31,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:31,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1780248718, now seen corresponding path program 1 times [2023-11-21 19:45:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:31,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025185165] [2023-11-21 19:45:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:33,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025185165] [2023-11-21 19:45:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025185165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091532112] [2023-11-21 19:45:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:33,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:33,498 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:33,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 19:45:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:33,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-21 19:45:33,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:34,062 INFO L378 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 [2023-11-21 19:45:34,108 INFO L378 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 [2023-11-21 19:45:34,159 INFO L378 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 [2023-11-21 19:45:34,216 INFO L378 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 [2023-11-21 19:45:34,470 INFO L378 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 21 treesize of output 13 [2023-11-21 19:45:34,473 INFO L378 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 33 treesize of output 17 [2023-11-21 19:45:34,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,533 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,551 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,572 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,589 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,664 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,691 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,717 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:34,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:34,751 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,026 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,044 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,059 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,077 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,172 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,185 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,200 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,221 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:35,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:35,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:35,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:45:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:35,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:36,385 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:45:36,539 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:45:36,821 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse1))))) is different from false [2023-11-21 19:45:37,133 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:45:37,205 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse2))))) is different from false [2023-11-21 19:45:37,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse3 .cse2 (store (select .cse3 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:45:37,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7))))))) is different from false [2023-11-21 19:45:37,396 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= (select (select (let ((.cse8 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:45:37,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse9 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1711 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_1707 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_19 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_19 .cse0) (= (select (select (let ((.cse8 (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1707) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_19 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse9) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:45:37,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:37,465 INFO L378 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 81 treesize of output 74 [2023-11-21 19:45:37,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:37,479 INFO L378 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 5656 treesize of output 5016 [2023-11-21 19:45:37,502 INFO L378 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 638 treesize of output 622 [2023-11-21 19:45:37,512 INFO L378 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 718 treesize of output 686 [2023-11-21 19:45:37,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:37,870 INFO L378 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 72 treesize of output 52 [2023-11-21 19:45:37,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 19:45:37,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:37,901 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:37,909 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:45:37,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 302 treesize of output 264 [2023-11-21 19:45:37,918 INFO L378 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 89 treesize of output 85 [2023-11-21 19:45:37,923 INFO L378 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 193 treesize of output 185 [2023-11-21 19:45:37,929 INFO L378 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 236 treesize of output 178 [2023-11-21 19:45:37,954 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:37,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 1 [2023-11-21 19:45:37,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:37,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 83 treesize of output 76 [2023-11-21 19:45:37,969 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:37,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:37,977 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:45:37,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 302 treesize of output 264 [2023-11-21 19:45:37,985 INFO L378 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 180 treesize of output 172 [2023-11-21 19:45:37,992 INFO L378 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 98 [2023-11-21 19:45:37,997 INFO L378 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 236 treesize of output 178 [2023-11-21 19:45:38,337 INFO L378 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 [2023-11-21 19:45:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:45:38,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091532112] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:38,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2023-11-21 19:45:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889261723] [2023-11-21 19:45:38,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:38,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-21 19:45:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-21 19:45:38,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=2321, Unknown=9, NotChecked=954, Total=3540 [2023-11-21 19:45:38,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:38,438 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:38,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 4.745762711864407) internal successors, (280), 60 states have internal predecessors, (280), 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) [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:38,439 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:44,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-21 19:45:44,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:44,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:44,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash -957182658, now seen corresponding path program 1 times [2023-11-21 19:45:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197463235] [2023-11-21 19:45:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197463235] [2023-11-21 19:45:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197463235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887217645] [2023-11-21 19:45:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:45,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:45,164 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:45,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 19:45:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:45,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-21 19:45:45,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:45,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:45:45,403 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:45:45,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:45:45,440 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:45:45,440 INFO L378 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 23 treesize of output 23 [2023-11-21 19:45:45,520 INFO L378 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 38 treesize of output 22 [2023-11-21 19:45:45,703 INFO L378 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 [2023-11-21 19:45:45,739 INFO L378 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 [2023-11-21 19:45:45,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:45,785 INFO L378 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 [2023-11-21 19:45:45,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:45,840 INFO L378 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 [2023-11-21 19:45:45,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:45,966 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:45,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:45,977 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:45,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:45,992 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,005 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,076 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,105 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,117 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,140 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,284 INFO L378 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 16 treesize of output 8 [2023-11-21 19:45:46,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,326 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,337 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,350 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:46,361 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,384 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:46,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:46,609 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse0 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse0 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse0 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse0 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2023-11-21 19:45:46,984 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 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) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 19:45:46,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 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) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:45:47,011 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ 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 (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_1876 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (v_ArrVal_1884 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1876) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1884) .cse1 v_ArrVal_1885) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:45:47,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:47,024 INFO L378 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 45 treesize of output 61 [2023-11-21 19:45:47,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:47,032 INFO L378 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 3196 treesize of output 2298 [2023-11-21 19:45:47,039 INFO L378 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 55 treesize of output 47 [2023-11-21 19:45:47,043 INFO L378 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 43 [2023-11-21 19:45:47,046 INFO L378 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 50 [2023-11-21 19:45:47,065 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:47,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 19:45:47,069 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:47,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2023-11-21 19:45:47,074 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:47,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 1 [2023-11-21 19:45:47,169 INFO L378 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 38 treesize of output 22 [2023-11-21 19:45:47,301 INFO L378 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 58 treesize of output 46 [2023-11-21 19:45:47,369 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:47,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:47,372 INFO L378 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 10 treesize of output 8 [2023-11-21 19:45:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 20 not checked. [2023-11-21 19:45:47,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887217645] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:47,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:47,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 45 [2023-11-21 19:45:47,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951274008] [2023-11-21 19:45:47,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:47,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-11-21 19:45:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-11-21 19:45:47,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1508, Unknown=55, NotChecked=332, Total=2070 [2023-11-21 19:45:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:47,440 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:47,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.955555555555556) internal successors, (223), 46 states have internal predecessors, (223), 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) [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:47,441 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:49,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:45:49,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-21 19:45:49,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:49,523 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:49,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1604691580, now seen corresponding path program 1 times [2023-11-21 19:45:49,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:49,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327478901] [2023-11-21 19:45:49,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:49,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-21 19:45:49,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:49,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327478901] [2023-11-21 19:45:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327478901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:45:49,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:45:49,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 19:45:49,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750445557] [2023-11-21 19:45:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:45:49,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:45:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:45:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:45:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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) [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:45:49,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:49,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:45:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-21 19:45:49,931 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:45:49,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:45:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash -202762883, now seen corresponding path program 1 times [2023-11-21 19:45:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:45:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074489300] [2023-11-21 19:45:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:49,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:45:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:45:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074489300] [2023-11-21 19:45:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074489300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:45:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272837327] [2023-11-21 19:45:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:45:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:45:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:45:51,748 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:45:51,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-21 19:45:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:45:51,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-21 19:45:51,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:45:51,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:45:51,965 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:45:51,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:45:51,976 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:45:51,976 INFO L378 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 23 treesize of output 23 [2023-11-21 19:45:52,317 INFO L378 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 [2023-11-21 19:45:52,378 INFO L378 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 [2023-11-21 19:45:52,443 INFO L378 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 [2023-11-21 19:45:52,517 INFO L378 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 [2023-11-21 19:45:52,869 INFO L378 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 45 treesize of output 25 [2023-11-21 19:45:52,872 INFO L378 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 21 treesize of output 13 [2023-11-21 19:45:52,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:52,935 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:52,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:52,956 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:52,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:52,972 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:52,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:52,989 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,087 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,105 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,126 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,140 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,399 INFO L378 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 16 treesize of output 8 [2023-11-21 19:45:53,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,462 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,484 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,504 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,524 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,564 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,579 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,608 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,624 INFO L378 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 43 treesize of output 32 [2023-11-21 19:45:53,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:45:53,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:45:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:45:53,759 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:45:54,525 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:45:54,631 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2179))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:45:54,756 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_22 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:45:54,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))))) is different from false [2023-11-21 19:45:55,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse1 v_ArrVal_2179))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse2))))) is different from false [2023-11-21 19:45:55,316 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse2 v_ArrVal_2179))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse2 v_ArrVal_2179))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse2 v_ArrVal_2179))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse2 v_ArrVal_2179))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse3))))) is different from false [2023-11-21 19:45:55,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:45:55,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse3 v_ArrVal_2179))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))))) is different from false [2023-11-21 19:45:55,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))))) is different from false [2023-11-21 19:45:55,588 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#2.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) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse6 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0)))))) is different from false [2023-11-21 19:45:55,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse10 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= (select (select (let ((.cse5 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_22 Int) (v_ArrVal_2179 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2167 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_22 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2167) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2175) .cse4 v_ArrVal_2179))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_22 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse10))))))) is different from false [2023-11-21 19:45:55,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:55,683 INFO L378 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 97 treesize of output 90 [2023-11-21 19:45:55,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:55,700 INFO L378 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 60220 treesize of output 55612 [2023-11-21 19:45:55,806 INFO L378 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 3517 treesize of output 3453 [2023-11-21 19:45:55,840 INFO L378 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 3739 treesize of output 3611 [2023-11-21 19:45:55,911 INFO L378 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 4183 treesize of output 3927 [2023-11-21 19:45:57,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:57,958 INFO L378 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 158 treesize of output 132 [2023-11-21 19:45:57,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:45:57,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 90 [2023-11-21 19:45:57,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:57,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:58,006 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:58,012 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:45:58,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1060 [2023-11-21 19:45:58,025 INFO L378 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 188 treesize of output 184 [2023-11-21 19:45:58,032 INFO L378 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 406 treesize of output 340 [2023-11-21 19:45:58,042 INFO L378 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 180 treesize of output 172 [2023-11-21 19:45:58,048 INFO L378 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 388 treesize of output 372 [2023-11-21 19:45:58,092 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:58,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 1 [2023-11-21 19:45:58,099 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:45:58,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 1 [2023-11-21 19:45:58,504 INFO L378 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 38 treesize of output 22 [2023-11-21 19:45:58,685 INFO L378 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 58 treesize of output 46 [2023-11-21 19:45:58,786 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:58,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:45:58,788 INFO L378 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 10 treesize of output 8 [2023-11-21 19:45:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:45:58,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272837327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:45:58,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:45:58,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 68 [2023-11-21 19:45:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023322265] [2023-11-21 19:45:58,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:45:58,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-21 19:45:58,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:45:58,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-21 19:45:58,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=3052, Unknown=11, NotChecked=1342, Total=4692 [2023-11-21 19:45:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:58,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:45:58,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 4.044117647058823) internal successors, (275), 69 states have internal predecessors, (275), 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) [2023-11-21 19:45:58,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:45:58,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:45:58,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:10,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:10,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:10,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:10,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:10,787 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:10,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:10,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1692170382, now seen corresponding path program 2 times [2023-11-21 19:46:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178029134] [2023-11-21 19:46:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178029134] [2023-11-21 19:46:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178029134] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478767242] [2023-11-21 19:46:12,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:12,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:12,348 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:12,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-21 19:46:12,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:12,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:12,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 19:46:12,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:12,919 INFO L378 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 [2023-11-21 19:46:12,966 INFO L378 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 [2023-11-21 19:46:13,016 INFO L378 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 [2023-11-21 19:46:13,275 INFO L378 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 21 treesize of output 13 [2023-11-21 19:46:13,279 INFO L378 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 33 treesize of output 17 [2023-11-21 19:46:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,329 INFO L378 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 34 treesize of output 25 [2023-11-21 19:46:13,348 INFO L378 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 [2023-11-21 19:46:13,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,405 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,423 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,440 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,518 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,539 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,562 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,575 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,806 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,828 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,848 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:13,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:13,899 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,006 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:14,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,019 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:14,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,031 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:14,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,045 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:14,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:14,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:14,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:46:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:14,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:16,879 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:17,031 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false [2023-11-21 19:46:17,249 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse1))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse1))))) is different from false [2023-11-21 19:46:17,590 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))))) is different from false [2023-11-21 19:46:17,630 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-21 19:46:17,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))))) is different from false [2023-11-21 19:46:17,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse3))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse3) (= (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse3))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse3))))) is different from false [2023-11-21 19:46:17,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:46:17,942 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8))))))) is different from false [2023-11-21 19:46:17,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0))) (forall ((v_ArrVal_2390 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_24 Int) (v_ArrVal_2378 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2394 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2378) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2390) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2394))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_24 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_24 .cse0)))))) is different from false [2023-11-21 19:46:18,005 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:46:18,005 INFO L378 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 4 case distinctions, treesize of input 7684 treesize of output 6498 [2023-11-21 19:46:18,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:18,042 INFO L378 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 1186 treesize of output 1072 [2023-11-21 19:46:18,057 INFO L378 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 874 treesize of output 842 [2023-11-21 19:46:18,067 INFO L378 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 516 treesize of output 508 [2023-11-21 19:46:18,078 INFO L378 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 996 treesize of output 932 [2023-11-21 19:46:19,032 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,048 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,055 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:46:19,055 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1202 treesize of output 1 [2023-11-21 19:46:19,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,060 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,074 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 19:46:19,075 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1266 treesize of output 953 [2023-11-21 19:46:19,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 185 treesize of output 165 [2023-11-21 19:46:19,120 INFO L378 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 82 treesize of output 78 [2023-11-21 19:46:19,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:19,153 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,178 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-21 19:46:19,178 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 770 treesize of output 749 [2023-11-21 19:46:19,186 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:19,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 148 [2023-11-21 19:46:19,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:19,195 INFO L378 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 82 treesize of output 78 [2023-11-21 19:46:19,584 INFO L378 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 25 treesize of output 13 [2023-11-21 19:46:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 55 not checked. [2023-11-21 19:46:19,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478767242] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:19,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:19,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 61 [2023-11-21 19:46:19,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634018703] [2023-11-21 19:46:19,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:19,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-21 19:46:19,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:19,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-21 19:46:19,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2440, Unknown=11, NotChecked=1090, Total=3782 [2023-11-21 19:46:19,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:19,689 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:19,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 4.60655737704918) internal successors, (281), 62 states have internal predecessors, (281), 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) [2023-11-21 19:46:19,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:19,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:19,689 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:19,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:26,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:26,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:26,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:26,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 19:46:26,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:26,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 487132541, now seen corresponding path program 2 times [2023-11-21 19:46:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627820428] [2023-11-21 19:46:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627820428] [2023-11-21 19:46:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627820428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:28,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395287444] [2023-11-21 19:46:28,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:28,577 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:28,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-21 19:46:28,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:28,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:28,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-21 19:46:28,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:28,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:46:28,864 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:46:28,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:46:28,904 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:46:28,904 INFO L378 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 23 treesize of output 23 [2023-11-21 19:46:29,320 INFO L378 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 [2023-11-21 19:46:29,384 INFO L378 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 [2023-11-21 19:46:29,445 INFO L378 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 [2023-11-21 19:46:29,762 INFO L378 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 45 treesize of output 25 [2023-11-21 19:46:29,765 INFO L378 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 21 treesize of output 13 [2023-11-21 19:46:29,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:29,841 INFO L378 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 34 treesize of output 25 [2023-11-21 19:46:29,859 INFO L378 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 [2023-11-21 19:46:29,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:29,929 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:29,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:29,954 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:29,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:29,972 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,067 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,087 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,103 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,152 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,350 INFO L378 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 16 treesize of output 8 [2023-11-21 19:46:30,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,397 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,436 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,450 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,466 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,495 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,507 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,520 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,532 INFO L378 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 43 treesize of output 32 [2023-11-21 19:46:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:30,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:30,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:46:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:30,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:33,496 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:46:33,603 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_2599))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2023-11-21 19:46:33,682 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:46:33,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse2) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse2) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse1 v_ArrVal_2599))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))))) is different from false [2023-11-21 19:46:34,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse2 v_ArrVal_2599))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse2 v_ArrVal_2599))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse2 v_ArrVal_2599))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse2 v_ArrVal_2599))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-21 19:46:34,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (= (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))))) is different from false [2023-11-21 19:46:34,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-21 19:46:34,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))))) is different from false [2023-11-21 19:46:34,398 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse3 v_ArrVal_2599))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse4))))) is different from false [2023-11-21 19:46:34,441 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse0))))) is different from false [2023-11-21 19:46:34,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse7 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5) (= (select (select (let ((.cse9 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse9 .cse1 (store (select .cse9 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:46:34,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse9 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse9 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse9)) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_26 Int) (v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2587 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2595 (Array Int Int)) (v_ArrVal_2583 (Array Int Int))) (or (= (select (select (let ((.cse10 (store (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2583) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2587) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2595) .cse4 v_ArrVal_2599))) (store .cse10 .cse1 (store (select .cse10 .cse1) v_threadThread2of2ForFork0_~t~0.offset_26 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_26 .cse5)))))) is different from false [2023-11-21 19:46:34,688 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:46:34,689 INFO L378 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 4 case distinctions, treesize of input 129134 treesize of output 118336 [2023-11-21 19:46:34,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:34,891 INFO L378 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 3918 treesize of output 3596 [2023-11-21 19:46:34,943 INFO L378 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 3366 treesize of output 3238 [2023-11-21 19:46:34,973 INFO L378 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 1994 treesize of output 1978 [2023-11-21 19:46:35,014 INFO L378 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 3402 treesize of output 3338 [2023-11-21 19:46:35,044 INFO L378 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 3914 treesize of output 3658 [2023-11-21 19:46:40,332 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,348 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,370 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,389 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-21 19:46:40,389 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 3174 treesize of output 3105 [2023-11-21 19:46:40,402 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 284 [2023-11-21 19:46:40,410 INFO L378 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 168 treesize of output 160 [2023-11-21 19:46:40,427 INFO L378 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 141 treesize of output 137 [2023-11-21 19:46:40,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:40,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,464 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,474 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:46:40,474 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 5158 treesize of output 1 [2023-11-21 19:46:40,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,480 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:40,488 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:46:40,489 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 4902 treesize of output 1 [2023-11-21 19:46:40,933 INFO L378 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 38 treesize of output 22 [2023-11-21 19:46:41,144 INFO L378 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 58 treesize of output 46 [2023-11-21 19:46:41,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:41,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:41,229 INFO L378 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 10 treesize of output 8 [2023-11-21 19:46:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:46:41,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395287444] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:41,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:41,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 70 [2023-11-21 19:46:41,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268896631] [2023-11-21 19:46:41,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:41,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-21 19:46:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-21 19:46:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=3181, Unknown=13, NotChecked=1500, Total=4970 [2023-11-21 19:46:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:41,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:41,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.942857142857143) internal successors, (276), 71 states have internal predecessors, (276), 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) [2023-11-21 19:46:41,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:41,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:41,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:41,274 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:46:50,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:50,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:50,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-21 19:46:50,985 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:50,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash 434123219, now seen corresponding path program 2 times [2023-11-21 19:46:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:50,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917690924] [2023-11-21 19:46:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:50,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 19:46:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917690924] [2023-11-21 19:46:51,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917690924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:51,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555460031] [2023-11-21 19:46:51,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:51,345 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:51,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-21 19:46:51,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:51,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:51,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 19:46:51,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:51,815 INFO L378 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 24 treesize of output 12 [2023-11-21 19:46:51,935 INFO L378 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 [2023-11-21 19:46:51,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:51,962 INFO L378 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 16 treesize of output 11 [2023-11-21 19:46:51,985 INFO L378 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 19 treesize of output 18 [2023-11-21 19:46:52,013 INFO L378 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 26 treesize of output 28 [2023-11-21 19:46:52,046 INFO L378 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 33 treesize of output 38 [2023-11-21 19:46:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:52,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:52,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:52,874 INFO L378 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 18 treesize of output 19 [2023-11-21 19:46:52,875 INFO L378 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 30 treesize of output 22 [2023-11-21 19:46:52,876 INFO L378 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 [2023-11-21 19:46:52,932 INFO L378 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 [2023-11-21 19:46:52,950 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-21 19:46:52,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555460031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:52,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:46:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 30 [2023-11-21 19:46:52,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698154806] [2023-11-21 19:46:52,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:52,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-21 19:46:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:46:52,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-21 19:46:52,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=751, Unknown=13, NotChecked=0, Total=870 [2023-11-21 19:46:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:52,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:52,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.366666666666666) internal successors, (161), 30 states have internal predecessors, (161), 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) [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:52,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:46:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:52,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:46:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:46:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:46:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:46:54,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-21 19:46:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-21 19:46:54,670 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:54,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 367290924, now seen corresponding path program 3 times [2023-11-21 19:46:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:46:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427055656] [2023-11-21 19:46:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:46:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:46:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427055656] [2023-11-21 19:46:56,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427055656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:46:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394187066] [2023-11-21 19:46:56,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:46:56,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:46:56,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:56,072 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:46:56,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-21 19:46:56,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 19:46:56,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:56,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-21 19:46:56,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:56,914 INFO L378 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 [2023-11-21 19:46:56,978 INFO L378 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 19 treesize of output 18 [2023-11-21 19:46:57,047 INFO L378 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 26 treesize of output 28 [2023-11-21 19:46:57,344 INFO L378 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 33 treesize of output 17 [2023-11-21 19:46:57,353 INFO L378 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 7 treesize of output 3 [2023-11-21 19:46:57,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,411 INFO L378 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 30 treesize of output 21 [2023-11-21 19:46:57,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,427 INFO L378 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 30 treesize of output 21 [2023-11-21 19:46:57,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,459 INFO L378 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 30 treesize of output 21 [2023-11-21 19:46:57,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,471 INFO L378 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 30 treesize of output 21 [2023-11-21 19:46:57,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,621 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:46:57,621 INFO L378 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 37 treesize of output 35 [2023-11-21 19:46:57,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,703 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:46:57,703 INFO L378 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 41 treesize of output 39 [2023-11-21 19:46:57,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,737 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:46:57,738 INFO L378 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 41 treesize of output 39 [2023-11-21 19:46:57,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:57,774 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:46:57,774 INFO L378 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 41 treesize of output 39 [2023-11-21 19:46:58,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,043 INFO L378 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 0 case distinctions, treesize of input 41 treesize of output 30 [2023-11-21 19:46:58,104 INFO L378 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 33 treesize of output 38 [2023-11-21 19:46:58,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,171 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,191 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,214 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,325 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,344 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,363 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,381 INFO L378 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 37 treesize of output 26 [2023-11-21 19:46:58,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:46:58,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:58,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 19:46:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:58,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:59,729 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:46:59,854 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:46:59,910 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|)))))) is different from false [2023-11-21 19:46:59,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= (select (select (let ((.cse2 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_30 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:47:00,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))))) is different from false [2023-11-21 19:47:00,220 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:47:00,588 INFO L378 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 8 treesize of output 4 [2023-11-21 19:47:00,689 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:47:00,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))))) is different from false [2023-11-21 19:47:00,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0))))) is different from false [2023-11-21 19:47:00,967 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse5))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse5) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse8 .cse1 (store (select .cse8 .cse1) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))))) is different from false [2023-11-21 19:47:01,001 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)))) (forall ((v_ArrVal_2977 (Array Int Int)) (v_ArrVal_2976 (Array Int Int)) (v_ArrVal_2985 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_2981 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_30 Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2976) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2977) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_2981) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2985))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_30 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_30 .cse0)))))) is different from false [2023-11-21 19:47:01,036 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:47:01,037 INFO L378 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 4 case distinctions, treesize of input 12430 treesize of output 11712 [2023-11-21 19:47:01,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:01,069 INFO L378 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 1910 treesize of output 1716 [2023-11-21 19:47:01,093 INFO L378 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 801 treesize of output 769 [2023-11-21 19:47:01,112 INFO L378 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 895 treesize of output 831 [2023-11-21 19:47:01,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,546 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:47:01,547 INFO L378 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 4 case distinctions, treesize of input 2658 treesize of output 1 [2023-11-21 19:47:01,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,561 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:47:01,562 INFO L378 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 4 case distinctions, treesize of input 2530 treesize of output 1 [2023-11-21 19:47:01,566 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,567 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:01,579 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:47:01,580 INFO L378 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 4 case distinctions, treesize of input 2658 treesize of output 1 [2023-11-21 19:47:01,910 INFO L378 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 8 treesize of output 4 [2023-11-21 19:47:01,912 INFO L378 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 [2023-11-21 19:47:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2023-11-21 19:47:02,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394187066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:02,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:02,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 25] total 70 [2023-11-21 19:47:02,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909731995] [2023-11-21 19:47:02,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:02,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-21 19:47:02,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-21 19:47:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3253, Unknown=11, NotChecked=1386, Total=4970 [2023-11-21 19:47:02,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:02,025 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:02,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 4.071428571428571) internal successors, (285), 71 states have internal predecessors, (285), 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) [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:02,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:12,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:12,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:12,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-21 19:47:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:12,422 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash -362962590, now seen corresponding path program 4 times [2023-11-21 19:47:12,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:12,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120002439] [2023-11-21 19:47:12,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:12,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120002439] [2023-11-21 19:47:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120002439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137179568] [2023-11-21 19:47:13,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:47:13,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:13,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:13,722 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-21 19:47:14,257 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:47:14,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:47:14,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-21 19:47:14,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:14,868 INFO L378 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 [2023-11-21 19:47:14,922 INFO L378 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 19 treesize of output 18 [2023-11-21 19:47:14,987 INFO L378 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 26 treesize of output 28 [2023-11-21 19:47:15,268 INFO L378 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 33 treesize of output 17 [2023-11-21 19:47:15,276 INFO L378 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 7 treesize of output 3 [2023-11-21 19:47:15,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,326 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,340 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,360 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,383 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,451 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,472 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,490 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,506 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,709 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,720 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,739 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,754 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,841 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,856 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,870 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:15,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:15,885 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:16,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:16,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:16,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:16,062 INFO L378 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 3 case distinctions, treesize of input 37 treesize of output 31 [2023-11-21 19:47:16,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:16,098 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:47:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:16,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:16,580 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:47:16,690 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_32 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:47:17,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))))) is different from false [2023-11-21 19:47:17,472 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse3 .cse2 (store (select .cse3 .cse2) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse4 .cse2 (store (select .cse4 .cse2) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-21 19:47:17,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse3 .cse1 (store (select .cse3 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse2))))) is different from false [2023-11-21 19:47:17,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))))) is different from false [2023-11-21 19:47:17,604 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3) (= (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3195 (Array Int Int)) (v_ArrVal_3199 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_32 Int) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (< v_threadThread2of2ForFork0_~t~0.offset_32 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3195) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3199))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_32 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7))))))) is different from false [2023-11-21 19:47:17,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:17,618 INFO L378 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 3 case distinctions, treesize of input 71 treesize of output 64 [2023-11-21 19:47:17,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:17,629 INFO L378 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 7938 treesize of output 7230 [2023-11-21 19:47:17,658 INFO L378 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 730 treesize of output 698 [2023-11-21 19:47:17,671 INFO L378 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 746 treesize of output 730 [2023-11-21 19:47:18,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:18,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 62 treesize of output 48 [2023-11-21 19:47:18,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:18,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2023-11-21 19:47:18,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:18,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:18,042 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:47:18,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 526 treesize of output 462 [2023-11-21 19:47:18,050 INFO L378 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 84 treesize of output 80 [2023-11-21 19:47:18,055 INFO L378 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 98 treesize of output 90 [2023-11-21 19:47:18,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 174 [2023-11-21 19:47:18,087 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:47:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 1 [2023-11-21 19:47:18,397 INFO L378 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 25 treesize of output 13 [2023-11-21 19:47:18,401 INFO L378 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 8 treesize of output 4 [2023-11-21 19:47:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2023-11-21 19:47:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137179568] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:18,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 63 [2023-11-21 19:47:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595972742] [2023-11-21 19:47:18,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:18,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-21 19:47:18,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:18,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-21 19:47:18,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=2884, Unknown=22, NotChecked=812, Total=4032 [2023-11-21 19:47:18,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:18,506 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:18,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 4.507936507936508) internal successors, (284), 64 states have internal predecessors, (284), 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) [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:18,506 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:26,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:47:26,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:26,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-21 19:47:26,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-21 19:47:26,675 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:26,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1785274648, now seen corresponding path program 2 times [2023-11-21 19:47:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993561404] [2023-11-21 19:47:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:26,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993561404] [2023-11-21 19:47:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993561404] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782491758] [2023-11-21 19:47:27,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:47:27,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:27,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:27,418 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:27,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-21 19:47:27,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:47:27,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:47:27,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-21 19:47:27,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:27,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:47:27,739 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:47:27,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:47:27,776 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:47:27,776 INFO L378 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 23 treesize of output 23 [2023-11-21 19:47:27,888 INFO L378 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 7 treesize of output 3 [2023-11-21 19:47:27,890 INFO L378 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 38 treesize of output 22 [2023-11-21 19:47:28,092 INFO L378 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 [2023-11-21 19:47:28,129 INFO L378 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 19 treesize of output 18 [2023-11-21 19:47:28,164 INFO L378 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 26 treesize of output 28 [2023-11-21 19:47:28,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,289 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,305 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,321 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,337 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,415 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,427 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,439 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,454 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,607 INFO L378 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 16 treesize of output 8 [2023-11-21 19:47:28,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,645 INFO L378 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 30 treesize of output 21 [2023-11-21 19:47:28,657 INFO L378 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 33 treesize of output 38 [2023-11-21 19:47:28,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,710 INFO L378 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 37 treesize of output 26 [2023-11-21 19:47:28,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,749 INFO L378 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 37 treesize of output 26 [2023-11-21 19:47:28,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,766 INFO L378 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 37 treesize of output 26 [2023-11-21 19:47:28,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:28,865 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:47:28,866 INFO L378 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 44 treesize of output 40 [2023-11-21 19:47:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:28,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:28,922 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-21 19:47:28,997 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))))) is different from false [2023-11-21 19:47:29,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse2))))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_3373 .cse0) 0)))) (forall ((v_ArrVal_3373 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))))) is different from false [2023-11-21 19:47:29,066 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_3373 .cse1) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_3373 .cse1) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse1) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse1) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse0))))))) is different from false [2023-11-21 19:47:29,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse2 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse2 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_3373 .cse0) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse2 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (not (= (select v_ArrVal_3373 .cse0) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse2 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 19:47:29,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364))) (store .cse1 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_3373 .cse0) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_3373 .cse0) 0)))))) is different from false [2023-11-21 19:47:29,679 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (forall ((v_ArrVal_3374 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_3373 .cse0) 0)))) (forall ((v_ArrVal_3373 (Array Int Int)) (v_ArrVal_3364 (Array Int Int)) (v_ArrVal_3369 (Array Int Int))) (or (not (= (select v_ArrVal_3373 .cse0) 0)) (forall ((v_ArrVal_3374 (Array Int Int))) (= (select (select (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse1 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3364) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3369) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3373) .cse3 v_ArrVal_3374) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 19:47:29,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:29,892 INFO L378 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 3 case distinctions, treesize of input 100 treesize of output 110 [2023-11-21 19:47:29,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:29,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 199 treesize of output 129 [2023-11-21 19:47:29,902 INFO L378 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 42 treesize of output 38 [2023-11-21 19:47:29,903 INFO L378 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 75 treesize of output 67 [2023-11-21 19:47:29,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:29,909 INFO L378 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 41 treesize of output 41 [2023-11-21 19:47:29,953 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,954 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,956 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,960 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:47:29,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 1 [2023-11-21 19:47:29,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:29,966 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:47:29,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 1 [2023-11-21 19:47:30,067 INFO L378 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 38 treesize of output 22 [2023-11-21 19:47:30,073 INFO L378 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 8 treesize of output 4 [2023-11-21 19:47:30,201 INFO L378 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 58 treesize of output 46 [2023-11-21 19:47:30,261 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:30,262 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:30,263 INFO L378 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 10 treesize of output 8 [2023-11-21 19:47:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:47:30,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782491758] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:30,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:30,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 51 [2023-11-21 19:47:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859168340] [2023-11-21 19:47:30,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:30,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 19:47:30,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:30,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 19:47:30,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1809, Unknown=10, NotChecked=644, Total=2652 [2023-11-21 19:47:30,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:30,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:30,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.450980392156863) internal successors, (227), 52 states have internal predecessors, (227), 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) [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:30,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:34,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:47:34,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-21 19:47:34,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-21 19:47:34,554 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:47:34,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:47:34,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1475283565, now seen corresponding path program 3 times [2023-11-21 19:47:34,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:47:34,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062689435] [2023-11-21 19:47:34,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:47:34,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:47:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:47:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:47:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062689435] [2023-11-21 19:47:36,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062689435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:47:36,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699876556] [2023-11-21 19:47:36,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:47:36,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:47:36,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:47:36,125 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:47:36,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-21 19:47:36,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 19:47:36,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:47:36,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 76 conjunts are in the unsatisfiable core [2023-11-21 19:47:36,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:47:36,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:47:36,576 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:47:36,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:47:36,614 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:47:36,614 INFO L378 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 23 treesize of output 23 [2023-11-21 19:47:36,995 INFO L378 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 [2023-11-21 19:47:37,052 INFO L378 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 [2023-11-21 19:47:37,113 INFO L378 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 [2023-11-21 19:47:37,394 INFO L378 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 45 treesize of output 25 [2023-11-21 19:47:37,397 INFO L378 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 21 treesize of output 13 [2023-11-21 19:47:37,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,461 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,477 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,498 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,517 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,617 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,637 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,650 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,664 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,900 INFO L378 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 16 treesize of output 8 [2023-11-21 19:47:37,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:37,966 INFO L378 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 34 treesize of output 25 [2023-11-21 19:47:37,996 INFO L378 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 [2023-11-21 19:47:38,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,063 INFO L378 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 43 treesize of output 32 [2023-11-21 19:47:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,083 INFO L378 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 43 treesize of output 32 [2023-11-21 19:47:38,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,099 INFO L378 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 43 treesize of output 32 [2023-11-21 19:47:38,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,220 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 19:47:38,220 INFO L378 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 50 treesize of output 46 [2023-11-21 19:47:38,312 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-21 19:47:38,312 INFO L378 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 2 case distinctions, treesize of input 62 treesize of output 58 [2023-11-21 19:47:38,393 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-21 19:47:38,393 INFO L378 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 2 case distinctions, treesize of input 62 treesize of output 58 [2023-11-21 19:47:38,475 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-21 19:47:38,475 INFO L378 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 2 case distinctions, treesize of input 62 treesize of output 58 [2023-11-21 19:47:38,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:47:38,606 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:38,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 47 [2023-11-21 19:47:38,613 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:47:38,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:47:39,712 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2023-11-21 19:47:39,911 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false [2023-11-21 19:47:39,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5)) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|)))))))) is different from false [2023-11-21 19:47:40,037 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3579))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))))) is different from false [2023-11-21 19:47:40,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse2 v_ArrVal_3579))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse2 v_ArrVal_3579))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse2 v_ArrVal_3579))) (store .cse4 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse4 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_ArrVal_3575 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_threadThread2of2ForFork0_~t~0.offset_35 Int) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse2 v_ArrVal_3579))) (store .cse5 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse5 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_35 |c_threadThread2of2ForFork0_#in~arg.offset|))))))) is different from false [2023-11-21 19:47:40,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse3 v_ArrVal_3579))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse3 v_ArrVal_3579))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse3 v_ArrVal_3579))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse3 v_ArrVal_3579))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 19:47:40,894 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse4 v_ArrVal_3579))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse6 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse4 v_ArrVal_3579))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse7 (store (store (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse8 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse4 v_ArrVal_3579))) (store .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse10 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse10 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse4 v_ArrVal_3579))) (store .cse9 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse9 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false [2023-11-21 19:47:41,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse11 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:47:41,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse11 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:47:41,267 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse1 (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse7 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse7 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse9 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse9 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store (let ((.cse11 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565))) (store .cse11 c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse11 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-21 19:47:41,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse0 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0)))))) is different from false [2023-11-21 19:47:41,520 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse10 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse5 (select (select |c_#memory_$Pointer$#2.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) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse1 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= (select (select (let ((.cse7 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse8 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse8 .cse2 (store (select .cse8 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_3570 (Array Int Int)) (v_threadThread2of2ForFork0_~t~0.offset_35 Int) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3565 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3579 (Array Int Int))) (or (not (= (select v_ArrVal_3575 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) c_threadThread1of2ForFork0_~t~0.base (store (select (store (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3570) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3575) .cse5 v_ArrVal_3579))) (store .cse9 .cse2 (store (select .cse9 .cse2) v_threadThread2of2ForFork0_~t~0.offset_35 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse10)) (< v_threadThread2of2ForFork0_~t~0.offset_35 .cse0)))))) is different from false [2023-11-21 19:47:41,574 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 19:47:41,575 INFO L378 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 4 case distinctions, treesize of input 8014 treesize of output 7152 [2023-11-21 19:47:41,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:41,642 INFO L378 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 5310 treesize of output 4828 [2023-11-21 19:47:41,689 INFO L378 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 1390 treesize of output 1358 [2023-11-21 19:47:41,719 INFO L378 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 2322 treesize of output 2274 [2023-11-21 19:47:41,753 INFO L378 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 2562 treesize of output 2434 [2023-11-21 19:47:41,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:41,785 INFO L378 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 2584 treesize of output 2528 [2023-11-21 19:47:45,141 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,143 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,148 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,161 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,170 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:47:45,171 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2774 treesize of output 1 [2023-11-21 19:47:45,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,176 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,177 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,193 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2023-11-21 19:47:45,194 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1686 treesize of output 1629 [2023-11-21 19:47:45,208 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 405 treesize of output 317 [2023-11-21 19:47:45,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:47:45,222 INFO L378 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 330 treesize of output 330 [2023-11-21 19:47:45,237 INFO L378 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 350 treesize of output 334 [2023-11-21 19:47:45,306 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:45,315 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 19:47:45,315 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2646 treesize of output 1 [2023-11-21 19:47:45,731 INFO L378 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 38 treesize of output 22 [2023-11-21 19:47:45,942 INFO L378 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 58 treesize of output 46 [2023-11-21 19:47:46,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:46,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:47:46,026 INFO L378 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 10 treesize of output 8 [2023-11-21 19:47:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:47:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699876556] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:47:46,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:47:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 75 [2023-11-21 19:47:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74310426] [2023-11-21 19:47:46,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:47:46,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2023-11-21 19:47:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:47:46,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2023-11-21 19:47:46,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3768, Unknown=12, NotChecked=1620, Total=5700 [2023-11-21 19:47:46,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:46,069 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:47:46,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 3.7733333333333334) internal successors, (283), 76 states have internal predecessors, (283), 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) [2023-11-21 19:47:46,069 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:47:46,070 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:48:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:48:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:48:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:48:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-11-21 19:48:00,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-21 19:48:00,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:00,237 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:48:00,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:48:00,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1897802061, now seen corresponding path program 4 times [2023-11-21 19:48:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:48:00,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508413784] [2023-11-21 19:48:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:48:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:48:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508413784] [2023-11-21 19:48:01,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508413784] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:48:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161650184] [2023-11-21 19:48:01,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:48:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:48:01,764 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:48:01,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-21 19:48:02,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:48:02,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:48:02,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-21 19:48:02,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:48:02,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:48:02,795 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:48:02,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:48:02,844 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:48:02,844 INFO L378 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 23 treesize of output 23 [2023-11-21 19:48:03,354 INFO L378 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 [2023-11-21 19:48:03,410 INFO L378 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 19 treesize of output 18 [2023-11-21 19:48:03,466 INFO L378 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 26 treesize of output 28 [2023-11-21 19:48:03,771 INFO L378 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 45 treesize of output 25 [2023-11-21 19:48:03,773 INFO L378 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 7 treesize of output 3 [2023-11-21 19:48:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:03,838 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:03,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:03,860 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:03,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:03,882 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:03,900 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,053 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,078 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,100 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,114 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,421 INFO L378 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 16 treesize of output 8 [2023-11-21 19:48:04,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,475 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,494 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,510 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,527 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,603 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,616 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,633 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,646 INFO L378 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 30 treesize of output 21 [2023-11-21 19:48:04,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:04,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:04,911 INFO L378 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 3 case distinctions, treesize of input 37 treesize of output 31 [2023-11-21 19:48:04,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:04,952 INFO L378 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 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 19:48:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:04,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:48:05,443 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int)) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:48:05,514 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_3783))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|)))) is different from false [2023-11-21 19:48:05,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_37 |c_threadThread2of2ForFork0_#in~arg.offset|))))) is different from false [2023-11-21 19:48:05,727 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse2))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse1 v_ArrVal_3783))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse2))))) is different from false [2023-11-21 19:48:05,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse0) (= (select (select (let ((.cse1 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse0))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse0))))) is different from false [2023-11-21 19:48:05,954 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))))) is different from false [2023-11-21 19:48:06,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))))) is different from false [2023-11-21 19:48:06,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse4 .cse1 (store (select .cse4 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse3) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse2 v_ArrVal_3783))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false [2023-11-21 19:48:06,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse6)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse4))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse4) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))))) is different from false [2023-11-21 19:48:06,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse5 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4))) (and (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= (select (select (let ((.cse6 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse6 .cse1 (store (select .cse6 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse5))) (forall ((v_threadThread2of2ForFork0_~t~0.offset_37 Int) (v_ArrVal_3771 (Array Int Int)) (v_ArrVal_3783 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3779 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3771) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_3779) .cse3 v_ArrVal_3783))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_threadThread2of2ForFork0_~t~0.offset_37 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8)) (< v_threadThread2of2ForFork0_~t~0.offset_37 .cse5)))))) is different from false [2023-11-21 19:48:06,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:06,236 INFO L378 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 3 case distinctions, treesize of input 87 treesize of output 80 [2023-11-21 19:48:06,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:06,251 INFO L378 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 18220 treesize of output 16616 [2023-11-21 19:48:06,328 INFO L378 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 3661 treesize of output 3597 [2023-11-21 19:48:06,357 INFO L378 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 4169 treesize of output 3913 [2023-11-21 19:48:06,393 INFO L378 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 4199 treesize of output 4071 [2023-11-21 19:48:11,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:11,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 137 treesize of output 111 [2023-11-21 19:48:11,415 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:48:11,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 1 [2023-11-21 19:48:11,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:11,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 80 [2023-11-21 19:48:11,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:11,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:11,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:11,443 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:48:11,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4524 treesize of output 4088 [2023-11-21 19:48:11,458 INFO L378 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 394 treesize of output 378 [2023-11-21 19:48:11,466 INFO L378 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 202 [2023-11-21 19:48:11,475 INFO L378 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 222 treesize of output 214 [2023-11-21 19:48:11,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 456 treesize of output 374 [2023-11-21 19:48:11,923 INFO L378 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 38 treesize of output 22 [2023-11-21 19:48:11,925 INFO L378 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 8 treesize of output 4 [2023-11-21 19:48:12,111 INFO L378 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 58 treesize of output 46 [2023-11-21 19:48:12,191 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:12,193 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:12,194 INFO L378 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 10 treesize of output 8 [2023-11-21 19:48:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 26 not checked. [2023-11-21 19:48:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161650184] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:48:12,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:48:12,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 26] total 76 [2023-11-21 19:48:12,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896596197] [2023-11-21 19:48:12,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:48:12,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-21 19:48:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:48:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-21 19:48:12,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=4078, Unknown=10, NotChecked=1390, Total=5852 [2023-11-21 19:48:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:12,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:48:12,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 3.75) internal successors, (285), 77 states have internal predecessors, (285), 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) [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 83 states. [2023-11-21 19:48:12,235 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:26,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:48:26,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-21 19:48:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-21 19:48:26,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-21 19:48:26,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-21 19:48:26,481 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:48:26,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:48:26,482 INFO L85 PathProgramCache]: Analyzing trace with hash 356509134, now seen corresponding path program 5 times [2023-11-21 19:48:26,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:48:26,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137219314] [2023-11-21 19:48:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:26,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:48:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:27,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:48:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137219314] [2023-11-21 19:48:27,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137219314] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:48:27,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479677200] [2023-11-21 19:48:27,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 19:48:27,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:27,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:48:27,721 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:48:27,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-21 19:48:28,366 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-21 19:48:28,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:48:28,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-21 19:48:28,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:48:29,073 INFO L378 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 [2023-11-21 19:48:29,136 INFO L378 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 19 treesize of output 18 [2023-11-21 19:48:29,474 INFO L378 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 33 treesize of output 17 [2023-11-21 19:48:29,482 INFO L378 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 7 treesize of output 3 [2023-11-21 19:48:29,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,535 INFO L378 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 16 [2023-11-21 19:48:29,549 INFO L378 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 26 treesize of output 28 [2023-11-21 19:48:29,619 INFO L378 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 33 treesize of output 38 [2023-11-21 19:48:29,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,698 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,723 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,751 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,869 INFO L378 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 7 treesize of output 3 [2023-11-21 19:48:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,935 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,956 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:29,979 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:29,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,000 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,259 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,325 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,338 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,354 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,440 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,454 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,471 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:30,485 INFO L378 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 37 treesize of output 26 [2023-11-21 19:48:30,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:30,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 19:48:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:30,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:48:35,710 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse0 |c_threadThread2of2ForFork0_#in~arg.base|) |c_threadThread2of2ForFork0_#in~arg.offset| |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse1 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse1 |c_threadThread2of2ForFork0_#in~arg.base|) |c_threadThread2of2ForFork0_#in~arg.offset| |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse2 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse2 |c_threadThread2of2ForFork0_#in~arg.base|) |c_threadThread2of2ForFork0_#in~arg.offset| |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse3 |c_threadThread2of2ForFork0_#in~arg.base| (store (select .cse3 |c_threadThread2of2ForFork0_#in~arg.base|) |c_threadThread2of2ForFork0_#in~arg.offset| |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false [2023-11-21 19:48:36,357 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse3 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false [2023-11-21 19:48:36,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse5 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_4000 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store .cse2 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse7)))))) is different from false [2023-11-21 19:48:36,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem9#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 4))) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem9#1.base|) .cse1 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false [2023-11-21 19:48:36,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 19:48:36,473 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_#t~post8#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3))))) is different from false [2023-11-21 19:48:36,500 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-21 19:48:36,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of2ForFork0_~t~0.offset 1))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (select (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 4)) (.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse5 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse5))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse7 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse7 .cse1 (store (select .cse7 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) .cse8) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_4000 (Array Int Int)) (v_ArrVal_3982 (Array Int Int)) (|threadThread2of2ForFork0_#t~nondet4| Int) (v_ArrVal_3996 (Array Int Int))) (= (select (select (let ((.cse9 (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select (store .cse3 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3982) c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse5 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_3996) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_4000))) (store .cse9 .cse1 (store (select .cse9 .cse1) .cse2 |threadThread2of2ForFork0_#t~nondet4|))) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 19:48:36,613 INFO L349 Elim1Store]: treesize reduction 26, result has 63.9 percent of original size [2023-11-21 19:48:36,613 INFO L378 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 4 case distinctions, treesize of input 18270 treesize of output 16355 [2023-11-21 19:48:36,635 INFO L378 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 1302 treesize of output 1238 [2023-11-21 19:48:36,644 INFO L378 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 1338 treesize of output 1306 [2023-11-21 19:48:36,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:48:36,659 INFO L378 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 1583 treesize of output 1447 [2023-11-21 19:48:36,681 INFO L378 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 557 treesize of output 549 [2023-11-21 19:48:37,209 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,216 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,232 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-21 19:48:37,233 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2550 treesize of output 2076 [2023-11-21 19:48:37,242 INFO L378 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 359 treesize of output 355 [2023-11-21 19:48:37,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,246 INFO L378 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 366 treesize of output 326 [2023-11-21 19:48:37,251 INFO L378 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 166 treesize of output 164 [2023-11-21 19:48:37,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,302 INFO L349 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-11-21 19:48:37,302 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1846 treesize of output 1788 [2023-11-21 19:48:37,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,309 INFO L378 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 240 treesize of output 220 [2023-11-21 19:48:37,313 INFO L378 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 244 treesize of output 236 [2023-11-21 19:48:37,320 INFO L378 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 130 treesize of output 126 [2023-11-21 19:48:37,350 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,370 INFO L349 Elim1Store]: treesize reduction 49, result has 31.9 percent of original size [2023-11-21 19:48:37,370 INFO L378 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1846 treesize of output 1792 [2023-11-21 19:48:37,378 INFO L378 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 297 treesize of output 289 [2023-11-21 19:48:37,383 INFO L378 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 154 treesize of output 150 [2023-11-21 19:48:37,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:48:37,392 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:48:37,393 INFO L378 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 348 treesize of output 278 [2023-11-21 19:48:38,053 INFO L378 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 25 treesize of output 13 [2023-11-21 19:48:38,056 INFO L378 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 8 treesize of output 4 [2023-11-21 19:48:38,159 INFO L378 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 8 treesize of output 4 [2023-11-21 19:48:38,163 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2023-11-21 19:48:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479677200] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:48:38,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:48:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 23] total 69 [2023-11-21 19:48:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765721664] [2023-11-21 19:48:38,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:48:38,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-21 19:48:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:48:38,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-21 19:48:38,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3430, Unknown=59, NotChecked=1016, Total=4830 [2023-11-21 19:48:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:38,167 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:48:38,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.188405797101449) internal successors, (289), 70 states have internal predecessors, (289), 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) [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:38,167 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 84 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 97 states. [2023-11-21 19:48:38,168 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:47,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-11-21 19:48:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-11-21 19:48:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 19:48:47,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-21 19:48:47,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:47,332 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:48:47,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:48:47,333 INFO L85 PathProgramCache]: Analyzing trace with hash -941426627, now seen corresponding path program 5 times [2023-11-21 19:48:47,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:48:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169044160] [2023-11-21 19:48:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:48:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:48:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:48:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:48:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:48:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169044160] [2023-11-21 19:48:48,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169044160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:48:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764623837] [2023-11-21 19:48:48,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 19:48:48,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:48:48,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:48:48,744 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 19:48:48,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-21 19:48:49,392 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-21 19:48:49,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:48:49,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-21 19:48:49,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:48:49,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-21 19:48:49,458 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-21 19:48:49,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2023-11-21 19:48:49,499 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 19:48:49,499 INFO L378 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 23 treesize of output 23 [2023-11-21 19:48:50,095 INFO L378 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 [2023-11-21 19:48:50,186 INFO L378 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 19 treesize of output 18 [2023-11-21 19:48:50,571 INFO L378 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 45 treesize of output 25 [2023-11-21 19:48:50,581 INFO L378 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 7 treesize of output 3 [2023-11-21 19:48:50,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:48:50,650 INFO L378 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 16 [2023-11-21 19:48:50,675 INFO L378 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 26 treesize of output 28 Killed by 15