./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i --full-output --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-index.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 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:01:20,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:01:20,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:01:20,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:01:20,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:01:20,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:01:20,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:01:20,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:01:20,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:01:20,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:01:20,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:01:20,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:01:20,291 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:01:20,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:01:20,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:01:20,293 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:01:20,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:01:20,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:01:20,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:01:20,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:01:20,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:01:20,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:01:20,295 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:01:20,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:01:20,295 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:01:20,295 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:01:20,295 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:01:20,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:01:20,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:01:20,296 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:01:20,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:01:20,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:01:20,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:01:20,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:01:20,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:01:20,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:01:20,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:01:20,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:01:20,298 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:01:20,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:01:20,299 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:01:20,299 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:01:20,299 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:01:20,299 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 -> 04b5785f32baf312774bbdd81055e04eea16b74acd932ddd06ae0cc7f49160c1 [2023-11-21 22:01:20,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:01:20,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:01:20,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:01:20,532 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:01:20,532 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:01:20,533 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-index.i [2023-11-21 22:01:21,530 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:01:21,821 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:01:21,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-index.i [2023-11-21 22:01:21,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2ad01e3be/f8deaf541bab496ca34c624d43788969/FLAGc48c1c3b8 [2023-11-21 22:01:22,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2ad01e3be/f8deaf541bab496ca34c624d43788969 [2023-11-21 22:01:22,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:01:22,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:01:22,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:01:22,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:01:22,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:01:22,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a8e4cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22, skipping insertion in model container [2023-11-21 22:01:22,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,207 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:01:22,332 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:01:22,530 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:01:22,537 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:01:22,557 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:01:22,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:01:22,627 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:01:22,633 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:01:22,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22 WrapperNode [2023-11-21 22:01:22,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:01:22,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:01:22,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:01:22,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:01:22,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,697 INFO L138 Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-11-21 22:01:22,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:01:22,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:01:22,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:01:22,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:01:22,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,737 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:01:22,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:01:22,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:01:22,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:01:22,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (1/1) ... [2023-11-21 22:01:22,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:01:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:22,792 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 22:01:22,846 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 22:01:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:01:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:01:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:01:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:01:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:01:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:01:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:01:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:01:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:01:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:01:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:01:22,873 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 22:01:22,988 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:01:22,990 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:01:23,147 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:01:23,155 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:01:23,156 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:01:23,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:23 BoogieIcfgContainer [2023-11-21 22:01:23,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:01:23,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:01:23,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:01:23,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:01:23,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:01:22" (1/3) ... [2023-11-21 22:01:23,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be5be78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:23, skipping insertion in model container [2023-11-21 22:01:23,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:01:22" (2/3) ... [2023-11-21 22:01:23,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be5be78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:01:23, skipping insertion in model container [2023-11-21 22:01:23,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:01:23" (3/3) ... [2023-11-21 22:01:23,163 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-index.i [2023-11-21 22:01:23,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:01:23,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:01:23,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-21 22:01:23,177 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:01:23,259 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:01:23,299 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:01:23,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:01:23,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:23,301 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 22:01:23,314 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 22:01:23,347 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:01:23,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:01:23,361 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;@4fc15334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:01:23,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 22:01:23,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:23,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1597542448, now seen corresponding path program 1 times [2023-11-21 22:01:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:23,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737852406] [2023-11-21 22:01:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:23,753 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 22:01:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:23,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737852406] [2023-11-21 22:01:23,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737852406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:23,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:01:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82639498] [2023-11-21 22:01:23,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:23,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:01:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:01:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:01:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:23,786 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:23,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 22:01:23,787 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:23,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:01:23,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:23,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1167023293, now seen corresponding path program 1 times [2023-11-21 22:01:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192462255] [2023-11-21 22:01:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:23,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:23,998 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 22:01:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192462255] [2023-11-21 22:01:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192462255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:23,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:01:23,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091194214] [2023-11-21 22:01:23,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:24,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:01:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:01:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:01:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,002 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:24,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 22:01:24,002 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:24,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:01:24,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:24,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 395297287, now seen corresponding path program 1 times [2023-11-21 22:01:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:24,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017900230] [2023-11-21 22:01:24,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:24,554 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 22:01:24,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017900230] [2023-11-21 22:01:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017900230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:24,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:01:24,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667053175] [2023-11-21 22:01:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:24,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:01:24,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:24,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:01:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:01:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,560 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:01:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:24,560 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:24,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:24,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:01:24,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:24,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:24,703 INFO L85 PathProgramCache]: Analyzing trace with hash 552674047, now seen corresponding path program 1 times [2023-11-21 22:01:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:24,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000029552] [2023-11-21 22:01:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000029552] [2023-11-21 22:01:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000029552] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:25,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:01:25,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 22:01:25,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50402938] [2023-11-21 22:01:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:25,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:01:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:25,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:01:25,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:01:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:25,133 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:25,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 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 22:01:25,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:25,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:25,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:25,133 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:25,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:25,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:01:25,399 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:25,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1561137989, now seen corresponding path program 1 times [2023-11-21 22:01:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359695546] [2023-11-21 22:01:25,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:26,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:26,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359695546] [2023-11-21 22:01:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359695546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:01:26,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821885625] [2023-11-21 22:01:26,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:26,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:26,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:26,285 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 22:01:26,311 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 22:01:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:26,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-21 22:01:26,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:01:26,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:01:26,488 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:01:26,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:01:26,658 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:01:26,658 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 33 treesize of output 24 [2023-11-21 22:01:26,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:26,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-21 22:01:26,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:01:26,771 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 28 treesize of output 27 [2023-11-21 22:01:26,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:26,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:01:26,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:01:27,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:01:27,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:27,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:27,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:27,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:27,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:27,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:27,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:27,244 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 56 treesize of output 45 [2023-11-21 22:01:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:27,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:01:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821885625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:01:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:01:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25 [2023-11-21 22:01:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131057682] [2023-11-21 22:01:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:01:27,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 22:01:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:01:27,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2023-11-21 22:01:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:27,254 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:27,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 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 22:01:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:27,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:01:27,971 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 22:01:28,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:28,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:28,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1894740813, now seen corresponding path program 2 times [2023-11-21 22:01:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277819824] [2023-11-21 22:01:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277819824] [2023-11-21 22:01:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277819824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:01:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846144773] [2023-11-21 22:01:28,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:01:28,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:28,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:28,758 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 22:01:28,784 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 22:01:28,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:01:28,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:01:28,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-21 22:01:28,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:01:28,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:01:28,939 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:01:28,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:01:29,256 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:01:29,256 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 33 treesize of output 24 [2023-11-21 22:01:29,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:29,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:01:29,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:29,434 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 26 treesize of output 19 [2023-11-21 22:01:29,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:29,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:01:29,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:01:29,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-21 22:01:29,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:01:29,867 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 22:01:29,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:01:29,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:29,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-21 22:01:30,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:01:30,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:30,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:30,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:30,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:30,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:30,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2023-11-21 22:01:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:30,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:01:30,442 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (* 4 c_threadThread1of1ForFork0_~i~0))) (and (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:01:30,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse6 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:01:30,506 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (+ c_~datas~0.offset 3 .cse3))) (and (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_317))) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:01:32,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse4 (+ c_~datas~0.offset 3 .cse5)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_317))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|)))))) is different from false [2023-11-21 22:01:34,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_~datas~0.offset 3 .cse4))) (and (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse4)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)))))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|)))))) is different from false [2023-11-21 22:01:37,231 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse8 (+ c_~datas~0.offset 2 .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ c_~datas~0.offset 3 .cse5))) (and (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse8))))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))))))) is different from false [2023-11-21 22:01:39,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse6 (+ c_~datas~0.offset .cse10 1)) (.cse8 (+ c_~datas~0.offset 2 .cse10))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ c_~datas~0.offset 3 .cse10))) (and (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse1 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse4))))))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~2#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_316 (Array Int Int)) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_317 Int)) (= (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_311) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_316))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_12| (* |v_ULTIMATE.start_main_~i~2#1_16| 4)) v_ArrVal_317))) c_~datas~0.base) (+ c_~datas~0.offset .cse10)) |c_threadThread1of1ForFork0_#t~nondet4|)))))))))) is different from false [2023-11-21 22:01:39,341 INFO L349 Elim1Store]: treesize reduction 41, result has 59.8 percent of original size [2023-11-21 22:01:39,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 664 treesize of output 544 [2023-11-21 22:01:39,355 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 382 treesize of output 358 [2023-11-21 22:01:39,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:39,376 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 581 treesize of output 535 [2023-11-21 22:01:39,388 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 228 treesize of output 222 [2023-11-21 22:01:39,571 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:39,586 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-11-21 22:01:39,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 1 [2023-11-21 22:01:39,590 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:39,597 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-11-21 22:01:39,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 413 treesize of output 1 [2023-11-21 22:01:39,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:39,609 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-11-21 22:01:39,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 413 treesize of output 1 [2023-11-21 22:01:40,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77 [2023-11-21 22:01:40,586 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 68 treesize of output 64 [2023-11-21 22:01:40,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 83 treesize of output 75 [2023-11-21 22:01:40,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2023-11-21 22:01:40,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:40,693 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 34 treesize of output 39 [2023-11-21 22:01:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:01:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846144773] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:01:40,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:01:40,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 21] total 52 [2023-11-21 22:01:40,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183623212] [2023-11-21 22:01:40,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:01:40,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-21 22:01:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:40,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-21 22:01:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=1797, Unknown=15, NotChecked=658, Total=2756 [2023-11-21 22:01:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:40,738 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:40,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 53 states have internal predecessors, (176), 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 22:01:40,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:40,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:40,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:40,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:40,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:01:40,739 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:01:44,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:01:44,202 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 22:01:44,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:44,385 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:01:44,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:01:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash -623360645, now seen corresponding path program 3 times [2023-11-21 22:01:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:01:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87774420] [2023-11-21 22:01:44,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:01:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:01:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:01:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:01:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87774420] [2023-11-21 22:01:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87774420] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:01:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490225388] [2023-11-21 22:01:45,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:01:45,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:01:45,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:01:45,029 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 22:01:45,030 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 22:01:45,148 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:01:45,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:01:45,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-21 22:01:45,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:01:45,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:01:45,250 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:01:45,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:01:45,628 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:01:45,629 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 33 treesize of output 24 [2023-11-21 22:01:45,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:45,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:01:45,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:45,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:01:45,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:45,846 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 26 treesize of output 19 [2023-11-21 22:01:45,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:01:45,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-21 22:01:46,164 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 22:01:46,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:01:46,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:46,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-11-21 22:01:46,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:01:46,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:01:46,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:46,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:46,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:46,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:46,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:01:46,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:01:46,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 71 [2023-11-21 22:01:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:01:46,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:01:46,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (* 4 c_threadThread1of1ForFork0_~i~0))) (and (forall ((v_ArrVal_422 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:01:46,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse6 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:01:46,777 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse8 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_422 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) .cse8))))))) is different from false [2023-11-21 22:01:46,833 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~2#1| 4))) (.cse2 (+ c_~datas~0.offset 2 .cse4)) (.cse3 (+ c_~datas~0.offset 3 .cse4))) (and (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:01:46,867 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~2#1| 4)) (.cse4 (+ c_~datas~0.offset 2 .cse7)) (.cse5 (+ c_~datas~0.offset 3 .cse7)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) 0))) c_~datas~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) 0))) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse9 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ .cse3 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse7)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|)))))) is different from false [2023-11-21 22:01:48,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_~datas~0.offset 3 .cse4)) (.cse2 (+ c_~datas~0.offset 2 .cse4)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse4 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|)))))) is different from false [2023-11-21 22:01:51,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse7 (+ c_~datas~0.offset .cse9 1))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse3 (+ c_~datas~0.offset 2 .cse9)) (.cse4 (+ c_~datas~0.offset 3 .cse9)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~2#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_~datas~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_~datas~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse6 .cse1 (store (select .cse6 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) .cse7))))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_~datas~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse9)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~2#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_416 (Array Int Int)) (v_ArrVal_422 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse10 (store (store |c_#race| c_~datas~0.base (store (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_416) c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_422))) (store .cse10 .cse1 (store (select .cse10 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~2#1_17| 4)) 0))) c_~datas~0.base) .cse4))) (< .cse5 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~2#1_17|))))))) is different from false [2023-11-21 22:01:51,429 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2023-11-21 22:01:51,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 504 treesize of output 504 [2023-11-21 22:01:51,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:51,447 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 496 treesize of output 460 [2023-11-21 22:01:51,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 278 [2023-11-21 22:01:51,584 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:51,602 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 22:01:51,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 373 treesize of output 292 [2023-11-21 22:01:51,611 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 146 treesize of output 140 [2023-11-21 22:01:51,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:51,616 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 244 treesize of output 218 [2023-11-21 22:01:51,636 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:51,642 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2023-11-21 22:01:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 1 [2023-11-21 22:01:51,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:01:51,653 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2023-11-21 22:01:51,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 1 [2023-11-21 22:01:54,271 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 93 treesize of output 77 [2023-11-21 22:01:54,275 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 68 treesize of output 64 [2023-11-21 22:01:54,277 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 83 treesize of output 75 [2023-11-21 22:01:54,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2023-11-21 22:01:54,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:01:54,388 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 34 treesize of output 39 [2023-11-21 22:01:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:01:54,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490225388] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:01:54,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:01:54,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 21] total 52 [2023-11-21 22:01:54,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818924377] [2023-11-21 22:01:54,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:01:54,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-21 22:01:54,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:01:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-21 22:01:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1817, Unknown=15, NotChecked=658, Total=2756 [2023-11-21 22:01:54,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:54,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:01:54,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.3846153846153846) internal successors, (176), 53 states have internal predecessors, (176), 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 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:01:54,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:01:58,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:02:01,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:02:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:01,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-21 22:02:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:02:01,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:02:02,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:02,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:02,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1078329997, now seen corresponding path program 4 times [2023-11-21 22:02:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:02,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024696585] [2023-11-21 22:02:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024696585] [2023-11-21 22:02:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024696585] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427088425] [2023-11-21 22:02:02,705 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:02:02,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:02,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:02,708 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 22:02:02,709 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 22:02:02,913 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:02:02,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:02,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 22:02:02,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:02,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:03,016 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:03,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:03,208 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 22:02:03,316 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:02:03,316 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:02:03,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:03,509 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 26 treesize of output 19 [2023-11-21 22:02:03,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:02:03,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:02:03,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:03,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:02:03,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:02:03,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:02:03,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:02:03,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:03,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:03,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:03,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:03,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:04,042 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 22:02:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:04,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:04,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of1ForFork0_~i~0))) (and (forall ((v_ArrVal_526 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) is different from false [2023-11-21 22:02:04,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of1ForFork0_~i~0))) (and (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:04,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:02:04,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse1)) (.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:02:04,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of1ForFork0_~i~0))) (let ((.cse4 (+ c_~datas~0.offset .cse2 1)) (.cse1 (+ c_~datas~0.offset 2 .cse2)) (.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_525 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_526) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:02:04,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:04,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2023-11-21 22:02:04,459 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 123 treesize of output 91 [2023-11-21 22:02:04,461 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 64 treesize of output 52 [2023-11-21 22:02:04,463 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 34 treesize of output 28 [2023-11-21 22:02:04,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,472 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,474 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,476 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:04,689 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 22:02:04,691 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 92 treesize of output 64 [2023-11-21 22:02:04,697 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 34 treesize of output 30 [2023-11-21 22:02:04,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:04,762 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 35 treesize of output 40 [2023-11-21 22:02:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:04,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427088425] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:04,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:04,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 16] total 46 [2023-11-21 22:02:04,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723491178] [2023-11-21 22:02:04,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:04,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-21 22:02:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:04,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-21 22:02:04,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1532, Unknown=16, NotChecked=420, Total=2162 [2023-11-21 22:02:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,796 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.630434782608696) internal successors, (167), 47 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:02:04,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:02:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:02:07,221 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 22:02:07,418 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,SelfDestructingSolverStorable7 [2023-11-21 22:02:07,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:07,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1037880891, now seen corresponding path program 5 times [2023-11-21 22:02:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:07,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480057795] [2023-11-21 22:02:07,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:07,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480057795] [2023-11-21 22:02:07,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480057795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:07,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136124858] [2023-11-21 22:02:07,966 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:02:07,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:07,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:07,967 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:07,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-21 22:02:08,066 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:08,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:08,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:02:08,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:08,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:08,163 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:08,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:08,289 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:08,290 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 33 treesize of output 24 [2023-11-21 22:02:08,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,324 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 26 treesize of output 19 [2023-11-21 22:02:08,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:02:08,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:02:08,436 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 28 treesize of output 27 [2023-11-21 22:02:08,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:02:08,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:02:08,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:08,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:08,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:08,642 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 56 treesize of output 45 [2023-11-21 22:02:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-21 22:02:08,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:02:08,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136124858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:08,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:02:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26 [2023-11-21 22:02:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28801859] [2023-11-21 22:02:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:08,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-21 22:02:08,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:08,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-21 22:02:08,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2023-11-21 22:02:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:08,652 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:08,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 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 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:02:08,652 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:02:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:02:12,708 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 2 remaining) [2023-11-21 22:02:12,709 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (0 of 2 remaining) [2023-11-21 22:02:12,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:02:12,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:12,939 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2023-11-21 22:02:12,941 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE,SAFE (1/2) [2023-11-21 22:02:12,944 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:02:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:12,945 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:02:12,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-11-21 22:02:12,948 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:02:12,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 22:02:12,949 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;@4fc15334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:12,949 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-21 22:02:12,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:02:12,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:12,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2038849046, now seen corresponding path program 1 times [2023-11-21 22:02:12,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:12,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913404575] [2023-11-21 22:02:12,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:12,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:12,968 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 22:02:12,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913404575] [2023-11-21 22:02:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913404575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:12,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983418913] [2023-11-21 22:02:12,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:12,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:02:12,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:12,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:02:12,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:02:12,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,971 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:12,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 22:02:12,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:02:12,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:02:12,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:12,973 INFO L85 PathProgramCache]: Analyzing trace with hash 526870455, now seen corresponding path program 1 times [2023-11-21 22:02:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050843619] [2023-11-21 22:02:12,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:12,984 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 22:02:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050843619] [2023-11-21 22:02:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050843619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:12,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:12,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171193146] [2023-11-21 22:02:12,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:12,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:02:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:12,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:02:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:02:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:12,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 22:02:12,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:12,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:02:12,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:02:12,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1200329891, now seen corresponding path program 1 times [2023-11-21 22:02:12,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815387061] [2023-11-21 22:02:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:13,098 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 22:02:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815387061] [2023-11-21 22:02:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815387061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:02:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240543125] [2023-11-21 22:02:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:13,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,100 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:13,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 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 22:02:13,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:13,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:13,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:13,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:02:13,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2023-11-21 22:02:13,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash -554430641, now seen corresponding path program 1 times [2023-11-21 22:02:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368058756] [2023-11-21 22:02:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:02:13,179 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:02:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:02:13,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:02:13,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-11-21 22:02:13,210 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-11-21 22:02:13,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:02:13,213 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-21 22:02:13,213 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 22:02:13,214 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:02:13,214 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:02:13,232 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:02:13,237 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:13,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:02:13,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:13,241 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:02:13,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-21 22:02:13,244 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:02:13,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 22:02:13,245 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;@4fc15334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:13,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 22:02:13,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:13,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2001204904, now seen corresponding path program 1 times [2023-11-21 22:02:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500965050] [2023-11-21 22:02:13,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:13,321 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 22:02:13,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:13,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500965050] [2023-11-21 22:02:13,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500965050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:13,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:13,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:13,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932790243] [2023-11-21 22:02:13,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:13,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:02:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:02:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:02:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,322 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:13,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 22:02:13,322 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 22:02:13,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:13,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 375178864, now seen corresponding path program 1 times [2023-11-21 22:02:13,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522338946] [2023-11-21 22:02:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:13,362 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 22:02:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522338946] [2023-11-21 22:02:13,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522338946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:13,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:13,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:13,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547435746] [2023-11-21 22:02:13,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:13,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:02:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:02:13,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:02:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,364 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:13,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.0) internal successors, (42), 3 states have internal predecessors, (42), 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 22:02:13,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,364 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:13,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:02:13,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:13,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2014709527, now seen corresponding path program 1 times [2023-11-21 22:02:13,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561419077] [2023-11-21 22:02:13,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:13,533 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 22:02:13,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:13,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561419077] [2023-11-21 22:02:13,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561419077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:13,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:13,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:02:13,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278011732] [2023-11-21 22:02:13,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,535 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:13,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:13,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:13,536 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:13,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 22:02:13,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:13,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash -6828174, now seen corresponding path program 1 times [2023-11-21 22:02:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:13,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023812976] [2023-11-21 22:02:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023812976] [2023-11-21 22:02:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023812976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:14,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:14,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-21 22:02:14,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573494768] [2023-11-21 22:02:14,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:14,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:02:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:02:14,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-21 22:02:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,030 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:14,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 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 22:02:14,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:14,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:14,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 22:02:14,321 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:14,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:14,322 INFO L85 PathProgramCache]: Analyzing trace with hash -219668289, now seen corresponding path program 1 times [2023-11-21 22:02:14,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:14,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42810873] [2023-11-21 22:02:14,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:14,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-21 22:02:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42810873] [2023-11-21 22:02:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42810873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:02:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783492414] [2023-11-21 22:02:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:14,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:14,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:14,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:14,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:14,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,579 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:14,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 22:02:14,579 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:14,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:14,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:14,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 22:02:14,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:14,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1774314505, now seen corresponding path program 1 times [2023-11-21 22:02:14,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:14,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515920743] [2023-11-21 22:02:14,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:15,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515920743] [2023-11-21 22:02:15,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515920743] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:15,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059877186] [2023-11-21 22:02:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:15,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:15,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:15,646 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:15,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-21 22:02:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:15,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:02:15,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:15,934 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 15 treesize of output 11 [2023-11-21 22:02:15,966 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 28 treesize of output 27 [2023-11-21 22:02:16,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:16,007 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 40 treesize of output 42 [2023-11-21 22:02:16,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:16,051 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 52 treesize of output 57 [2023-11-21 22:02:16,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,298 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 56 treesize of output 45 [2023-11-21 22:02:16,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,315 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 56 treesize of output 45 [2023-11-21 22:02:16,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,331 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 56 treesize of output 45 [2023-11-21 22:02:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,348 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 56 treesize of output 45 [2023-11-21 22:02:16,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,569 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 56 treesize of output 45 [2023-11-21 22:02:16,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,602 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 56 treesize of output 45 [2023-11-21 22:02:16,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:16,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,657 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 56 treesize of output 45 [2023-11-21 22:02:16,859 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:02:16,859 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 71 treesize of output 60 [2023-11-21 22:02:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:16,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:17,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) is different from false [2023-11-21 22:02:17,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1013) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))))))) is different from false [2023-11-21 22:02:17,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:17,901 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 50 treesize of output 66 [2023-11-21 22:02:17,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:17,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 34 [2023-11-21 22:02:17,911 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:02:17,911 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:02:17,916 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:02:17,916 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:02:17,921 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2023-11-21 22:02:17,921 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 4 case distinctions, treesize of input 51 treesize of output 1 [2023-11-21 22:02:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:02:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059877186] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:18,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:18,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 48 [2023-11-21 22:02:18,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243126643] [2023-11-21 22:02:18,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:18,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-21 22:02:18,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:18,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-21 22:02:18,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1809, Unknown=114, NotChecked=182, Total=2352 [2023-11-21 22:02:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:18,066 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:18,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 4.875) internal successors, (234), 49 states have internal predecessors, (234), 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 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:18,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:20,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:20,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-21 22:02:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:20,542 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:20,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 689955027, now seen corresponding path program 1 times [2023-11-21 22:02:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:20,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388549824] [2023-11-21 22:02:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388549824] [2023-11-21 22:02:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388549824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578756864] [2023-11-21 22:02:21,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:21,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:21,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-21 22:02:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:21,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-21 22:02:21,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:21,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:21,548 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:21,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:21,692 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:21,692 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 33 treesize of output 24 [2023-11-21 22:02:21,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:21,726 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 26 treesize of output 19 [2023-11-21 22:02:21,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:02:21,773 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 28 treesize of output 27 [2023-11-21 22:02:21,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:21,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:02:21,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:21,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:02:22,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,202 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:22,203 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 33 treesize of output 24 [2023-11-21 22:02:22,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:02:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:22,544 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 56 treesize of output 45 [2023-11-21 22:02:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:02:22,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:02:22,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578756864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:22,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-21 22:02:22,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 27 [2023-11-21 22:02:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488399132] [2023-11-21 22:02:22,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:22,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-21 22:02:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:22,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 22:02:22,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2023-11-21 22:02:22,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:22,553 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:22,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 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 22:02:22,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:22,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:22,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:22,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:22,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:22,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:22,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:02:26,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-21 22:02:27,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-11-21 22:02:27,015 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:27,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1967171129, now seen corresponding path program 1 times [2023-11-21 22:02:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415795133] [2023-11-21 22:02:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-21 22:02:27,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:27,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415795133] [2023-11-21 22:02:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415795133] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:27,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:02:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740920692] [2023-11-21 22:02:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:27,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:27,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:27,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:27,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:02:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:02:27,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:27,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-21 22:02:27,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash 170219770, now seen corresponding path program 1 times [2023-11-21 22:02:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502025672] [2023-11-21 22:02:27,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502025672] [2023-11-21 22:02:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502025672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109525350] [2023-11-21 22:02:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:28,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:28,947 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:28,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-21 22:02:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:29,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-21 22:02:29,127 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:29,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:29,214 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:29,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:29,382 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:29,383 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 33 treesize of output 24 [2023-11-21 22:02:29,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:29,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2023-11-21 22:02:29,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:02:29,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2023-11-21 22:02:29,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:29,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:02:29,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:29,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:02:30,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,215 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:30,215 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 33 treesize of output 24 [2023-11-21 22:02:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:02:30,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:30,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:30,602 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 56 treesize of output 45 [2023-11-21 22:02:30,614 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 56 treesize of output 45 [2023-11-21 22:02:30,638 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 56 treesize of output 45 [2023-11-21 22:02:30,652 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 56 treesize of output 45 [2023-11-21 22:02:30,834 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:02:30,834 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 71 treesize of output 60 [2023-11-21 22:02:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:30,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:31,024 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1384 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1384 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1384 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_1384 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))) is different from false [2023-11-21 22:02:31,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) is different from false [2023-11-21 22:02:31,125 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))))) is different from false [2023-11-21 22:02:31,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))) (forall ((v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) .cse0 v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))))) is different from false [2023-11-21 22:02:31,279 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))))) is different from false [2023-11-21 22:02:33,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int)) (or (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int)) (or (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int)) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int)) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))))) is different from false [2023-11-21 22:02:33,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0))))))) is different from false [2023-11-21 22:02:33,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0))) (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0))))))) is different from false [2023-11-21 22:02:33,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse2))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse3)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 22:02:33,534 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse4 (+ c_~datas~0.offset 2 .cse2)) (.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1))))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse3)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of2ForFork0_#t~nondet4|) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 22:02:33,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset .cse5 1)) (.cse4 (+ c_~datas~0.offset 2 .cse5)) (.cse2 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse2)))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse3)) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (= (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|) (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|))) (forall ((|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1384 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18|) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1380) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1384) c_~datas~0.base) (+ c_~datas~0.offset .cse5))))))))) is different from false [2023-11-21 22:02:33,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,598 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 61 treesize of output 77 [2023-11-21 22:02:33,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 190 [2023-11-21 22:02:33,622 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 41 treesize of output 27 [2023-11-21 22:02:33,626 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 27 treesize of output 20 [2023-11-21 22:02:33,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,653 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 4 case distinctions, treesize of input 60 treesize of output 76 [2023-11-21 22:02:33,656 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:33,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 48 [2023-11-21 22:02:33,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,674 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 4 case distinctions, treesize of input 61 treesize of output 77 [2023-11-21 22:02:33,676 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:33,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 49 [2023-11-21 22:02:33,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,694 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 4 case distinctions, treesize of input 61 treesize of output 77 [2023-11-21 22:02:33,696 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:33,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:33,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 49 [2023-11-21 22:02:33,798 WARN L854 $PredicateComparison]: unable to prove that (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1367 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1367))) (or (forall ((v_ArrVal_1376 (Array Int Int))) (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_18|)))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base)) (forall ((v_ArrVal_1367 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1367))) (or (not (= c_~datas~0.base (select (select (store .cse1 |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse1 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_18|))))) is different from false [2023-11-21 22:02:34,008 WARN L854 $PredicateComparison]: unable to prove that (and (<= (+ |c_threadThread1of2ForFork0_#in~arg.base| |c_threadThread1of2ForFork0_#in~arg.offset|) |c_ULTIMATE.start_main_~i~1#1|) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_~datas~0.base)) (forall ((v_ArrVal_1367 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem11#1.base_18| Int) (v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_1367))) (or (not (= c_~datas~0.base (select (select (store .cse0 |v_ULTIMATE.start_main_#t~mem11#1.base_18| v_ArrVal_1376) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (< (select (select .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |v_ULTIMATE.start_main_#t~mem11#1.base_18|))))) is different from false [2023-11-21 22:02:34,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 212 treesize of output 196 [2023-11-21 22:02:34,610 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 116 treesize of output 108 [2023-11-21 22:02:34,615 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 137 treesize of output 133 [2023-11-21 22:02:34,618 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 160 treesize of output 152 [2023-11-21 22:02:34,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:34,740 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 34 treesize of output 39 [2023-11-21 22:02:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2023-11-21 22:02:34,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109525350] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:34,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:34,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 27] total 71 [2023-11-21 22:02:34,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766956237] [2023-11-21 22:02:34,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:34,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-21 22:02:34,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-21 22:02:34,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3107, Unknown=39, NotChecked=1638, Total=5112 [2023-11-21 22:02:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:34,783 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:34,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.619718309859155) internal successors, (257), 72 states have internal predecessors, (257), 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 22:02:34,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:34,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:34,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:42,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-21 22:02:42,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-21 22:02:43,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:43,102 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:43,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1500858897, now seen corresponding path program 2 times [2023-11-21 22:02:43,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:43,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650944856] [2023-11-21 22:02:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:43,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:43,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:43,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650944856] [2023-11-21 22:02:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650944856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:43,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520901726] [2023-11-21 22:02:43,949 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:43,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:43,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:43,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:43,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-21 22:02:44,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:44,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:44,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-21 22:02:44,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:44,237 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 15 treesize of output 11 [2023-11-21 22:02:44,285 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 28 treesize of output 27 [2023-11-21 22:02:44,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:44,331 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 40 treesize of output 42 [2023-11-21 22:02:44,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,519 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 44 treesize of output 35 [2023-11-21 22:02:44,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:44,533 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 52 treesize of output 57 [2023-11-21 22:02:44,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,573 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 56 treesize of output 45 [2023-11-21 22:02:44,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,585 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 56 treesize of output 45 [2023-11-21 22:02:44,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,597 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 56 treesize of output 45 [2023-11-21 22:02:44,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,753 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 56 treesize of output 45 [2023-11-21 22:02:44,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,764 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 56 treesize of output 45 [2023-11-21 22:02:44,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,779 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 56 treesize of output 45 [2023-11-21 22:02:44,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:44,794 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 56 treesize of output 45 [2023-11-21 22:02:44,945 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:02:44,945 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 71 treesize of output 60 [2023-11-21 22:02:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:44,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:45,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))) is different from false [2023-11-21 22:02:45,299 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))))) is different from false [2023-11-21 22:02:45,347 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_1538 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:02:45,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:45,413 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:45,429 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:45,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse3))))))) is different from false [2023-11-21 22:02:45,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse4 1)) (.cse3 (+ c_~datas~0.offset 2 .cse4))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse4))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1530 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1530) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1538) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))))))) is different from false [2023-11-21 22:02:45,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:45,482 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:45,482 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-21 22:02:45,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:45,486 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:45,486 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:02:45,487 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:45,489 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:45,489 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:02:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2023-11-21 22:02:45,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520901726] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:45,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:45,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 49 [2023-11-21 22:02:45,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491182061] [2023-11-21 22:02:45,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:45,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:02:45,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:45,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:02:45,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1539, Unknown=8, NotChecked=696, Total=2450 [2023-11-21 22:02:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:45,644 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:45,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.775510204081633) internal successors, (234), 50 states have internal predecessors, (234), 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 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-11-21 22:02:45,645 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2023-11-21 22:02:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:48,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:02:48,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-21 22:02:48,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:48,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 239630322, now seen corresponding path program 2 times [2023-11-21 22:02:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852632543] [2023-11-21 22:02:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:50,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852632543] [2023-11-21 22:02:50,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852632543] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:50,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307785616] [2023-11-21 22:02:50,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:50,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:50,279 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:50,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-21 22:02:50,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:50,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:50,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-21 22:02:50,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:50,545 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:50,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:50,669 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:02:50,669 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 33 treesize of output 24 [2023-11-21 22:02:50,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:50,786 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 26 treesize of output 19 [2023-11-21 22:02:50,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-21 22:02:50,833 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 28 treesize of output 27 [2023-11-21 22:02:50,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:50,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:02:51,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-21 22:02:51,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:51,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-11-21 22:02:51,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-21 22:02:51,365 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-21 22:02:51,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-21 22:02:51,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:51,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2023-11-21 22:02:51,933 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 56 treesize of output 45 [2023-11-21 22:02:51,947 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 56 treesize of output 45 [2023-11-21 22:02:51,961 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 56 treesize of output 45 [2023-11-21 22:02:51,973 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 56 treesize of output 45 [2023-11-21 22:02:52,185 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:02:52,185 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 71 treesize of output 60 [2023-11-21 22:02:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:52,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:52,378 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1704 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))))) is different from false [2023-11-21 22:02:52,787 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) .cse0 v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) .cse0 v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) .cse0 v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) .cse0 v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:52,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:52,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse2))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))))))) is different from false [2023-11-21 22:02:52,859 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse0))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1))))))) is different from false [2023-11-21 22:02:52,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:52,924 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ c_~datas~0.offset 3 .cse2))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:52,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse0 (+ c_~datas~0.offset 3 .cse2))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse0)))))) is different from false [2023-11-21 22:02:53,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse4 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_~datas~0.offset 3 .cse3))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:02:53,022 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse4 (+ c_~datas~0.offset .cse5 1)) (.cse3 (+ c_~datas~0.offset 2 .cse5))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse1))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse3))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_1700 (Array Int Int)) (v_ArrVal_1696 (Array Int Int)) (v_ArrVal_1691 (Array Int Int)) (v_ArrVal_1704 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1691) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1700) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1696) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1704) c_~datas~0.base) (+ c_~datas~0.offset .cse5)))))))) is different from false [2023-11-21 22:02:53,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,031 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 143 treesize of output 153 [2023-11-21 22:02:53,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 131 [2023-11-21 22:02:53,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2023-11-21 22:02:53,040 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 79 treesize of output 67 [2023-11-21 22:02:53,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:53,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,054 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 3 case distinctions, treesize of input 85 treesize of output 95 [2023-11-21 22:02:53,056 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:53,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 53 [2023-11-21 22:02:53,061 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:53,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,066 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 3 case distinctions, treesize of input 85 treesize of output 95 [2023-11-21 22:02:53,067 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:53,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 53 [2023-11-21 22:02:53,071 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:53,574 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 5403 treesize of output 5059 [2023-11-21 22:02:53,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 746 treesize of output 722 [2023-11-21 22:02:53,638 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 722 treesize of output 696 [2023-11-21 22:02:53,647 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 696 treesize of output 642 [2023-11-21 22:02:53,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:53,763 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 34 treesize of output 39 [2023-11-21 22:02:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-21 22:02:53,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307785616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:53,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:53,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 28] total 73 [2023-11-21 22:02:53,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123083750] [2023-11-21 22:02:53,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:53,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-21 22:02:53,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-21 22:02:53,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=3614, Unknown=82, NotChecked=1330, Total=5402 [2023-11-21 22:02:53,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:53,800 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:53,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.5205479452054793) internal successors, (257), 74 states have internal predecessors, (257), 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 22:02:53,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:53,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:02:53,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:53,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:53,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-21 22:03:00,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-21 22:03:00,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:00,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash 152810885, now seen corresponding path program 2 times [2023-11-21 22:03:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489930192] [2023-11-21 22:03:00,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:00,630 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-21 22:03:00,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489930192] [2023-11-21 22:03:00,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489930192] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:00,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143110645] [2023-11-21 22:03:00,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:03:00,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:00,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:00,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:00,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-21 22:03:00,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 22:03:00,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:03:00,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-21 22:03:00,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:00,913 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 22:03:00,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:00,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:03:00,944 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 22:03:00,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:00,963 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 26 treesize of output 28 [2023-11-21 22:03:00,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:00,986 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 22:03:01,010 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-21 22:03:01,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:01,026 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1836 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_1836) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) is different from false [2023-11-21 22:03:01,030 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:01,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-21 22:03:01,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-21 22:03:01,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-21 22:03:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-21 22:03:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143110645] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:01,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2023-11-21 22:03:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115205331] [2023-11-21 22:03:01,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:01,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-21 22:03:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:01,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-21 22:03:01,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=308, Unknown=1, NotChecked=36, Total=420 [2023-11-21 22:03:01,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,103 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:01,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 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 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-21 22:03:01,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:01,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-21 22:03:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:03:01,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:01,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-21 22:03:01,651 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:01,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:01,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1050452145, now seen corresponding path program 3 times [2023-11-21 22:03:01,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:01,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418629374] [2023-11-21 22:03:01,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:01,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:02,519 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:02,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418629374] [2023-11-21 22:03:02,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418629374] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:02,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076154083] [2023-11-21 22:03:02,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:03:02,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:02,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:02,521 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:02,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-21 22:03:02,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-21 22:03:02,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:03:02,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-21 22:03:02,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:03,045 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 22:03:03,073 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 22:03:03,106 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 22:03:03,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,264 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 22:03:03,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,275 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 22:03:03,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,283 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 22:03:03,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,295 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 22:03:03,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,447 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 22:03:03,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:03:03,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,512 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 22:03:03,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,527 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 22:03:03,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,550 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 22:03:03,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:03,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:03,721 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 48 treesize of output 41 [2023-11-21 22:03:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:03,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:03,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1992 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)))) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))))) is different from false [2023-11-21 22:03:03,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)))))))) is different from false [2023-11-21 22:03:03,945 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) (+ |c_threadThread2of2ForFork0_#in~arg.base| |c_threadThread2of2ForFork0_#in~arg.offset|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1))))))) is different from false [2023-11-21 22:03:04,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1))))))) is different from false [2023-11-21 22:03:04,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1))))))) is different from false [2023-11-21 22:03:04,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse1))))))) is different from false [2023-11-21 22:03:04,202 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse3 (+ c_~datas~0.offset 2 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse2))) (and (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse3))))))) is different from false [2023-11-21 22:03:04,213 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse3 1)) (.cse4 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse3))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1992 (Array Int Int))) (= (select (select (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1988) c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1992) c_~datas~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:03:04,218 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:04,222 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:04,222 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 3 case distinctions, treesize of input 42 treesize of output 1 [2023-11-21 22:03:04,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:04,225 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:04,225 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:03:04,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:03:04,228 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:04,228 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:03:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2023-11-21 22:03:04,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076154083] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:04,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:04,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2023-11-21 22:03:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592392681] [2023-11-21 22:03:04,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 22:03:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:04,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 22:03:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1690, Unknown=8, NotChecked=728, Total=2652 [2023-11-21 22:03:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:04,335 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:04,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 4.607843137254902) internal successors, (235), 52 states have internal predecessors, (235), 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 22:03:04,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:04,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:03:04,336 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:07,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:03:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:07,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-21 22:03:07,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:07,276 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE, threadErr1ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:03:07,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:03:07,276 INFO L85 PathProgramCache]: Analyzing trace with hash -873982546, now seen corresponding path program 1 times [2023-11-21 22:03:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:03:07,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498475491] [2023-11-21 22:03:07,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:07,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:03:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:08,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:03:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498475491] [2023-11-21 22:03:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498475491] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:03:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079899939] [2023-11-21 22:03:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:03:08,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:03:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:03:08,267 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:03:08,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-21 22:03:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:03:08,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-21 22:03:08,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:03:08,560 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 15 treesize of output 11 [2023-11-21 22:03:08,582 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 28 treesize of output 27 [2023-11-21 22:03:08,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:08,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-11-21 22:03:08,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,750 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 44 treesize of output 35 [2023-11-21 22:03:08,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,760 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 44 treesize of output 35 [2023-11-21 22:03:08,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,770 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 44 treesize of output 35 [2023-11-21 22:03:08,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,782 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 44 treesize of output 35 [2023-11-21 22:03:08,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,911 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 44 treesize of output 35 [2023-11-21 22:03:08,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-21 22:03:08,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,932 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 44 treesize of output 35 [2023-11-21 22:03:08,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:03:08,943 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 44 treesize of output 35 [2023-11-21 22:03:09,112 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-21 22:03:09,112 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 59 treesize of output 45 [2023-11-21 22:03:09,130 INFO L349 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2023-11-21 22:03:09,131 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 61 treesize of output 45 [2023-11-21 22:03:09,149 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-21 22:03:09,151 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 52 treesize of output 57 [2023-11-21 22:03:09,197 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:03:09,197 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 6 case distinctions, treesize of input 61 treesize of output 69 [2023-11-21 22:03:43,348 INFO L349 Elim1Store]: treesize reduction 30, result has 28.6 percent of original size [2023-11-21 22:03:43,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 73 treesize of output 84 [2023-11-21 22:03:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:03:45,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:03:51,878 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (<= (+ c_threadThread1of2ForFork0_~i~0 1) |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_2157 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:03:51,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_#t~post9#1|) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_2157 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:03:51,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4 c_threadThread1of2ForFork0_~i~0))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)))) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse0)))) (forall ((v_ArrVal_2157 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:03:51,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse1 (+ c_~datas~0.offset 2 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_2157 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse2)))) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)))))))) is different from false [2023-11-21 22:03:52,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4 c_threadThread1of2ForFork0_~i~0))) (let ((.cse2 (+ c_~datas~0.offset .cse3 1)) (.cse1 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (<= c_threadThread1of2ForFork0_~i~0 |c_ULTIMATE.start_main_~i~1#1|) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) .cse1))) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) .cse2))) (forall ((v_ArrVal_2157 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2157) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))))))) is different from false [2023-11-21 22:03:52,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:52,015 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 42 treesize of output 53 [2023-11-21 22:03:52,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:03:52,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 30 [2023-11-21 22:03:52,024 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:52,024 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:03:52,028 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:03:52,029 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 3 case distinctions, treesize of input 43 treesize of output 1 [2023-11-21 22:03:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 8 times theorem prover too weak. 0 trivial. 28 not checked. [2023-11-21 22:03:52,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079899939] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:03:52,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:03:52,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 49 [2023-11-21 22:03:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579449693] [2023-11-21 22:03:52,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:03:52,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:03:52,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:03:52,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:03:52,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1748, Unknown=44, NotChecked=450, Total=2450 [2023-11-21 22:03:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:52,194 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:03:52,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.938775510204081) internal successors, (242), 50 states have internal predecessors, (242), 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 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2023-11-21 22:03:52,195 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:03:54,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:03:57,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:03:59,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:01,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:08,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:09,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:11,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:13,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:15,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:16,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:18,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:19,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:21,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:25,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:26,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:31,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:33,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:37,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:38,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:44,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:45,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:49,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:52,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:54,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:56,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:57,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:04:59,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:01,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:03,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:05,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:07,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:09,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:11,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:13,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:15,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:17,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:19,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:21,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:23,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:25,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:27,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:32,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:34,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:36,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:39,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-21 22:05:41,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15