./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.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-array-init.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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:42:04,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:42:04,989 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 19:42:04,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:42:04,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:42:05,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:42:05,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:42:05,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:42:05,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:42:05,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:42:05,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:42:05,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:42:05,007 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:42:05,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:42:05,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:42:05,008 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:42:05,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 19:42:05,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:42:05,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:42:05,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:42:05,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:42:05,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:42:05,010 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 19:42:05,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:42:05,010 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:42:05,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:42:05,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:42:05,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:42:05,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:42:05,011 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 19:42:05,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:42:05,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:42:05,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:42:05,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:42:05,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:42:05,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 19:42:05,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 19:42:05,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:42:05,013 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 19:42:05,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:42:05,014 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:42:05,029 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:42:05,029 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:42:05,029 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 19:42:05,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:42:05,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:42:05,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:42:05,267 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:42:05,268 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:42:05,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-21 19:42:06,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:42:06,576 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:42:06,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-21 19:42:06,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e366b4083/34920993976b416fba6c269170b3403a/FLAG3be472489 [2023-11-21 19:42:06,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e366b4083/34920993976b416fba6c269170b3403a [2023-11-21 19:42:06,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:42:06,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:42:06,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:42:06,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:42:06,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:42:06,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:42:06" (1/1) ... [2023-11-21 19:42:06,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521d55e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:06, skipping insertion in model container [2023-11-21 19:42:06,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:42:06" (1/1) ... [2023-11-21 19:42:06,656 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:42:06,820 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:42:07,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:42:07,052 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:42:07,070 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:42:07,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:42:07,141 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:42:07,147 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:42:07,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07 WrapperNode [2023-11-21 19:42:07,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:42:07,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:42:07,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:42:07,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:42:07,155 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:42:07" (1/1) ... [2023-11-21 19:42:07,176 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:42:07" (1/1) ... [2023-11-21 19:42:07,194 INFO L138 Inliner]: procedures = 266, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-21 19:42:07,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:42:07,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:42:07,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:42:07,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:42:07,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,207 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,223 INFO L193 HeapSplitter]: Split 12 memory accesses to 5 slices as follows [1, 4, 4, 2, 1] [2023-11-21 19:42:07,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:42:07,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:42:07,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:42:07,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:42:07,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (1/1) ... [2023-11-21 19:42:07,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:42:07,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:07,287 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:42:07,303 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:42:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:42:07,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 19:42:07,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 19:42:07,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 19:42:07,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 19:42:07,345 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 19:42:07,345 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 19:42:07,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:42:07,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:42:07,346 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:42:07,451 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:42:07,453 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:42:07,657 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:42:07,669 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:42:07,669 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:42:07,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:42:07 BoogieIcfgContainer [2023-11-21 19:42:07,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:42:07,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:42:07,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:42:07,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:42:07,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:42:06" (1/3) ... [2023-11-21 19:42:07,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41161d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:42:07, skipping insertion in model container [2023-11-21 19:42:07,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:42:07" (2/3) ... [2023-11-21 19:42:07,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41161d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:42:07, skipping insertion in model container [2023-11-21 19:42:07,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:42:07" (3/3) ... [2023-11-21 19:42:07,676 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-21 19:42:07,682 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:42:07,689 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:42:07,690 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 19:42:07,690 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:42:07,731 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 19:42:07,766 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:42:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:42:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:07,768 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:42:07,771 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:42:07,821 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:42:07,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 19:42:07,833 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;@2bf13612, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:42:07,833 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:42:08,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:08,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash 874698824, now seen corresponding path program 1 times [2023-11-21 19:42:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:08,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827952141] [2023-11-21 19:42:08,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:08,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:08,339 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:42:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:08,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827952141] [2023-11-21 19:42:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827952141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:42:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:42:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:42:08,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919935945] [2023-11-21 19:42:08,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:42:08,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:42:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:08,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:42:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:42:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:08,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:08,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:42:08,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:08,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 19:42:08,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:08,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:08,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1880402312, now seen corresponding path program 1 times [2023-11-21 19:42:08,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:08,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316997538] [2023-11-21 19:42:08,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:08,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:09,036 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:42:09,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:09,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316997538] [2023-11-21 19:42:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316997538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:42:09,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:42:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:42:09,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108438733] [2023-11-21 19:42:09,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:42:09,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:42:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:42:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:42:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:09,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:09,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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:42:09,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:09,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:09,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 19:42:09,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:09,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1958933017, now seen corresponding path program 1 times [2023-11-21 19:42:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:09,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27017123] [2023-11-21 19:42:09,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:10,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27017123] [2023-11-21 19:42:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27017123] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706549717] [2023-11-21 19:42:10,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:10,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:10,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:10,713 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:42:10,714 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:42:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:10,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 19:42:10,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:11,185 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:42:11,224 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:42:11,269 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:42:11,322 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:42:11,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 21 treesize of output 13 [2023-11-21 19:42:11,588 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:42:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,645 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:42:11,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,665 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:42:11,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,686 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:42:11,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,729 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:42:11,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:11,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:11,822 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 58 treesize of output 47 [2023-11-21 19:42:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:11,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:11,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-21 19:42:12,051 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0))))) is different from false [2023-11-21 19:42:14,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1))) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0))) (forall ((|v_ULTIMATE.start_main_~i~1#1_19| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_19| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse1) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_283 Int)) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0)))))))) is different from false [2023-11-21 19:42:14,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) 0))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse1))))) is different from false [2023-11-21 19:42:14,452 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse3 0))) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse3) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse4) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse4) (= 0 (select (select (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5)))))) is different from false [2023-11-21 19:42:14,504 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 0) .cse8 0))) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= 0 (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse6)))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= 0 (select (select (let ((.cse9 (store .cse2 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse9 .cse1 (store (select .cse9 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse3) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse4)))))) is different from false [2023-11-21 19:42:14,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse10 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse8 0) .cse10 0) .cse4 0))) (.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse4) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse8) 0))) (forall ((v_ArrVal_281 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_19| Int) (v_ArrVal_283 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_12| Int)) (or (= (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_281))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_12| (* |v_ULTIMATE.start_main_~i~1#1_19| 4)) v_ArrVal_283))) c_threadThread1of1ForFork0_~p~0.base) .cse10) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_12| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_19| .cse5)))))) is different from false [2023-11-21 19:42:14,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:14,603 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:42:14,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:14,614 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 444 treesize of output 416 [2023-11-21 19:42:14,625 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 190 treesize of output 174 [2023-11-21 19:42:14,641 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 31 treesize of output 17 [2023-11-21 19:42:14,658 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 149 treesize of output 127 [2023-11-21 19:42:14,745 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:42:14,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-21 19:42:14,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:14,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-21 19:42:14,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:42:14,767 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:42:14,768 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 144 treesize of output 130 [2023-11-21 19:42:14,776 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 48 treesize of output 44 [2023-11-21 19:42:14,782 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 80 treesize of output 62 [2023-11-21 19:42:14,800 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 19:42:14,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 1 [2023-11-21 19:42:15,045 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:42:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 19:42:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706549717] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:15,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:15,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 48 [2023-11-21 19:42:15,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156657302] [2023-11-21 19:42:15,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:15,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-21 19:42:15,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:15,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 19:42:15,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1534, Unknown=7, NotChecked=602, Total=2352 [2023-11-21 19:42:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:15,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:15,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 4.208333333333333) internal successors, (202), 49 states have internal predecessors, (202), 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:42:15,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:15,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:15,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:42:18,040 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:42:18,231 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:42:18,232 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:18,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1685451621, now seen corresponding path program 2 times [2023-11-21 19:42:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:18,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102321368] [2023-11-21 19:42:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102321368] [2023-11-21 19:42:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102321368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881788327] [2023-11-21 19:42:19,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:42:19,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:19,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:19,289 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:42:19,327 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:42:19,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:42:19,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:42:19,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-21 19:42:19,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:19,931 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:42:19,986 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:42:20,034 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:42:20,290 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:42:20,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 7 treesize of output 3 [2023-11-21 19:42:20,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,343 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:42:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,362 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:42:20,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,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 30 treesize of output 21 [2023-11-21 19:42:20,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,399 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:42:20,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:20,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:20,477 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 45 treesize of output 31 [2023-11-21 19:42:20,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:20,503 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:42:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:20,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:20,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) is different from false [2023-11-21 19:42:22,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse3) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) is different from false [2023-11-21 19:42:24,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse4 .cse3 (store (select .cse4 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_21| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse1) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse5 .cse3 (store (select .cse5 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse0))))) is different from false [2023-11-21 19:42:24,812 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse2) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse3))))) is different from false [2023-11-21 19:42:24,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 0)))) (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (= 0 (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) .cse4)) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse5))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse5))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse5) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-21 19:42:24,989 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse7 0) .cse5 0))) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1))) (and (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse1) (= 0 (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) .cse5)))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse1))) (forall ((v_ArrVal_444 Int) (v_ArrVal_443 (Array Int Int)) (|v_ULTIMATE.start_main_~i~1#1_21| Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_15| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_15| .cse0) (= (select (select (let ((.cse8 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_443))) (store .cse8 .cse3 (store (select .cse8 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_21| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_15|) v_ArrVal_444))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_21| .cse1)))))) is different from false [2023-11-21 19:42:25,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:25,007 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:42:25,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:25,017 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 330 treesize of output 318 [2023-11-21 19:42:25,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 194 treesize of output 178 [2023-11-21 19:42:25,045 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 23 treesize of output 13 [2023-11-21 19:42:25,052 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 144 treesize of output 126 [2023-11-21 19:42:25,138 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:42:25,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1 [2023-11-21 19:42:25,149 INFO L349 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2023-11-21 19:42:25,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1 [2023-11-21 19:42:25,369 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:42:25,372 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:42:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 19:42:25,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881788327] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:25,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:25,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 49 [2023-11-21 19:42:25,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497571727] [2023-11-21 19:42:25,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:25,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 19:42:25,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 19:42:25,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1665, Unknown=6, NotChecked=534, Total=2450 [2023-11-21 19:42:25,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:25,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:25,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.122448979591836) internal successors, (202), 50 states have internal predecessors, (202), 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:42:25,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:25,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:25,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 19:42:25,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:28,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:42:28,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:42:28,519 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:42:28,717 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:42:28,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:28,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1711566779, now seen corresponding path program 3 times [2023-11-21 19:42:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171149806] [2023-11-21 19:42:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:29,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:29,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171149806] [2023-11-21 19:42:29,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171149806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:29,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303742318] [2023-11-21 19:42:29,586 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 19:42:29,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:29,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:29,587 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:42:29,590 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:42:29,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 19:42:29,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:42:29,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-21 19:42:29,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:30,000 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:42:30,039 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:42:30,227 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:42:30,230 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:42:30,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,274 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 25 treesize of output 18 [2023-11-21 19:42:30,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,288 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 25 treesize of output 18 [2023-11-21 19:42:30,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,306 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 25 treesize of output 18 [2023-11-21 19:42:30,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,319 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 25 treesize of output 18 [2023-11-21 19:42:30,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:30,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:30,379 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 1 case distinctions, treesize of input 40 treesize of output 23 [2023-11-21 19:42:30,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:30,385 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:42:30,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:30,394 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:42:30,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:30,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:42:30,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem8#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) is different from false [2023-11-21 19:42:30,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= 0 (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))))) (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse3) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-21 19:42:32,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_main_#t~post7#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse3))) (forall ((|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse3))))) is different from false [2023-11-21 19:42:32,700 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 1))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse4 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (and (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse2 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0))) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_606 Int) (|v_ULTIMATE.start_main_#t~mem8#1.offset_18| Int) (|v_ULTIMATE.start_main_~i~1#1_23| Int)) (or (< |v_ULTIMATE.start_main_#t~mem8#1.offset_18| .cse0) (< |v_ULTIMATE.start_main_~i~1#1_23| .cse1) (= (select (select (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_605))) (store .cse6 .cse3 (store (select .cse6 .cse3) (+ (* |v_ULTIMATE.start_main_~i~1#1_23| 4) |v_ULTIMATE.start_main_#t~mem8#1.offset_18|) v_ArrVal_606))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0)))))) is different from false [2023-11-21 19:42:32,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:32,713 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 61 treesize of output 54 [2023-11-21 19:42:32,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:42:32,721 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 228 treesize of output 220 [2023-11-21 19:42:32,729 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 197 treesize of output 181 [2023-11-21 19:42:32,737 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 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-21 19:42:32,751 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 0 case distinctions, treesize of input 136 treesize of output 122 [2023-11-21 19:42:32,832 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-21 19:42:32,832 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 1 [2023-11-21 19:42:33,125 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:42:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 19:42:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303742318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:42:33,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 19:42:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2023-11-21 19:42:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042409747] [2023-11-21 19:42:33,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 19:42:33,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-11-21 19:42:33,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 19:42:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-21 19:42:33,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1458, Unknown=19, NotChecked=324, Total=1980 [2023-11-21 19:42:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:33,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:42:33,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 4.5) internal successors, (198), 45 states have internal predecessors, (198), 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:42:33,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:33,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:33,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:42:33,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 19:42:33,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:42:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:42:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-21 19:42:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 19:42:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-21 19:42:37,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-21 19:42:37,319 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:42:37,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:42:37,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:42:37,320 INFO L85 PathProgramCache]: Analyzing trace with hash 566366343, now seen corresponding path program 4 times [2023-11-21 19:42:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 19:42:37,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068207105] [2023-11-21 19:42:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:42:37,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 19:42:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:42:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:42:38,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 19:42:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068207105] [2023-11-21 19:42:38,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068207105] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 19:42:38,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001100569] [2023-11-21 19:42:38,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 19:42:38,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 19:42:38,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:42:38,067 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:42:38,091 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:42:38,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 19:42:38,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:42:38,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-21 19:42:38,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:42:38,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:42:38,422 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:42:38,427 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:42:38,462 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-21 19:42:38,462 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 1 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 19:42:38,503 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-21 19:42:38,503 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 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-21 19:42:38,557 INFO L349 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2023-11-21 19:42:38,557 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 4 case distinctions, treesize of input 37 treesize of output 42 [2023-11-21 19:42:38,640 INFO L349 Elim1Store]: treesize reduction 69, result has 9.2 percent of original size [2023-11-21 19:42:38,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 46 treesize of output 54 [2023-11-21 19:42:42,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 19:42:42,835 INFO L349 Elim1Store]: treesize reduction 178, result has 33.3 percent of original size [2023-11-21 19:42:42,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 65 treesize of output 111 [2023-11-21 19:42:55,277 INFO L349 Elim1Store]: treesize reduction 559, result has 78.8 percent of original size [2023-11-21 19:42:55,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 152 case distinctions, treesize of input 241 treesize of output 2189 [2023-11-21 19:46:02,579 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-21 19:46:02,581 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-21 19:46:02,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-21 19:46:02,595 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:46:02,782 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:46:02,783 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-11-21 19:46:02,787 INFO L158 Benchmark]: Toolchain (without parser) took 236174.20ms. Allocated memory was 151.0MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 76.0MB in the beginning and 1.9GB in the end (delta: -1.9GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-21 19:46:02,787 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 19:46:02,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.05ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 75.8MB in the beginning and 145.4MB in the end (delta: -69.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2023-11-21 19:46:02,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.78ms. Allocated memory is still 190.8MB. Free memory was 145.4MB in the beginning and 142.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 19:46:02,788 INFO L158 Benchmark]: Boogie Preprocessor took 63.92ms. Allocated memory is still 190.8MB. Free memory was 142.3MB in the beginning and 139.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 19:46:02,788 INFO L158 Benchmark]: RCFGBuilder took 411.21ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 116.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-21 19:46:02,788 INFO L158 Benchmark]: TraceAbstraction took 235114.92ms. Allocated memory was 190.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 116.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2023-11-21 19:46:02,789 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.05ms. Allocated memory was 151.0MB in the beginning and 190.8MB in the end (delta: 39.8MB). Free memory was 75.8MB in the beginning and 145.4MB in the end (delta: -69.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.78ms. Allocated memory is still 190.8MB. Free memory was 145.4MB in the beginning and 142.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.92ms. Allocated memory is still 190.8MB. Free memory was 142.3MB in the beginning and 139.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.21ms. Allocated memory is still 190.8MB. Free memory was 139.2MB in the beginning and 116.9MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 235114.92ms. Allocated memory was 190.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 116.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-21 19:46:02,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-array-init.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.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 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 19:46:04,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 19:46:05,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Bitvector.epf [2023-11-21 19:46:05,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 19:46:05,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 19:46:05,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 19:46:05,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 19:46:05,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 19:46:05,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 19:46:05,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 19:46:05,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 19:46:05,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 19:46:05,073 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 19:46:05,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 19:46:05,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 19:46:05,075 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 19:46:05,075 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 19:46:05,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 19:46:05,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 19:46:05,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 19:46:05,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 19:46:05,077 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 19:46:05,078 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 19:46:05,078 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 19:46:05,078 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 19:46:05,078 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 19:46:05,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 19:46:05,079 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 19:46:05,079 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 19:46:05,079 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 19:46:05,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 19:46:05,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:46:05,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 19:46:05,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 19:46:05,081 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 19:46:05,081 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 19:46:05,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 19:46:05,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 19:46:05,082 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 19:46:05,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 19:46:05,083 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 19:46:05,083 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 19:46:05,083 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 19:46:05,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 19:46:05,084 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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 -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-21 19:46:05,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 19:46:05,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 19:46:05,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 19:46:05,427 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 19:46:05,428 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 19:46:05,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-21 19:46:06,496 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 19:46:06,682 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 19:46:06,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init.i [2023-11-21 19:46:06,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0c38df7b2/a82d0e89fb904ee7b87224bfec3395d7/FLAG06219adec [2023-11-21 19:46:06,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0c38df7b2/a82d0e89fb904ee7b87224bfec3395d7 [2023-11-21 19:46:06,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 19:46:06,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 19:46:06,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 19:46:06,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 19:46:06,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 19:46:06,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:46:06" (1/1) ... [2023-11-21 19:46:06,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd1e293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:06, skipping insertion in model container [2023-11-21 19:46:06,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 07:46:06" (1/1) ... [2023-11-21 19:46:06,753 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 19:46:06,910 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:46:07,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:46:07,129 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 19:46:07,149 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 19:46:07,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 19:46:07,241 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 19:46:07,247 INFO L206 MainTranslator]: Completed translation [2023-11-21 19:46:07,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07 WrapperNode [2023-11-21 19:46:07,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 19:46:07,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 19:46:07,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 19:46:07,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 19:46:07,254 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:46:07" (1/1) ... [2023-11-21 19:46:07,281 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:46:07" (1/1) ... [2023-11-21 19:46:07,314 INFO L138 Inliner]: procedures = 267, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2023-11-21 19:46:07,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 19:46:07,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 19:46:07,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 19:46:07,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 19:46:07,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,341 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,356 INFO L193 HeapSplitter]: Split 12 memory accesses to 5 slices as follows [2, 1, 4, 1, 4] [2023-11-21 19:46:07,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 19:46:07,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 19:46:07,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 19:46:07,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 19:46:07,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (1/1) ... [2023-11-21 19:46:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 19:46:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:07,429 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:46:07,478 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:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-21 19:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-21 19:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-21 19:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-21 19:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-21 19:46:07,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-21 19:46:07,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-21 19:46:07,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-21 19:46:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-21 19:46:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-21 19:46:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-21 19:46:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 19:46:07,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 19:46:07,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 19:46:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 19:46:07,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 19:46:07,504 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:46:07,625 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 19:46:07,627 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 19:46:07,929 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 19:46:07,941 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 19:46:07,941 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 19:46:07,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:46:07 BoogieIcfgContainer [2023-11-21 19:46:07,943 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 19:46:07,945 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 19:46:07,945 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 19:46:07,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 19:46:07,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 07:46:06" (1/3) ... [2023-11-21 19:46:07,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350354b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:46:07, skipping insertion in model container [2023-11-21 19:46:07,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 07:46:07" (2/3) ... [2023-11-21 19:46:07,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350354b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 07:46:07, skipping insertion in model container [2023-11-21 19:46:07,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 07:46:07" (3/3) ... [2023-11-21 19:46:07,951 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2023-11-21 19:46:07,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 19:46:07,966 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 19:46:07,966 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-21 19:46:07,966 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 19:46:08,014 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 19:46:08,058 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:46:08,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 19:46:08,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 19:46:08,061 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:46:08,113 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:46:08,146 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 19:46:08,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 19:46:08,182 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;@4af3384f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 19:46:08,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 19:46:08,435 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:08,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash 133341839, now seen corresponding path program 1 times [2023-11-21 19:46:08,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 19:46:08,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488079813] [2023-11-21 19:46:08,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:08,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:08,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-21 19:46:08,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:46:08,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-21 19:46:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:08,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-21 19:46:08,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:08,605 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:46:08,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:46:08,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 19:46:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488079813] [2023-11-21 19:46:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488079813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:46:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:46:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 19:46:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875921506] [2023-11-21 19:46:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:46:08,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 19:46:08,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 19:46:08,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 19:46:08,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 19:46:08,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:08,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:08,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:08,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:08,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-21 19:46:08,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:08,875 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:08,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1409089194, now seen corresponding path program 1 times [2023-11-21 19:46:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 19:46:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991396658] [2023-11-21 19:46:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:08,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:08,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-21 19:46:08,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:46:08,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-21 19:46:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:09,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-21 19:46:09,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:09,029 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:09,043 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 22 [2023-11-21 19:46:09,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:09,067 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 36 [2023-11-21 19:46:09,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:09,096 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 50 [2023-11-21 19:46:09,123 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:46:09,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 19:46:09,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 19:46:09,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991396658] [2023-11-21 19:46:09,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991396658] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 19:46:09,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 19:46:09,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 19:46:09,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156971872] [2023-11-21 19:46:09,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 19:46:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 19:46:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 19:46:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 19:46:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 19:46:09,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:09,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:09,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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:09,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:09,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:09,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-21 19:46:09,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:09,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:09,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 27973942, now seen corresponding path program 1 times [2023-11-21 19:46:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 19:46:09,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052791039] [2023-11-21 19:46:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 19:46:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:09,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-21 19:46:09,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:46:09,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-21 19:46:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 19:46:09,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-21 19:46:09,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:09,717 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 7 [2023-11-21 19:46:09,732 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-21 19:46:09,732 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 13 treesize of output 13 [2023-11-21 19:46:10,266 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:10,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 19 treesize of output 20 [2023-11-21 19:46:10,399 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 32 [2023-11-21 19:46:10,474 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 44 [2023-11-21 19:46:10,839 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 23 treesize of output 11 [2023-11-21 19:46:10,850 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:46:10,936 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:10,965 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:10,995 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:11,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 37 treesize of output 26 [2023-11-21 19:46:11,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:11,150 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 49 [2023-11-21 19:46:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:11,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:11,390 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) |c_ULTIMATE.start_main_#t~mem8#1.offset|))) (and (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) (_ bv0 1))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:11,529 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:11,611 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_#t~post7#1|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) (_ bv0 1))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:11,643 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv3 32) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_213))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))))) is different from false [2023-11-21 19:46:15,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:15,439 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 86 treesize of output 79 [2023-11-21 19:46:15,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:15,455 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 382 treesize of output 356 [2023-11-21 19:46:15,470 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 215 treesize of output 199 [2023-11-21 19:46:15,496 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 31 treesize of output 17 [2023-11-21 19:46:15,538 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 161 treesize of output 139 [2023-11-21 19:46:15,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:15,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 79 [2023-11-21 19:46:15,736 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:15,750 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:15,751 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 154 treesize of output 140 [2023-11-21 19:46:15,767 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 54 treesize of output 50 [2023-11-21 19:46:15,779 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 86 treesize of output 68 [2023-11-21 19:46:15,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 77 [2023-11-21 19:46:15,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:15,863 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:15,864 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 146 treesize of output 132 [2023-11-21 19:46:15,877 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 84 treesize of output 68 [2023-11-21 19:46:15,888 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 52 treesize of output 50 [2023-11-21 19:46:15,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:15,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 86 treesize of output 79 [2023-11-21 19:46:15,941 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:15,959 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:15,959 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 154 treesize of output 140 [2023-11-21 19:46:15,978 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 86 treesize of output 68 [2023-11-21 19:46:15,990 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 54 treesize of output 50 [2023-11-21 19:46:17,547 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:46:17,549 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:17,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-21 19:46:17,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 19:46:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052791039] [2023-11-21 19:46:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052791039] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 19:46:17,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 19:46:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2023-11-21 19:46:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770507450] [2023-11-21 19:46:17,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 19:46:17,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-21 19:46:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 19:46:17,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-21 19:46:17,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=697, Unknown=46, NotChecked=236, Total=1122 [2023-11-21 19:46:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:17,657 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 19:46:17,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.2727272727272725) internal successors, (141), 34 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:46:17,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:17,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:17,657 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 19:46:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 19:46:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 19:46:23,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-21 19:46:23,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:23,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 19:46:23,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 19:46:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1601459282, now seen corresponding path program 2 times [2023-11-21 19:46:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 19:46:23,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652759010] [2023-11-21 19:46:23,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 19:46:23,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 19:46:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-21 19:46:23,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 19:46:23,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-21 19:46:23,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 19:46:23,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 19:46:23,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-21 19:46:23,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 19:46:23,747 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 7 [2023-11-21 19:46:23,759 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-21 19:46:23,759 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 13 treesize of output 13 [2023-11-21 19:46:24,206 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:24,249 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 20 [2023-11-21 19:46:24,293 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 32 [2023-11-21 19:46:24,567 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 23 treesize of output 11 [2023-11-21 19:46:24,570 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:24,632 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:24,666 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:24,689 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:24,712 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:24,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:24,804 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 37 [2023-11-21 19:46:24,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:24,836 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 44 [2023-11-21 19:46:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 19:46:24,866 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 19:46:25,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) |c_ULTIMATE.start_main_#t~mem8#1.offset|))) (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) (_ bv0 1))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem8#1.base|) .cse1 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:46:25,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))))) is different from false [2023-11-21 19:46:25,240 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (bvmul (_ bv4 32) |c_ULTIMATE.start_main_#t~post7#1|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)) (_ bv0 1))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))))) is different from false [2023-11-21 19:46:25,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)))) (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) (_ bv0 1))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse4 .cse1 (store (select .cse4 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-21 19:46:25,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv2 32) c_threadThread1of1ForFork0_~p~0.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|)) (.cse2 (bvadd (bvmul |c_ULTIMATE.start_main_~i~1#1| (_ bv4 32)) (_ bv4 32) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#is~0#1.base|) |c_ULTIMATE.start_main_~#is~0#1.offset|))) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse4 (_ bv0 1))))) (and (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) .cse4) (_ bv0 1))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (_ bv0 1) (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_299 (Array (_ BitVec 32) (_ BitVec 1))) (|ULTIMATE.start_main_#t~nondet9#1| (_ BitVec 1))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~#is~0#1.base| v_ArrVal_299))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of1ForFork0_~p~0.base) (bvadd c_threadThread1of1ForFork0_~p~0.offset (_ bv1 32))) (_ bv0 1)))))) is different from false [2023-11-21 19:46:25,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:25,634 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 76 treesize of output 69 [2023-11-21 19:46:25,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:25,650 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 258 treesize of output 248 [2023-11-21 19:46:25,674 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 219 treesize of output 203 [2023-11-21 19:46:25,704 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 23 treesize of output 13 [2023-11-21 19:46:25,711 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 156 treesize of output 138 [2023-11-21 19:46:25,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:25,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 69 [2023-11-21 19:46:25,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:25,841 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:25,842 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 144 treesize of output 132 [2023-11-21 19:46:25,854 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 54 treesize of output 50 [2023-11-21 19:46:25,862 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 78 treesize of output 64 [2023-11-21 19:46:25,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 19:46:25,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 67 [2023-11-21 19:46:25,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 19:46:25,927 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 19:46:25,928 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 136 treesize of output 124 [2023-11-21 19:46:25,964 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 52 treesize of output 50 [2023-11-21 19:46:25,975 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 76 treesize of output 64 Killed by 15