./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.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-struct-tid.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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:05:47,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:05:47,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:05:47,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:05:47,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:05:47,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:05:47,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:05:47,984 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:05:47,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:05:47,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:05:47,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:05:47,989 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:05:47,990 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:05:47,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:05:47,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:05:47,992 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:05:47,992 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:05:47,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:05:47,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:05:47,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:05:47,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:05:47,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:05:47,994 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:05:47,994 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:05:47,994 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:05:47,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:05:47,995 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:05:47,995 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:05:47,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:05:47,996 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:05:47,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:05:47,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:05:47,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:05:47,998 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:05:47,998 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:05:47,998 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:05:47,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:05:47,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:05:47,999 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:05:47,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:05:47,999 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:05:48,000 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:05:48,001 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:05:48,001 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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2023-11-21 22:05:48,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:05:48,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:05:48,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:05:48,295 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:05:48,296 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:05:48,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i [2023-11-21 22:05:49,436 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:05:49,767 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:05:49,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-tid.i [2023-11-21 22:05:49,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c99330a10/b140773735eb482dbee3674559226c61/FLAGbf77434f1 [2023-11-21 22:05:49,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c99330a10/b140773735eb482dbee3674559226c61 [2023-11-21 22:05:49,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:05:49,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:05:49,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:05:49,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:05:49,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:05:49,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:49" (1/1) ... [2023-11-21 22:05:49,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@263c4c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:49, skipping insertion in model container [2023-11-21 22:05:49,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:05:49" (1/1) ... [2023-11-21 22:05:49,871 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:05:50,040 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:05:50,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:05:50,293 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:05:50,304 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:05:50,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:05:50,373 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:05:50,380 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:05:50,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50 WrapperNode [2023-11-21 22:05:50,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:05:50,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:05:50,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:05:50,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:05:50,388 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:05:50" (1/1) ... [2023-11-21 22:05:50,409 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:05:50" (1/1) ... [2023-11-21 22:05:50,434 INFO L138 Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2023-11-21 22:05:50,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:05:50,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:05:50,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:05:50,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:05:50,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:05:50,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:05:50,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:05:50,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:05:50,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (1/1) ... [2023-11-21 22:05:50,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:05:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:50,514 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:05:50,517 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:05:50,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:05:50,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:05:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:05:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:05:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:05:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 22:05:50,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:05:50,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:05:50,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:05:50,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:05:50,560 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:05:50,665 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:05:50,667 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:05:51,004 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:05:51,014 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:05:51,020 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:05:51,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:51 BoogieIcfgContainer [2023-11-21 22:05:51,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:05:51,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:05:51,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:05:51,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:05:51,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:05:49" (1/3) ... [2023-11-21 22:05:51,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4926758c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:51, skipping insertion in model container [2023-11-21 22:05:51,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:05:50" (2/3) ... [2023-11-21 22:05:51,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4926758c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:05:51, skipping insertion in model container [2023-11-21 22:05:51,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:05:51" (3/3) ... [2023-11-21 22:05:51,030 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2023-11-21 22:05:51,036 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:05:51,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:05:51,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-11-21 22:05:51,043 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:05:51,096 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:05:51,132 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:05:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:05:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:51,134 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:05:51,135 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:05:51,174 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:05:51,187 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:05:51,198 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;@3b01ad65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:05:51,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:05:51,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:51,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash -752109601, now seen corresponding path program 1 times [2023-11-21 22:05:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559865650] [2023-11-21 22:05:51,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:51,732 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:05:51,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559865650] [2023-11-21 22:05:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559865650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:05:51,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954169178] [2023-11-21 22:05:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:51,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:05:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:51,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:05:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:05:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:51,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:51,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:05:51,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:51,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:05:51,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:51,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash 123090180, now seen corresponding path program 1 times [2023-11-21 22:05:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:51,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190228664] [2023-11-21 22:05:51,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:52,469 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:05:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190228664] [2023-11-21 22:05:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190228664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:05:52,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:05:52,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:05:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655241766] [2023-11-21 22:05:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:05:52,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:05:52,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:52,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:05:52,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:05:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:52,478 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:52,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:05:52,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:52,478 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:52,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:52,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:05:52,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:52,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1173503134, now seen corresponding path program 1 times [2023-11-21 22:05:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:52,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134356317] [2023-11-21 22:05:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:52,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:53,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134356317] [2023-11-21 22:05:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134356317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568372119] [2023-11-21 22:05:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:53,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:53,449 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:05:53,450 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:05:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:53,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-21 22:05:53,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:53,621 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:05:53,666 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:05:53,667 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 11 treesize of output 11 [2023-11-21 22:05:53,701 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 13 treesize of output 9 [2023-11-21 22:05:53,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-21 22:05:53,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:53,727 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 32 treesize of output 34 [2023-11-21 22:05:53,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:53,750 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 41 treesize of output 46 [2023-11-21 22:05:53,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 45 treesize of output 34 [2023-11-21 22:05:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:05:53,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:53,966 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_179 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:54,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:54,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:54,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_179 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_179 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_179 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_179) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:54,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:54,145 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 37 treesize of output 53 [2023-11-21 22:05:54,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:54,154 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 70 treesize of output 28 [2023-11-21 22:05:54,165 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:05:54,166 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 37 treesize of output 1 [2023-11-21 22:05:54,172 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:05:54,173 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 37 treesize of output 1 [2023-11-21 22:05:54,178 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:05:54,178 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 37 treesize of output 1 [2023-11-21 22:05:54,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-11-21 22:05:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568372119] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:54,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2023-11-21 22:05:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979792022] [2023-11-21 22:05:54,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:54,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 22:05:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:05:54,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2023-11-21 22:05:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:54,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:54,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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:05:54,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:54,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:54,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:54,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:54,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:05:54,978 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:05:55,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-21 22:05:55,174 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:55,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1684441920, now seen corresponding path program 1 times [2023-11-21 22:05:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785116249] [2023-11-21 22:05:55,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:55,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:57,170 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:05:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785116249] [2023-11-21 22:05:57,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785116249] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:57,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867084690] [2023-11-21 22:05:57,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:57,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:57,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:57,175 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:05:57,182 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:05:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:57,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-21 22:05:57,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:57,318 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:05:57,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:05:57,420 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 11 treesize of output 11 [2023-11-21 22:05:57,479 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 1 [2023-11-21 22:05:57,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:57,571 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:05:57,576 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:05:57,715 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:05:57,716 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 16 treesize of output 15 [2023-11-21 22:05:57,724 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:05:57,736 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:05:57,737 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 24 treesize of output 17 [2023-11-21 22:05:57,775 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 13 treesize of output 9 [2023-11-21 22:05:57,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-21 22:05:57,861 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 32 treesize of output 34 [2023-11-21 22:05:57,922 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 41 treesize of output 46 [2023-11-21 22:05:58,220 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:05:58,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-21 22:05:58,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 45 treesize of output 34 [2023-11-21 22:05:58,320 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 45 treesize of output 34 [2023-11-21 22:05:58,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:05:58,368 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 45 treesize of output 34 [2023-11-21 22:05:58,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:58,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:58,458 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 56 [2023-11-21 22:05:58,516 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:05:58,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:58,655 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:58,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|)))))) is different from false [2023-11-21 22:05:58,831 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:05:59,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 22:05:59,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse7 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))))) is different from false [2023-11-21 22:05:59,139 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse8 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_12|) (forall ((v_ArrVal_292 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_292))) (store .cse9 .cse2 (store (select .cse9 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_12| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))))) is different from false [2023-11-21 22:05:59,166 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:59,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 72 [2023-11-21 22:05:59,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:59,181 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 290 treesize of output 258 [2023-11-21 22:05:59,193 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 205 treesize of output 189 [2023-11-21 22:05:59,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:59,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 87 [2023-11-21 22:05:59,336 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:05:59,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 1 [2023-11-21 22:05:59,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:59,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 72 [2023-11-21 22:05:59,355 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:59,364 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:05:59,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 144 [2023-11-21 22:05:59,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-21 22:05:59,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 86 [2023-11-21 22:05:59,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:59,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 72 [2023-11-21 22:05:59,420 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:59,429 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-21 22:05:59,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 144 [2023-11-21 22:05:59,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-21 22:05:59,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 86 [2023-11-21 22:05:59,836 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 37 treesize of output 35 [2023-11-21 22:05:59,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-11-21 22:05:59,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-21 22:05:59,861 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 15 treesize of output 13 [2023-11-21 22:05:59,986 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:05:59,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867084690] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:59,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:59,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2023-11-21 22:05:59,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271395627] [2023-11-21 22:05:59,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:59,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 22:05:59,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:59,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 22:05:59,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1871, Unknown=6, NotChecked=558, Total=2652 [2023-11-21 22:05:59,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:59,992 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:59,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.0588235294117645) internal successors, (156), 52 states have internal predecessors, (156), 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:05:59,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:59,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:59,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:05:59,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:02,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-21 22:06:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:06:02,808 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:06:02,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:02,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:02,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash -374674482, now seen corresponding path program 2 times [2023-11-21 22:06:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625331825] [2023-11-21 22:06:02,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:04,782 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:06:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625331825] [2023-11-21 22:06:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625331825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933941013] [2023-11-21 22:06:04,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:06:04,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:04,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:04,789 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:06:04,812 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:06:04,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:06:04,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:04,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-21 22:06:04,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:04,921 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:06:05,005 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:05,006 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 11 treesize of output 11 [2023-11-21 22:06:05,068 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 1 [2023-11-21 22:06:05,071 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:06:05,176 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:06:05,184 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:06:05,310 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:06:05,316 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:06:05,334 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 13 treesize of output 9 [2023-11-21 22:06:05,379 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 23 treesize of output 22 [2023-11-21 22:06:05,429 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 32 treesize of output 34 [2023-11-21 22:06:05,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:05,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:05,736 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 36 treesize of output 27 [2023-11-21 22:06:05,751 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 41 treesize of output 46 [2023-11-21 22:06:05,816 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 45 treesize of output 34 [2023-11-21 22:06:05,839 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 45 treesize of output 34 [2023-11-21 22:06:05,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:06:05,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:05,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:05,950 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 56 [2023-11-21 22:06:06,011 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:06:06,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:12,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_406 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:06:12,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:06:12,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse7))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2))) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse6 .cse1 (store (select .cse6 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse3 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|)))))) is different from false [2023-11-21 22:06:14,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))))))) is different from false [2023-11-21 22:06:15,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|)))))) is different from false [2023-11-21 22:06:15,369 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse6 .cse2 (store (select .cse6 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_13| Int)) (or (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_402) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_406))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_13| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_13|)))))) is different from false [2023-11-21 22:06:15,429 INFO L349 Elim1Store]: treesize reduction 33, result has 61.6 percent of original size [2023-11-21 22:06:15,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 1682 treesize of output 1286 [2023-11-21 22:06:15,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:15,453 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 386 treesize of output 352 [2023-11-21 22:06:15,469 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 108 treesize of output 104 [2023-11-21 22:06:15,485 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 221 treesize of output 205 [2023-11-21 22:06:15,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:15,744 INFO L349 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2023-11-21 22:06:15,744 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 678 treesize of output 491 [2023-11-21 22:06:15,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2023-11-21 22:06:15,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:15,776 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 184 treesize of output 158 [2023-11-21 22:06:15,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:15,817 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2023-11-21 22:06:15,817 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 414 treesize of output 1 [2023-11-21 22:06:15,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:15,834 INFO L349 Elim1Store]: treesize reduction 85, result has 1.2 percent of original size [2023-11-21 22:06:15,834 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 678 treesize of output 1 [2023-11-21 22:06:16,245 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 37 treesize of output 35 [2023-11-21 22:06:16,248 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 35 treesize of output 33 [2023-11-21 22:06:16,252 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 40 treesize of output 38 [2023-11-21 22:06:16,256 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 15 treesize of output 13 [2023-11-21 22:06:16,478 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:06:16,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933941013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:16,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:16,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 54 [2023-11-21 22:06:16,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521760802] [2023-11-21 22:06:16,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:16,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-21 22:06:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:16,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-21 22:06:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2152, Unknown=18, NotChecked=594, Total=2970 [2023-11-21 22:06:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:16,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.925925925925926) internal successors, (158), 55 states have internal predecessors, (158), 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:06:16,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:16,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:16,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-11-21 22:06:16,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:06:16,483 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:06:20,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:06:20,218 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:06:20,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:20,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:20,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1322926626, now seen corresponding path program 3 times [2023-11-21 22:06:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278788484] [2023-11-21 22:06:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:21,960 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:06:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278788484] [2023-11-21 22:06:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278788484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:21,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369459904] [2023-11-21 22:06:21,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:06:21,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:21,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:21,962 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:06:21,968 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:06:22,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:06:22,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:22,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-21 22:06:22,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:22,111 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:06:22,136 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:22,137 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 11 treesize of output 11 [2023-11-21 22:06:22,163 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:06:22,170 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 1 [2023-11-21 22:06:22,304 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:06:22,311 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:06:22,462 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:06:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:06:22,503 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:06:22,557 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:06:22,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:22,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:22,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-21 22:06:22,892 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:06:22,958 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:06:23,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2023-11-21 22:06:23,070 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 40 treesize of output 48 [2023-11-21 22:06:23,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 51 [2023-11-21 22:06:23,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:23,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:23,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:23,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:23,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2023-11-21 22:06:23,354 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:06:23,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:25,230 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse17)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse17)) (.cse5 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse17)) (.cse6 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse7 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse0 (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse1 (store (store (select .cse2 c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse2 c_threadThread1of1ForFork0_~t~0.base .cse1) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 v_ArrVal_518) .cse4 0) .cse5 v_ArrVal_521)))))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse8 (let ((.cse10 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse9 (store (store (select .cse10 c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse10 c_threadThread1of1ForFork0_~t~0.base .cse9) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 v_ArrVal_518) .cse4 0) .cse5 v_ArrVal_521)))))) (store .cse8 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse8 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse11 (let ((.cse13 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse12 (store (store (select .cse13 c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse13 c_threadThread1of1ForFork0_~t~0.base .cse12) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 v_ArrVal_518) .cse4 0) .cse5 v_ArrVal_521)))))) (store .cse11 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse11 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse14 (let ((.cse16 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse15 (store (store (select .cse16 c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse16 c_threadThread1of1ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 v_ArrVal_518) .cse4 0) .cse5 v_ArrVal_521)))))) (store .cse14 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse14 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:06:25,362 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse19 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse20))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse19)) (.cse5 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse20)) (.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse20)) (.cse7 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse20)) (.cse8 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse9 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse19))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse3 (store (store (select .cse4 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse4 c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse10 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse11 (store (store (select .cse12 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse12 c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse10 .cse2 (store (select .cse10 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse13 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse14 (store (store (select .cse15 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse14) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse15 c_threadThread1of1ForFork0_~t~0.base .cse14) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse13 .cse2 (store (select .cse13 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse16 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse17 (store (store (select .cse18 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse18 c_threadThread1of1ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse16 .cse2 (store (select .cse16 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))))))) is different from false [2023-11-21 22:06:25,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse7 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse9 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse8 (+ 6 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse1 (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse3 (store (store (select .cse4 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse4 c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse10 (let ((.cse12 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse11 (store (store (select .cse12 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse12 c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse10 .cse2 (store (select .cse10 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse13 (let ((.cse15 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse14 (store (store (select .cse15 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse14) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse15 c_threadThread1of1ForFork0_~t~0.base .cse14) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse13 .cse2 (store (select .cse13 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse16 (let ((.cse18 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515))) (let ((.cse17 (store (store (select .cse18 c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store .cse18 c_threadThread1of1ForFork0_~t~0.base .cse17) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 v_ArrVal_518) .cse6 0) .cse7 v_ArrVal_521)))))) (store .cse16 .cse2 (store (select .cse16 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8))))))) is different from false [2023-11-21 22:06:26,049 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (+ 5 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse5 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse7 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse16 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse8 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse9 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse1 (let ((.cse3 (store (store (select (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base .cse3) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 v_ArrVal_518) .cse5 0) .cse6 v_ArrVal_521))))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse10 (let ((.cse11 (store (store (select (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base .cse11) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 v_ArrVal_518) .cse5 0) .cse6 v_ArrVal_521))))) (store .cse10 .cse2 (store (select .cse10 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse9))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= (select (select (let ((.cse12 (let ((.cse13 (store (store (select (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base .cse13) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 v_ArrVal_518) .cse5 0) .cse6 v_ArrVal_521))))) (store .cse12 .cse2 (store (select .cse12 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_14|) (forall ((v_ArrVal_521 Int) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_518 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse14 (let ((.cse15 (store (store (select (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_515) c_threadThread1of1ForFork0_~t~0.base .cse15) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 v_ArrVal_518) .cse5 0) .cse6 v_ArrVal_521))))) (store .cse14 .cse2 (store (select .cse14 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_14| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse16)))))))) is different from false [2023-11-21 22:06:26,151 INFO L349 Elim1Store]: treesize reduction 28, result has 63.2 percent of original size [2023-11-21 22:06:26,151 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 2094 treesize of output 1664 [2023-11-21 22:06:26,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:26,183 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 766 treesize of output 682 [2023-11-21 22:06:26,209 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 46396 treesize of output 45816 [2023-11-21 22:06:26,627 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:26,635 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-21 22:06:26,635 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 228 treesize of output 1 [2023-11-21 22:06:26,643 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:26,651 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-21 22:06:26,651 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 228 treesize of output 1 [2023-11-21 22:06:26,655 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:26,663 INFO L349 Elim1Store]: treesize reduction 75, result has 1.3 percent of original size [2023-11-21 22:06:26,663 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 340 treesize of output 1 [2023-11-21 22:06:27,103 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 37 treesize of output 35 [2023-11-21 22:06:27,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2023-11-21 22:06:27,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-21 22:06:27,115 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 15 treesize of output 13 [2023-11-21 22:06:27,467 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:06:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369459904] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:27,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:27,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 52 [2023-11-21 22:06:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474510773] [2023-11-21 22:06:27,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:27,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-21 22:06:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-21 22:06:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2142, Unknown=4, NotChecked=388, Total=2756 [2023-11-21 22:06:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:27,470 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:27,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.8846153846153846) internal successors, (150), 53 states have internal predecessors, (150), 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:06:27,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:27,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:27,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:06:27,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-11-21 22:06:27,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:06:27,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:33,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:06:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:06:33,047 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:06:33,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-21 22:06:33,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:33,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:33,237 INFO L85 PathProgramCache]: Analyzing trace with hash -246107600, now seen corresponding path program 4 times [2023-11-21 22:06:33,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:33,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720829893] [2023-11-21 22:06:33,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:34,700 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:06:34,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720829893] [2023-11-21 22:06:34,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720829893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:34,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518698142] [2023-11-21 22:06:34,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:06:34,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:34,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:34,704 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:06:34,712 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:06:34,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:06:34,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:34,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-21 22:06:34,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:34,955 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:06:35,032 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:35,032 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 11 treesize of output 11 [2023-11-21 22:06:35,050 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 1 [2023-11-21 22:06:35,059 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:06:35,167 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:06:35,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:06:35,293 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:06:35,309 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:06:35,331 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:06:35,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:35,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:35,543 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:06:35,556 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:06:35,628 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:06:35,703 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:06:35,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 37 treesize of output 26 [2023-11-21 22:06:35,795 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:06:35,819 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:06:35,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:06:35,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 58 [2023-11-21 22:06:35,979 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:06:35,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:36,148 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse1) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse1) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse1) 0)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset))))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse1) 0)))))) is different from false [2023-11-21 22:06:36,241 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse3) 0)) (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:06:36,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse7 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse2) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse2) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse2) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse2) 0)) (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:06:36,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse8 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse8 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (= (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse3) 0)))) (forall ((v_ArrVal_637 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse3) 0)) (= (select (select (let ((.cse7 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse7 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse8) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false [2023-11-21 22:06:36,370 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (and (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse1 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse0) 0)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3)) (not (= (select v_ArrVal_637 .cse0) 0)))) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse0) 0)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse7 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:06:36,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse11 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse10))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse11)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse11)) (.cse4 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse10))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse6) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse6) 0)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse7 .cse2 (store (select .cse7 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse8 .cse2 (store (select .cse8 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse6) 0)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse9 .cse2 (store (select .cse9 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse6) 0)))))))))) is different from false [2023-11-21 22:06:36,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse4 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse6 (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse1) 0)) (= (select (select (let ((.cse2 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (not (= (select v_ArrVal_637 .cse1) 0)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse7 .cse3 (store (select .cse7 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse8 .cse3 (store (select .cse8 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse1) 0)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_15| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_15|) (forall ((v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int))) (or (= (select (select (let ((.cse9 (store (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_630) c_threadThread1of1ForFork0_~t~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_637))) (store .cse9 .cse3 (store (select .cse9 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_15| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|) (not (= (select v_ArrVal_637 .cse1) 0)))))))) is different from false [2023-11-21 22:06:37,039 INFO L349 Elim1Store]: treesize reduction 23, result has 65.2 percent of original size [2023-11-21 22:06:37,039 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 1142 treesize of output 1120 [2023-11-21 22:06:37,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:37,059 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 398 treesize of output 356 [2023-11-21 22:06:37,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:37,085 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 233 treesize of output 223 [2023-11-21 22:06:37,279 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:37,299 INFO L349 Elim1Store]: treesize reduction 50, result has 24.2 percent of original size [2023-11-21 22:06:37,300 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 598 treesize of output 501 [2023-11-21 22:06:37,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:37,309 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 136 treesize of output 120 [2023-11-21 22:06:37,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:37,323 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 57 treesize of output 59 [2023-11-21 22:06:37,352 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:37,358 INFO L349 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2023-11-21 22:06:37,358 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 414 treesize of output 1 [2023-11-21 22:06:37,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:37,368 INFO L349 Elim1Store]: treesize reduction 65, result has 1.5 percent of original size [2023-11-21 22:06:37,368 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 414 treesize of output 1 [2023-11-21 22:06:37,674 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 37 treesize of output 35 [2023-11-21 22:06:37,677 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 35 treesize of output 33 [2023-11-21 22:06:37,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-21 22:06:37,685 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 15 treesize of output 13 [2023-11-21 22:06:37,878 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:06:37,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518698142] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:37,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:37,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 20] total 53 [2023-11-21 22:06:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853963691] [2023-11-21 22:06:37,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:37,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-21 22:06:37,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:37,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-21 22:06:37,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1984, Unknown=7, NotChecked=672, Total=2862 [2023-11-21 22:06:37,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:37,881 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:37,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.943396226415094) internal successors, (156), 54 states have internal predecessors, (156), 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:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:06:37,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:41,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:06:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:06:41,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-21 22:06:41,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:41,858 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:41,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1465561092, now seen corresponding path program 5 times [2023-11-21 22:06:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986726581] [2023-11-21 22:06:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:41,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:43,380 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:06:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:43,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986726581] [2023-11-21 22:06:43,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986726581] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:43,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341683107] [2023-11-21 22:06:43,381 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:06:43,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:43,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:43,384 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:06:43,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 22:06:43,512 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:06:43,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:06:43,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-21 22:06:43,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:43,524 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:06:43,613 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:43,613 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 11 treesize of output 11 [2023-11-21 22:06:43,636 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:06:43,640 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:06:43,742 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:06:43,749 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:06:43,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:06:43,847 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:06:43,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:06:43,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:06:43,972 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:06:44,009 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:06:44,051 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:06:44,103 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:06:44,156 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:06:44,177 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:06:44,199 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:06:44,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:44,273 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 40 treesize of output 48 [2023-11-21 22:06:44,312 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:06:44,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:46,567 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset))))))) is different from false [2023-11-21 22:06:46,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse3 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5))) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:06:46,609 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse5 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse3 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse1 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse7 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_750 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store .cse1 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_750))) (store .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select .cse6 |c_ULTIMATE.start_main_#t~mem13#1.base|) |c_ULTIMATE.start_main_#t~mem13#1.offset| 0))) c_threadThread1of1ForFork0_~t~0.base) .cse7)))))) is different from false [2023-11-21 22:06:46,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,623 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 73 treesize of output 64 [2023-11-21 22:06:46,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,631 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 242 treesize of output 214 [2023-11-21 22:06:46,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 173 treesize of output 157 [2023-11-21 22:06:46,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 61 [2023-11-21 22:06:46,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2023-11-21 22:06:46,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:46,739 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:46,740 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 142 treesize of output 120 [2023-11-21 22:06:46,746 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 40 treesize of output 36 [2023-11-21 22:06:46,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2023-11-21 22:06:46,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2023-11-21 22:06:46,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:46,791 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:46,791 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 142 treesize of output 120 [2023-11-21 22:06:46,798 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 40 treesize of output 36 [2023-11-21 22:06:46,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2023-11-21 22:06:46,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:46,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 64 [2023-11-21 22:06:46,829 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:06:46,837 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:46,838 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 142 treesize of output 120 [2023-11-21 22:06:46,844 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 40 treesize of output 36 [2023-11-21 22:06:46,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 70 [2023-11-21 22:06:47,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-11-21 22:06:47,785 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 12 treesize of output 10 [2023-11-21 22:06:47,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-11-21 22:06:47,790 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 15 treesize of output 13 [2023-11-21 22:06:47,977 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:06:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341683107] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:06:47,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:06:47,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2023-11-21 22:06:47,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046724408] [2023-11-21 22:06:47,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:06:47,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-21 22:06:47,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:47,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-21 22:06:47,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1969, Unknown=23, NotChecked=276, Total=2450 [2023-11-21 22:06:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:47,981 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:47,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 3.061224489795918) internal successors, (150), 50 states have internal predecessors, (150), 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:06:47,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:47,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:06:47,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-21 22:06:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-21 22:06:54,878 INFO L805 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 1 remaining) [2023-11-21 22:06:54,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-21 22:06:55,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-21 22:06:55,096 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-11-21 22:06:55,098 INFO L307 ceAbstractionStarter]: Result for error location threadThread1of1ForFork0 was SAFE (1/2) [2023-11-21 22:06:55,101 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:06:55,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:55,102 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:06:55,103 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:06:55,106 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:06:55,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 22:06:55,106 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;@3b01ad65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:55,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-21 22:06:55,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 22:06:55,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1012862309, now seen corresponding path program 1 times [2023-11-21 22:06:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093421705] [2023-11-21 22:06:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:55,134 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:06:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093421705] [2023-11-21 22:06:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093421705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:55,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:55,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693602492] [2023-11-21 22:06:55,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:55,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:06:55,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:55,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:06:55,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:06:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:55,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:06:55,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:06:55,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 22:06:55,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash -320054848, now seen corresponding path program 1 times [2023-11-21 22:06:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298037784] [2023-11-21 22:06:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:55,272 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:06:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298037784] [2023-11-21 22:06:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298037784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:06:55,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305439714] [2023-11-21 22:06:55,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:55,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:55,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,279 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:55,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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:06:55,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:55,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:06:55,369 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 2 more)] === [2023-11-21 22:06:55,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash 122711626, now seen corresponding path program 1 times [2023-11-21 22:06:55,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591240879] [2023-11-21 22:06:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:06:55,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:06:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:06:55,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:06:55,433 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:06:55,433 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-21 22:06:55,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2023-11-21 22:06:55,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2023-11-21 22:06:55,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2023-11-21 22:06:55,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2023-11-21 22:06:55,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:06:55,438 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-21 22:06:55,438 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-11-21 22:06:55,439 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-21 22:06:55,439 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-21 22:06:55,459 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 22:06:55,465 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:55,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:06:55,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:55,468 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 22:06:55,479 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:06:55,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of2ForFork0 ======== [2023-11-21 22:06:55,480 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;@3b01ad65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:06:55,480 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:06:55,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2023-11-21 22:06:55,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:55,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,593 INFO L85 PathProgramCache]: Analyzing trace with hash -572913617, now seen corresponding path program 1 times [2023-11-21 22:06:55,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256148580] [2023-11-21 22:06:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:55,611 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:06:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256148580] [2023-11-21 22:06:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256148580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:06:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492735068] [2023-11-21 22:06:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:55,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:06:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:06:55,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:06:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,615 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:55,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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:06:55,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:06:55,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:55,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1850476185, now seen corresponding path program 1 times [2023-11-21 22:06:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007762755] [2023-11-21 22:06:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:55,801 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:06:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007762755] [2023-11-21 22:06:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007762755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:06:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:06:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:06:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737005072] [2023-11-21 22:06:55,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:06:55,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:06:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:06:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:06:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:06:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,805 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:06:55,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 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:06:55,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:55,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:06:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:06:56,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 22:06:56,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:06:56,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:06:56,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1827632525, now seen corresponding path program 1 times [2023-11-21 22:06:56,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:06:56,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239996839] [2023-11-21 22:06:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:56,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:06:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:56,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:56,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:06:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239996839] [2023-11-21 22:06:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239996839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:06:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615508438] [2023-11-21 22:06:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:06:56,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:06:56,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:06:56,480 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:06:56,481 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:06:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:06:56,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-21 22:06:56,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:06:56,607 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:06:56,619 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:06:56,619 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 11 treesize of output 11 [2023-11-21 22:06:56,646 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 13 treesize of output 9 [2023-11-21 22:06:56,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-21 22:06:56,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:56,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 32 treesize of output 34 [2023-11-21 22:06:56,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:06:56,676 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 41 treesize of output 46 [2023-11-21 22:06:56,780 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 45 treesize of output 34 [2023-11-21 22:06:56,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:06:56,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:06:58,931 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1013 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false [2023-11-21 22:06:58,942 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1013 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1013) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false [2023-11-21 22:07:01,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:01,004 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 37 treesize of output 53 [2023-11-21 22:07:01,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:01,009 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 86 treesize of output 32 [2023-11-21 22:07:01,014 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:07:01,014 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 37 treesize of output 1 [2023-11-21 22:07:01,018 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:07:01,018 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 37 treesize of output 1 [2023-11-21 22:07:01,021 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-11-21 22:07:01,022 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 37 treesize of output 1 [2023-11-21 22:07:01,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:07:01,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615508438] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:07:01,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:07:01,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2023-11-21 22:07:01,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484332095] [2023-11-21 22:07:01,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:07:01,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-21 22:07:01,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:01,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:07:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=242, Unknown=17, NotChecked=66, Total=380 [2023-11-21 22:07:01,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:01,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:07:01,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 20 states have internal predecessors, (79), 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:07:01,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:01,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:01,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:07:01,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:07:02,087 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,SelfDestructingSolverStorable13 [2023-11-21 22:07:02,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:07:02,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:02,088 INFO L85 PathProgramCache]: Analyzing trace with hash 57526712, now seen corresponding path program 1 times [2023-11-21 22:07:02,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:02,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391598910] [2023-11-21 22:07:02,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:02,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-21 22:07:02,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:07:02,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391598910] [2023-11-21 22:07:02,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391598910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:07:02,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:07:02,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:07:02,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530498183] [2023-11-21 22:07:02,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:07:02,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:07:02,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:02,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:07:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:07:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:02,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:07:02,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:07:02,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:02,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:02,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:07:02,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:02,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:07:02,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:02,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 22:07:02,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:07:02,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1499177643, now seen corresponding path program 1 times [2023-11-21 22:07:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997365141] [2023-11-21 22:07:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:02,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:07:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:07:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997365141] [2023-11-21 22:07:03,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997365141] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:07:03,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999467777] [2023-11-21 22:07:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:03,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:03,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:07:03,692 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:07:03,711 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:07:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:03,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-21 22:07:03,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:07:03,854 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:07:03,919 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-21 22:07:03,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-21 22:07:04,150 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 13 treesize of output 9 [2023-11-21 22:07:04,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-21 22:07:04,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:04,234 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 32 treesize of output 34 [2023-11-21 22:07:04,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:04,289 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 41 treesize of output 46 [2023-11-21 22:07:04,444 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-21 22:07:04,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-21 22:07:04,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:04,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:05,074 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 45 treesize of output 34 [2023-11-21 22:07:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:07:05,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:07:05,096 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~t~0.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false [2023-11-21 22:07:05,133 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| c_threadThread2of2ForFork0_~arg.base v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2023-11-21 22:07:05,159 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_threadThread2of2ForFork0_#in~arg.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))) is different from false [2023-11-21 22:07:05,427 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5))))) is different from false [2023-11-21 22:07:05,539 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (forall ((v_ArrVal_1294 (Array Int Int)) (v_ArrVal_1293 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1293) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1294) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))) is different from false [2023-11-21 22:07:08,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,615 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 40 treesize of output 56 [2023-11-21 22:07:08,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,620 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 226 treesize of output 130 [2023-11-21 22:07:08,624 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 28 treesize of output 20 [2023-11-21 22:07:08,627 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 17 treesize of output 13 [2023-11-21 22:07:08,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,652 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 40 treesize of output 56 [2023-11-21 22:07:08,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:07:08,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,658 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 86 treesize of output 32 [2023-11-21 22:07:08,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,669 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 40 treesize of output 56 [2023-11-21 22:07:08,672 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:07:08,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,675 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 86 treesize of output 32 [2023-11-21 22:07:08,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,687 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 40 treesize of output 56 [2023-11-21 22:07:08,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:07:08,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:08,693 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 86 treesize of output 32 [2023-11-21 22:07:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 34 not checked. [2023-11-21 22:07:13,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999467777] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:07:13,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:07:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 50 [2023-11-21 22:07:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695957865] [2023-11-21 22:07:13,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:07:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-21 22:07:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:07:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-21 22:07:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1816, Unknown=45, NotChecked=460, Total=2550 [2023-11-21 22:07:13,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:13,097 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:07:13,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 4.8) internal successors, (240), 51 states have internal predecessors, (240), 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:07:13,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:13,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:13,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-21 22:07:13,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:13,097 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:07:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:07:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:07:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:07:16,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-21 22:07:16,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:16,221 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:07:16,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:07:16,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1588092998, now seen corresponding path program 1 times [2023-11-21 22:07:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:07:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393730270] [2023-11-21 22:07:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:07:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:07:19,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:07:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393730270] [2023-11-21 22:07:19,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393730270] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:07:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127346048] [2023-11-21 22:07:19,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:07:19,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:07:19,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:07:19,212 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:07:19,216 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:07:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:07:19,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-21 22:07:19,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:07:19,406 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:07:19,501 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-21 22:07:19,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-21 22:07:19,578 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 1 [2023-11-21 22:07:19,585 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:07:19,727 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:07:19,734 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:07:19,921 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-21 22:07:19,921 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 16 treesize of output 15 [2023-11-21 22:07:19,925 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:07:19,937 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-21 22:07:19,937 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 24 treesize of output 17 [2023-11-21 22:07:19,996 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 13 treesize of output 9 [2023-11-21 22:07:20,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-11-21 22:07:20,112 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 32 treesize of output 34 [2023-11-21 22:07:20,205 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 41 treesize of output 46 [2023-11-21 22:07:20,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:07:20,496 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 11 treesize of output 11 [2023-11-21 22:07:20,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,684 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 31 treesize of output 26 [2023-11-21 22:07:20,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,688 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 31 treesize of output 11 [2023-11-21 22:07:20,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,820 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 45 treesize of output 34 [2023-11-21 22:07:20,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,854 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 45 treesize of output 34 [2023-11-21 22:07:20,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:20,873 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 45 treesize of output 34 [2023-11-21 22:07:20,998 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-21 22:07:20,999 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 76 treesize of output 69 [2023-11-21 22:07:21,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 11 [2023-11-21 22:07:21,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:21,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2023-11-21 22:07:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-21 22:07:21,466 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 45 treesize of output 34 [2023-11-21 22:07:21,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:21,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-21 22:07:21,525 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 45 treesize of output 34 [2023-11-21 22:07:21,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:21,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:21,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:07:21,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:07:21,628 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 56 [2023-11-21 22:07:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:07:21,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:07:49,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse6))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse4 .cse1 (store (select .cse4 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse5 .cse1 (store (select .cse5 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< .cse2 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) is different from false [2023-11-21 22:07:49,228 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse4 .cse2 (store (select .cse4 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462))) (store .cse5 .cse2 (store (select .cse5 .cse2) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))))))) is different from false [2023-11-21 22:07:49,473 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|) (forall ((v_ArrVal_1462 (Array Int Int))) (= (select (select (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse7 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:07:49,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~1#1.base|))) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|))) (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse8 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse10 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) is different from false [2023-11-21 22:07:49,888 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc8#1.base|))) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base|))) (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse6 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse8 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1451 Int) (v_ArrVal_1457 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem13#1.offset_17| Int)) (or (forall ((v_ArrVal_1462 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_1462)) (.cse10 (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1458) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_main_#t~mem13#1.offset_17| 0))) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~ts~0#1.base| (store .cse3 .cse4 v_ArrVal_1451)) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~ts~0#1.base|) |c_ULTIMATE.start_main_~ts~0#1.offset|) |v_ULTIMATE.start_main_#t~mem13#1.offset_17|)))))) is different from false [2023-11-21 22:08:08,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 102 [2023-11-21 22:08:09,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:09,023 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 470 treesize of output 423 [2023-11-21 22:08:09,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 325 treesize of output 309 [2023-11-21 22:08:09,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:09,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 353 treesize of output 297 [2023-11-21 22:08:09,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:09,893 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 111 treesize of output 102 [2023-11-21 22:08:09,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:09,920 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 608 treesize of output 551 [2023-11-21 22:08:09,941 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 307 treesize of output 291 [2023-11-21 22:08:10,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:10,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 121 [2023-11-21 22:08:10,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:10,379 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 111 treesize of output 102 [2023-11-21 22:08:10,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:10,413 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 650 treesize of output 551 [2023-11-21 22:08:10,434 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 290 [2023-11-21 22:08:10,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:10,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 348 treesize of output 284 [2023-11-21 22:08:11,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:11,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 102 [2023-11-21 22:08:11,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:11,191 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 650 treesize of output 551 [2023-11-21 22:08:11,210 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 290 [2023-11-21 22:08:11,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:11,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 277 [2023-11-21 22:08:50,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:50,412 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 1612 treesize of output 1529 [2023-11-21 22:08:50,468 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 1696 treesize of output 1678 [2023-11-21 22:08:50,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:50,600 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 1723 treesize of output 1460 [2023-11-21 22:08:50,667 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 1914 treesize of output 1866 [2023-11-21 22:08:50,715 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 1592 treesize of output 1590 [2023-11-21 22:08:50,741 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 1590 treesize of output 1588 [2023-11-21 22:08:50,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1595 treesize of output 1593 [2023-11-21 22:08:50,815 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 1582 treesize of output 1580 [2023-11-21 22:08:50,841 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 1586 treesize of output 1584 [2023-11-21 22:08:50,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1584 treesize of output 1582 [2023-11-21 22:08:50,913 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 1589 treesize of output 1587 [2023-11-21 22:08:50,955 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 1576 treesize of output 1574 [2023-11-21 22:08:50,980 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 1581 treesize of output 1579 [2023-11-21 22:08:51,005 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 1579 treesize of output 1577 [2023-11-21 22:08:51,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:51,080 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 1671 treesize of output 1649 [2023-11-21 22:08:51,136 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 1611 treesize of output 1609 [2023-11-21 22:08:51,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:08:51,206 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 1675 treesize of output 1663 [2023-11-21 22:08:51,235 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 1659 treesize of output 1657 [2023-11-21 22:08:51,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1657 treesize of output 1655 [2023-11-21 22:08:51,294 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 1662 treesize of output 1660 [2023-11-21 22:08:51,324 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 1668 treesize of output 1666 [2023-11-21 22:08:51,364 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 1673 treesize of output 1671 [2023-11-21 22:08:51,419 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 1677 treesize of output 1675 [2023-11-21 22:08:51,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 1666 treesize of output 1664 [2023-11-21 22:08:51,492 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 1670 treesize of output 1668 [2023-11-21 22:08:51,521 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 1668 treesize of output 1666 [2023-11-21 22:08:51,553 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 1674 treesize of output 1672 [2023-11-21 22:08:51,583 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 1686 treesize of output 1682 [2023-11-21 22:08:51,614 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 1671 treesize of output 1667 [2023-11-21 22:08:51,645 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 1675 treesize of output 1673 [2023-11-21 22:08:51,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1673 treesize of output 1671 [2023-11-21 22:08:51,705 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 1678 treesize of output 1676 [2023-11-21 22:08:51,734 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 1676 treesize of output 1674 [2023-11-21 22:08:51,764 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 1674 treesize of output 1672 [2023-11-21 22:08:51,795 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 1680 treesize of output 1678 [2023-11-21 22:08:51,826 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 1685 treesize of output 1683 [2023-11-21 22:08:51,866 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 1683 treesize of output 1681 [2023-11-21 22:08:51,897 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 1681 treesize of output 1679 [2023-11-21 22:08:51,928 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 1679 treesize of output 1677 [2023-11-21 22:08:51,959 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 1677 treesize of output 1675 [2023-11-21 22:08:51,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1682 treesize of output 1680 [2023-11-21 22:08:52,029 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 1669 treesize of output 1667 [2023-11-21 22:08:52,077 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 1675 treesize of output 1673 [2023-11-21 22:08:52,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1686 treesize of output 1682 [2023-11-21 22:08:52,150 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 1673 treesize of output 1669 [2023-11-21 22:08:52,180 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 1669 treesize of output 1667 [2023-11-21 22:08:52,213 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 1673 treesize of output 1671 [2023-11-21 22:08:52,250 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 1662 treesize of output 1660 [2023-11-21 22:08:52,282 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 1674 treesize of output 1670 [2023-11-21 22:08:52,318 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 1659 treesize of output 1657 [2023-11-21 22:08:52,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1657 treesize of output 1653 [2023-11-21 22:08:52,387 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 1653 treesize of output 1651 [2023-11-21 22:08:52,419 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 1651 treesize of output 1649 [2023-11-21 22:08:52,457 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 1656 treesize of output 1654 [2023-11-21 22:08:52,503 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 1650 treesize of output 1648 [2023-11-21 22:08:52,541 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 1637 treesize of output 1635 [2023-11-21 22:08:52,572 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 1635 treesize of output 1633 [2023-11-21 22:08:52,603 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 1640 treesize of output 1638 [2023-11-21 22:08:52,634 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 1638 treesize of output 1636 [2023-11-21 22:08:52,665 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 1636 treesize of output 1634 [2023-11-21 22:09:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2023-11-21 22:09:22,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127346048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:09:22,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:09:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 25] total 70 [2023-11-21 22:09:22,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972785872] [2023-11-21 22:09:22,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:09:22,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-21 22:09:22,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:09:22,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-21 22:09:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3834, Unknown=102, NotChecked=660, Total=4970 [2023-11-21 22:09:22,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:09:22,642 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:09:22,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 3.142857142857143) internal successors, (220), 71 states have internal predecessors, (220), 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:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-21 22:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2023-11-21 22:09:22,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:09:31,799 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:09:46,769 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, 1] [2023-11-21 22:09:48,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15