./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 20174008 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.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 c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 12:33:08,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 12:33:08,951 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-24 12:33:08,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 12:33:08,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 12:33:08,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 12:33:08,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 12:33:08,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 12:33:08,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 12:33:08,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 12:33:08,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 12:33:08,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 12:33:08,982 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 12:33:08,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 12:33:08,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 12:33:08,983 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 12:33:08,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 12:33:08,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 12:33:08,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 12:33:08,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 12:33:08,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 12:33:08,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 12:33:08,985 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-24 12:33:08,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 12:33:08,985 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 12:33:08,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 12:33:08,986 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 12:33:08,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 12:33:08,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 12:33:08,986 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-24 12:33:08,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 12:33:08,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:33:08,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 12:33:08,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 12:33:08,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 12:33:08,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 12:33:08,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 12:33:08,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 12:33:08,989 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-24 12:33:08,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 12:33:08,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 12:33:08,989 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 12:33:08,989 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 12:33:08,989 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 -> c3ac8edf9cc34df23835297b42f3eb24b0fecd781f1d2abb112aaac7f99695b4 [2023-11-24 12:33:09,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 12:33:09,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 12:33:09,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 12:33:09,223 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 12:33:09,223 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 12:33:09,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-24 12:33:10,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 12:33:10,655 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 12:33:10,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array-race.i [2023-11-24 12:33:10,674 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0176a77ad/a4d0f01d2d284db090161fbd2e2d8e1f/FLAG182507d80 [2023-11-24 12:33:10,688 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0176a77ad/a4d0f01d2d284db090161fbd2e2d8e1f [2023-11-24 12:33:10,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 12:33:10,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 12:33:10,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 12:33:10,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 12:33:10,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 12:33:10,699 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:10" (1/1) ... [2023-11-24 12:33:10,699 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13317f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:10, skipping insertion in model container [2023-11-24 12:33:10,699 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 12:33:10" (1/1) ... [2023-11-24 12:33:10,741 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 12:33:11,078 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:33:11,084 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 12:33:11,128 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 12:33:11,165 INFO L206 MainTranslator]: Completed translation [2023-11-24 12:33:11,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11 WrapperNode [2023-11-24 12:33:11,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 12:33:11,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 12:33:11,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 12:33:11,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 12:33:11,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,210 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-24 12:33:11,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 12:33:11,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 12:33:11,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 12:33:11,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 12:33:11,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,234 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,236 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,238 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 12:33:11,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 12:33:11,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 12:33:11,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 12:33:11,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (1/1) ... [2023-11-24 12:33:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 12:33:11,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:33:11,318 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-24 12:33:11,336 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-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 12:33:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 12:33:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-24 12:33:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-24 12:33:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-24 12:33:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 12:33:11,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 12:33:11,374 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 12:33:11,549 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 12:33:11,552 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 12:33:11,806 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 12:33:11,814 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 12:33:11,818 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-24 12:33:11,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:11 BoogieIcfgContainer [2023-11-24 12:33:11,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 12:33:11,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 12:33:11,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 12:33:11,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 12:33:11,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 12:33:10" (1/3) ... [2023-11-24 12:33:11,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5766d2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:11, skipping insertion in model container [2023-11-24 12:33:11,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 12:33:11" (2/3) ... [2023-11-24 12:33:11,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5766d2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 12:33:11, skipping insertion in model container [2023-11-24 12:33:11,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 12:33:11" (3/3) ... [2023-11-24 12:33:11,827 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array-race.i [2023-11-24 12:33:11,834 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 12:33:11,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 12:33:11,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-24 12:33:11,843 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 12:33:11,891 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-24 12:33:11,926 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:33:11,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 12:33:11,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:33:11,928 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-24 12:33:11,929 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-24 12:33:11,967 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 12:33:11,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-24 12:33:11,984 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;@36cf325e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 12:33:11,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 12:33:12,192 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:33:12,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:33:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash -983011726, now seen corresponding path program 1 times [2023-11-24 12:33:12,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:33:12,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062957980] [2023-11-24 12:33:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:33:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:12,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-24 12:33:12,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:33:12,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062957980] [2023-11-24 12:33:12,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062957980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:33:12,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:33:12,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 12:33:12,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143158706] [2023-11-24 12:33:12,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:33:12,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 12:33:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:33:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 12:33:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 12:33:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:12,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:33:12,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 12:33:12,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:12,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:12,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 12:33:12,543 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:33:12,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:33:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-24 12:33:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:33:12,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046080086] [2023-11-24 12:33:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:12,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:33:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:13,329 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-24 12:33:13,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:33:13,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046080086] [2023-11-24 12:33:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046080086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 12:33:13,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 12:33:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 12:33:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898910922] [2023-11-24 12:33:13,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 12:33:13,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 12:33:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:33:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 12:33:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-24 12:33:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:13,336 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:33:13,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 12:33:13,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:13,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:33:13,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 12:33:13,545 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:33:13,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:33:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1434386381, now seen corresponding path program 1 times [2023-11-24 12:33:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:33:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350813005] [2023-11-24 12:33:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:33:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 12:33:14,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:33:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350813005] [2023-11-24 12:33:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350813005] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:33:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666742463] [2023-11-24 12:33:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:14,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:33:14,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:33:14,157 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-24 12:33:14,182 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-24 12:33:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:14,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-24 12:33:14,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:33:14,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-24 12:33:14,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-24 12:33:14,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 12:33:14,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 12:33:14,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 12:33:14,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 12:33:15,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:15,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-24 12:33:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 12:33:15,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:33:15,326 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_187 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_187) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset))))) is different from false [2023-11-24 12:33:15,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:15,846 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 35 treesize of output 51 [2023-11-24 12:33:15,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:15,857 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 76 treesize of output 32 [2023-11-24 12:33:15,868 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:33:15,869 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 35 treesize of output 1 [2023-11-24 12:33:15,876 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:33:15,876 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 35 treesize of output 1 [2023-11-24 12:33:15,882 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:33:15,882 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 33 treesize of output 1 [2023-11-24 12:33:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-24 12:33:22,165 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-24 12:33:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 12:33:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666742463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:33:22,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:33:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 47 [2023-11-24 12:33:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775019134] [2023-11-24 12:33:22,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:33:22,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-24 12:33:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:33:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-24 12:33:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1906, Unknown=16, NotChecked=90, Total=2256 [2023-11-24 12:33:22,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:22,233 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:33:22,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.3191489361702127) internal successors, (156), 48 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-24 12:33:22,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:22,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:33:22,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:33:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-24 12:33:24,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-24 12:33:24,280 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-24 12:33:24,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:33:24,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:33:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -624750547, now seen corresponding path program 2 times [2023-11-24 12:33:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:33:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096656275] [2023-11-24 12:33:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:33:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:24,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 12:33:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:33:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096656275] [2023-11-24 12:33:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096656275] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:33:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691868215] [2023-11-24 12:33:24,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 12:33:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:33:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:33:24,881 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-24 12:33:24,905 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-24 12:33:24,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 12:33:24,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 12:33:24,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 12:33:24,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:33:25,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-24 12:33:25,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 12:33:25,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-24 12:33:25,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:25,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-24 12:33:25,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:25,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-24 12:33:25,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:25,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:33:25,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:25,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:33:25,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:25,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:33:25,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:25,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:33:25,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:25,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-24 12:33:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 12:33:25,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:33:25,607 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-24 12:33:25,716 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 12:33:25,729 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_306) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-24 12:33:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-24 12:33:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-24 12:33:26,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691868215] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 12:33:26,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 12:33:26,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-24 12:33:26,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846522358] [2023-11-24 12:33:26,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 12:33:26,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-24 12:33:26,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 12:33:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-24 12:33:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1056, Unknown=6, NotChecked=204, Total=1406 [2023-11-24 12:33:26,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:26,042 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 12:33:26,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 12:33:26,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:26,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:33:26,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-24 12:33:26,043 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 12:33:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 12:33:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-24 12:33:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-24 12:33:27,148 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-24 12:33:27,319 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-24 12:33:27,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-24 12:33:27,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 12:33:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash -862869011, now seen corresponding path program 1 times [2023-11-24 12:33:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 12:33:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490344215] [2023-11-24 12:33:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 12:33:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:28,131 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-24 12:33:28,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 12:33:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490344215] [2023-11-24 12:33:28,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490344215] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 12:33:28,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701060963] [2023-11-24 12:33:28,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 12:33:28,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 12:33:28,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 12:33:28,133 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-24 12:33:28,158 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-24 12:33:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 12:33:28,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-24 12:33:28,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 12:33:28,254 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-24 12:33:28,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:28,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-24 12:33:28,418 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-24 12:33:28,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-24 12:33:29,108 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-24 12:33:29,109 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 3 case distinctions, treesize of input 88 treesize of output 78 [2023-11-24 12:33:29,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,117 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 31 treesize of output 21 [2023-11-24 12:33:29,436 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-24 12:33:29,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52 [2023-11-24 12:33:29,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:29,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-24 12:33:29,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-24 12:33:29,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-24 12:33:29,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-24 12:33:29,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:29,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-24 12:33:30,342 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-24 12:33:30,342 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 63 treesize of output 35 [2023-11-24 12:33:30,352 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 22 treesize of output 10 [2023-11-24 12:33:30,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:30,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 12:33:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 12:33:30,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:30,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 12:33:30,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 12:33:30,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-24 12:33:30,569 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 52 treesize of output 41 [2023-11-24 12:33:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 12:33:30,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 12:33:30,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4)))) (and (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-24 12:33:31,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse2 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse3 .cse1 (store (select .cse3 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse4 .cse1 (store (select .cse4 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse2 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)))))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))))) is different from false [2023-11-24 12:33:31,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse4 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))))))) is different from false [2023-11-24 12:33:33,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse4 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_16|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))))))) is different from false [2023-11-24 12:33:34,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~t~0.offset 1)) (.cse4 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse9 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_16| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_12| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) (forall ((v_ArrVal_432 Int) (v_ArrVal_430 (Array Int Int))) (= (select (select (let ((.cse8 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_430))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ (* |v_ULTIMATE.start_main_~i~1#1_16| 4) |v_ULTIMATE.start_main_#t~mem14#1.offset_12|) v_ArrVal_432))) c_threadThread1of1ForFork0_~t~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_16|)))))) is different from false [2023-11-24 12:33:34,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:34,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 74 [2023-11-24 12:33:34,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:34,751 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 548 treesize of output 484 [2023-11-24 12:33:34,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 206 [2023-11-24 12:33:34,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:34,894 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 155 treesize of output 109 [2023-11-24 12:33:34,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:34,939 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 79 treesize of output 72 [2023-11-24 12:33:34,943 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 12:33:34,950 INFO L349 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-11-24 12:33:34,951 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 168 treesize of output 142 [2023-11-24 12:33:34,958 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 50 treesize of output 48 [2023-11-24 12:33:34,963 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 134 treesize of output 94 [2023-11-24 12:33:34,981 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:33:34,982 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 81 treesize of output 1 [2023-11-24 12:33:34,987 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-24 12:33:34,988 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 81 treesize of output 1 [2023-11-24 12:33:36,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:36,245 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 234 treesize of output 211 [2023-11-24 12:33:36,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:33:36,292 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 179 treesize of output 212 [2023-11-24 12:33:36,305 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 155 treesize of output 153 [2023-11-24 12:33:36,321 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 153 treesize of output 151 [2023-11-24 12:33:36,331 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 151 treesize of output 149 [2023-11-24 12:33:36,342 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 149 treesize of output 147 [2023-11-24 12:34:51,685 WARN L293 SmtUtils]: Spent 51.48s on a formula simplification that was a NOOP. DAG size: 2451 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 12:34:51,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 12:34:51,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 35 select indices, 35 select index equivalence classes, 0 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 595 case distinctions, treesize of input 3626 treesize of output 8271 [2023-11-24 12:34:57,672 WARN L293 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 3713 DAG size of output: 3552 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15