./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d2ba6107 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr-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 3b48d748645bdde1aeeb8dea66ba49bd5b185acd910927d963305195a7958388 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 22:02:00,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:02:00,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-DataRace-32bit-GemCutter_Default.epf [2023-11-21 22:02:00,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:02:00,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:02:00,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:02:00,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:02:00,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:02:00,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:02:00,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:02:00,459 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:02:00,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:02:00,460 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:02:00,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:02:00,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:02:00,462 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:02:00,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:02:00,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:02:00,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:02:00,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:02:00,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:02:00,464 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:02:00,464 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 22:02:00,465 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:02:00,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:02:00,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:02:00,466 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:02:00,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:02:00,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:02:00,467 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-21 22:02:00,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:02:00,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:02:00,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:02:00,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:02:00,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:02:00,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:02:00,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:02:00,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:02:00,470 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-11-21 22:02:00,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 22:02:00,470 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:02:00,471 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 22:02:00,471 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 22:02:00,471 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 -> 3b48d748645bdde1aeeb8dea66ba49bd5b185acd910927d963305195a7958388 [2023-11-21 22:02:00,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:02:00,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:02:00,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:02:00,807 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:02:00,807 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:02:00,808 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr-race.i [2023-11-21 22:02:01,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:02:02,181 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:02:02,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-ptr-race.i [2023-11-21 22:02:02,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61cf40a82/22665b60ba324777bf5ab8be87deb2c2/FLAG7ffc08480 [2023-11-21 22:02:02,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/61cf40a82/22665b60ba324777bf5ab8be87deb2c2 [2023-11-21 22:02:02,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:02:02,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:02:02,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:02:02,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:02:02,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:02:02,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6631de1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02, skipping insertion in model container [2023-11-21 22:02:02,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,293 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:02:02,437 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:02:02,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:02:02,631 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:02:02,646 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-21 22:02:02,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:02:02,752 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 22:02:02,759 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:02:02,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02 WrapperNode [2023-11-21 22:02:02,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:02:02,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:02:02,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:02:02,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:02:02,767 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:02:02" (1/1) ... [2023-11-21 22:02:02,788 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:02:02" (1/1) ... [2023-11-21 22:02:02,829 INFO L138 Inliner]: procedures = 266, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-21 22:02:02,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:02:02,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:02:02,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:02:02,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:02:02,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,878 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:02:02,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:02:02,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:02:02,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:02:02,879 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (1/1) ... [2023-11-21 22:02:02,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:02:02,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:02,906 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:02:02,920 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:02:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:02:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:02:02,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:02:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 22:02:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:02:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:02:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:02:02,955 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-21 22:02:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-21 22:02:02,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:02:02,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:02:02,958 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:02:03,122 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:02:03,124 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:02:03,452 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:02:03,461 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:02:03,463 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 22:02:03,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:03 BoogieIcfgContainer [2023-11-21 22:02:03,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:02:03,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:02:03,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:02:03,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:02:03,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:02:02" (1/3) ... [2023-11-21 22:02:03,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2565bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:03, skipping insertion in model container [2023-11-21 22:02:03,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:02:02" (2/3) ... [2023-11-21 22:02:03,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2565bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:02:03, skipping insertion in model container [2023-11-21 22:02:03,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:02:03" (3/3) ... [2023-11-21 22:02:03,474 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr-race.i [2023-11-21 22:02:03,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 22:02:03,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:02:03,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-21 22:02:03,492 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 22:02:03,546 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-21 22:02:03,593 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:03,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 22:02:03,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:03,596 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:02:03,604 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:02:03,639 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 22:02:03,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == threadThread1of1ForFork0 ======== [2023-11-21 22:02:03,656 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;@234250e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:02:03,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 22:02:03,974 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:03,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash -118187754, now seen corresponding path program 1 times [2023-11-21 22:02:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:03,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267015528] [2023-11-21 22:02:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:03,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:04,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:04,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267015528] [2023-11-21 22:02:04,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267015528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:04,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:04,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:02:04,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703909233] [2023-11-21 22:02:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:04,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-21 22:02:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-21 22:02:04,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-21 22:02:04,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,273 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:04,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:04,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:02:04,292 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:04,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash 108159104, now seen corresponding path program 1 times [2023-11-21 22:02:04,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:04,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272238558] [2023-11-21 22:02:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:04,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:04,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272238558] [2023-11-21 22:02:04,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272238558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:02:04,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:02:04,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:02:04,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725204521] [2023-11-21 22:02:04,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:02:04,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:02:04,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:05,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:02:05,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:02:05,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:05,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:05,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:05,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:05,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:05,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:05,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:02:05,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:05,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:05,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1728096500, now seen corresponding path program 1 times [2023-11-21 22:02:05,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:05,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503409347] [2023-11-21 22:02:05,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503409347] [2023-11-21 22:02:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503409347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447827628] [2023-11-21 22:02:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:06,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:06,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:06,117 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:02:06,135 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:02:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:06,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:02:06,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:06,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 22:02:06,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:02:06,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:02:06,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:02:06,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:02:07,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:02:07,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:07,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 37 treesize of output 26 [2023-11-21 22:02:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:07,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:07,478 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_188 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_188) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:08,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,109 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 33 treesize of output 49 [2023-11-21 22:02:08,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:08,122 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 60 treesize of output 26 [2023-11-21 22:02:08,134 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:08,134 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-21 22:02:08,140 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:08,140 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-21 22:02:08,148 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:02:08,149 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-21 22:02:12,542 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:02:12,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 22:02:12,614 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-21 22:02:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447827628] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:12,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:12,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 47 [2023-11-21 22:02:12,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170622457] [2023-11-21 22:02:12,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:12,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-21 22:02:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:12,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-21 22:02:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1907, Unknown=13, NotChecked=90, Total=2256 [2023-11-21 22:02:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:12,622 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-21 22:02:12,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:12,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:12,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:14,900 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:02:15,081 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:02:15,082 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:15,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:15,083 INFO L85 PathProgramCache]: Analyzing trace with hash 490517125, now seen corresponding path program 2 times [2023-11-21 22:02:15,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:15,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964487935] [2023-11-21 22:02:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:15,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:15,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:15,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964487935] [2023-11-21 22:02:15,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964487935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:15,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300059490] [2023-11-21 22:02:15,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:15,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:15,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:15,878 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:02:15,904 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:02:16,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:16,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:16,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-21 22:02:16,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:16,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-11-21 22:02:16,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:02:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:16,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:16,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 22:02:16,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:16,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:02:16,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:16,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:16,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:16,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:16,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:16,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:16,750 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))) is different from false [2023-11-21 22:02:16,814 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:16,964 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:16,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_308) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:17,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-21 22:02:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-21 22:02:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300059490] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:17,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:17,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 37 [2023-11-21 22:02:17,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262955556] [2023-11-21 22:02:17,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:17,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-21 22:02:17,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:17,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-21 22:02:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=998, Unknown=4, NotChecked=268, Total=1406 [2023-11-21 22:02:17,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:17,315 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:17,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.513513513513513) internal successors, (167), 38 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-11-21 22:02:17,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:02:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:18,781 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:02:18,963 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:02:18,963 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:18,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:18,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1939312127, now seen corresponding path program 1 times [2023-11-21 22:02:18,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:18,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382643943] [2023-11-21 22:02:18,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382643943] [2023-11-21 22:02:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382643943] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284104537] [2023-11-21 22:02:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:20,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:20,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:20,082 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:02:20,106 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:02:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:20,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-21 22:02:20,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:20,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:20,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:20,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:20,502 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:20,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:20,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:02:21,361 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:02:21,362 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 72 treesize of output 66 [2023-11-21 22:02:21,714 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:21,716 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-21 22:02:21,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:02:21,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:02:21,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:21,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-11-21 22:02:22,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:22,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-11-21 22:02:22,552 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:02:22,553 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 40 [2023-11-21 22:02:22,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:22,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:22,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:22,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:22,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:02:22,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 37 treesize of output 26 [2023-11-21 22:02:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:22,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:22,892 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:22,929 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:02:22,988 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse0 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:23,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.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_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:23,143 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.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_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_431) .cse1 v_ArrVal_432) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:02:23,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 8 treesize of output 4 [2023-11-21 22:02:23,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:23,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-11-21 22:02:24,007 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 65 treesize of output 63 [2023-11-21 22:02:24,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:24,239 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 163 treesize of output 166 [2023-11-21 22:02:24,337 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:02:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284104537] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:02:24,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:02:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 22] total 58 [2023-11-21 22:02:24,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446999551] [2023-11-21 22:02:24,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:02:24,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-21 22:02:24,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:02:24,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-21 22:02:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2637, Unknown=9, NotChecked=540, Total=3422 [2023-11-21 22:02:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:24,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:02:24,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.086206896551724) internal successors, (179), 59 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:02:24,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:24,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:24,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-11-21 22:02:24,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:24,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:02:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:02:29,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:02:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:02:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:02:29,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-21 22:02:29,993 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:02:29,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:02:29,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:02:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1804082767, now seen corresponding path program 2 times [2023-11-21 22:02:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:02:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991723338] [2023-11-21 22:02:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:02:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:02:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:02:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:02:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991723338] [2023-11-21 22:02:30,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991723338] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:02:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346274503] [2023-11-21 22:02:30,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:02:30,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:02:30,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:02:30,924 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:02:30,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-21 22:02:31,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:02:31,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:02:31,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-21 22:02:31,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:02:31,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:02:31,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:02:31,192 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:02:31,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:02:31,881 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:31,881 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 71 treesize of output 57 [2023-11-21 22:02:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:31,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:31,891 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:02:31,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-21 22:02:32,283 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:02:32,283 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-21 22:02:32,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:32,293 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-21 22:02:32,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-21 22:02:32,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:02:32,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:02:32,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:32,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 22:02:33,156 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:02:33,156 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 40 [2023-11-21 22:02:33,173 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-21 22:02:33,173 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 29 treesize of output 13 [2023-11-21 22:02:33,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:33,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-21 22:02:33,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:02:33,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:33,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:33,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:33,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:33,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:02:33,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:02:33,490 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 58 treesize of output 47 [2023-11-21 22:02:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:02:33,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:02:33,655 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_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse2 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:33,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem14#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse3 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse3 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem14#1.base|) .cse1 v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false [2023-11-21 22:02:33,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4)) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| .cse3) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) is different from false [2023-11-21 22:02:34,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse4 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse4 .cse2 (store (select .cse4 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse6 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse6 .cse2 (store (select .cse6 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))))) is different from false [2023-11-21 22:02:34,476 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (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_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse4 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse1 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_17|) (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse2 (store (select .cse8 .cse2) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 22:02:36,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse9 (+ c_threadThread1of1ForFork0_~p~0.offset 2))) (let ((.cse4 (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|)) (.cse2 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse6 |c_threadThread1of1ForFork0_#t~nondet4|) .cse9 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse3 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse0 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse5 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse5 .cse1 (store (select .cse5 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse6) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse7 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse7 .cse1 (store (select .cse7 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|))) (forall ((|v_ULTIMATE.start_main_~i~1#1_17| Int)) (or (forall ((|v_ULTIMATE.start_main_#t~mem14#1.offset_13| Int)) (or (< .cse4 |v_ULTIMATE.start_main_#t~mem14#1.offset_13|) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_552 (Array Int Int)) (v_ArrVal_558 Int)) (= (select (select (let ((.cse8 (store (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_552) c_threadThread1of1ForFork0_~p~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_557))) (store .cse8 .cse1 (store (select .cse8 .cse1) (+ |v_ULTIMATE.start_main_#t~mem14#1.offset_13| (* |v_ULTIMATE.start_main_~i~1#1_17| 4)) v_ArrVal_558))) c_threadThread1of1ForFork0_~p~0.base) .cse9) |c_threadThread1of1ForFork0_#t~nondet4|)))) (< 0 |v_ULTIMATE.start_main_~i~1#1_17|)))))) is different from false [2023-11-21 22:02:36,596 INFO L349 Elim1Store]: treesize reduction 31, result has 62.2 percent of original size [2023-11-21 22:02:36,596 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 838 treesize of output 792 [2023-11-21 22:02:36,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:36,617 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 354 treesize of output 324 [2023-11-21 22:02:36,628 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 240 treesize of output 224 [2023-11-21 22:02:36,829 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:36,844 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:36,863 INFO L349 Elim1Store]: treesize reduction 58, result has 29.3 percent of original size [2023-11-21 22:02:36,863 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 320 treesize of output 247 [2023-11-21 22:02:36,870 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:36,873 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 166 treesize of output 142 [2023-11-21 22:02:36,880 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 85 treesize of output 83 [2023-11-21 22:02:36,905 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:36,913 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:02:36,913 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 336 treesize of output 1 [2023-11-21 22:02:36,918 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:02:36,925 INFO L349 Elim1Store]: treesize reduction 81, result has 1.2 percent of original size [2023-11-21 22:02:36,926 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 336 treesize of output 1 [2023-11-21 22:02:38,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:38,901 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 228 treesize of output 254 [2023-11-21 22:02:38,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:02:38,973 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 231 treesize of output 233 [2023-11-21 22:02:38,993 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 162 treesize of output 160 [2023-11-21 22:02:39,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 158 [2023-11-21 22:02:39,019 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 158 treesize of output 156 [2023-11-21 22:02:39,031 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 156 treesize of output 154 [2023-11-21 22:03:37,123 WARN L293 SmtUtils]: Spent 6.66s on a formula simplification. DAG size of input: 303 DAG size of output: 369 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-21 22:05:20,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:20,679 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 380 treesize of output 417 [2023-11-21 22:05:21,056 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:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346274503] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:21,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 23] total 60 [2023-11-21 22:05:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135645888] [2023-11-21 22:05:21,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:21,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-21 22:05:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-21 22:05:21,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2711, Unknown=39, NotChecked=666, Total=3660 [2023-11-21 22:05:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:21,060 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:21,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.0) internal successors, (180), 61 states have internal predecessors, (180), 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:21,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:21,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:21,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:05:21,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:21,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:05:21,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-21 22:05:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:05:27,451 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:05:27,641 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:05:27,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:27,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -2115809315, now seen corresponding path program 3 times [2023-11-21 22:05:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:27,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278849191] [2023-11-21 22:05:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:28,497 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:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278849191] [2023-11-21 22:05:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278849191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703449567] [2023-11-21 22:05:28,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:05:28,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:28,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:28,499 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:05:28,500 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:05:28,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-21 22:05:28,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:28,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-21 22:05:28,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:28,740 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:28,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:28,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:05:28,891 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:28,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:05:29,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-21 22:05:29,486 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:29,486 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 71 treesize of output 57 [2023-11-21 22:05:29,771 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:29,771 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-21 22:05:29,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:29,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-21 22:05:30,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:05:30,423 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-21 22:05:30,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:30,476 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 16 [2023-11-21 22:05:30,488 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:05:30,545 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:05:30,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:30,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:30,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:30,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:30,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:30,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:30,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:30,750 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:30,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:30,764 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:30,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)))) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:30,924 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_683) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:31,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:31,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 89 [2023-11-21 22:05:31,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:31,558 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 105 treesize of output 79 [2023-11-21 22:05:31,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2023-11-21 22:05:31,568 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 30 treesize of output 28 [2023-11-21 22:05:31,579 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:31,580 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:31,590 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-21 22:05:31,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2023-11-21 22:05:31,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:31,592 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:31,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:31,594 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-21 22:05:32,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-21 22:05:32,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:32,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 103 [2023-11-21 22:05:32,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 68 treesize of output 66 [2023-11-21 22:05:32,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 301 treesize of output 316 [2023-11-21 22:05:33,096 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:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703449567] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:33,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:33,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 23] total 65 [2023-11-21 22:05:33,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224771729] [2023-11-21 22:05:33,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:33,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-21 22:05:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-21 22:05:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3556, Unknown=66, NotChecked=372, Total=4290 [2023-11-21 22:05:33,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,100 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:33,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 2.876923076923077) internal successors, (187), 66 states have internal predecessors, (187), 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:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2023-11-21 22:05:33,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:05:39,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:05:39,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-21 22:05:39,391 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:05:39,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:39,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1748119725, now seen corresponding path program 4 times [2023-11-21 22:05:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:39,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311462397] [2023-11-21 22:05:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:40,327 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:40,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311462397] [2023-11-21 22:05:40,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311462397] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:40,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806859844] [2023-11-21 22:05:40,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:05:40,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:40,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:40,328 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:05:40,347 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:05:40,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:05:40,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:40,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-21 22:05:40,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:40,646 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:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:40,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:05:40,798 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:40,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:05:41,466 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:41,466 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 71 treesize of output 57 [2023-11-21 22:05:41,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-21 22:05:41,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:41,765 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-21 22:05:41,790 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:41,791 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-21 22:05:41,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:05:42,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-21 22:05:42,190 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-21 22:05:42,196 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 15 treesize of output 7 [2023-11-21 22:05:42,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:42,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-21 22:05:42,249 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:05:42,312 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:05:42,367 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:05:42,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:42,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:42,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:42,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:42,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:42,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:42,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-21 22:05:42,591 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:42,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:42,604 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_809 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:42,625 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:42,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset)))))) is different from false [2023-11-21 22:05:42,660 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_809) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:43,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:43,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 119 [2023-11-21 22:05:43,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2023-11-21 22:05:43,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 109 [2023-11-21 22:05:44,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:44,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 237 treesize of output 254 [2023-11-21 22:05:44,201 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:44,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806859844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:44,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:44,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 51 [2023-11-21 22:05:44,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807659393] [2023-11-21 22:05:44,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:44,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-21 22:05:44,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:44,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-21 22:05:44,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2076, Unknown=8, NotChecked=380, Total=2652 [2023-11-21 22:05:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:44,205 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:44,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.1372549019607843) internal successors, (160), 52 states have internal predecessors, (160), 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:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-11-21 22:05:44,206 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:05:50,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-21 22:05:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:05:50,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-21 22:05:50,508 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:05:50,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [threadErr0ASSERT_VIOLATIONDATA_RACE] === [2023-11-21 22:05:50,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:05:50,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1504699717, now seen corresponding path program 5 times [2023-11-21 22:05:50,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:05:50,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746473701] [2023-11-21 22:05:50,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:05:50,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:05:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:05:52,337 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:52,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:05:52,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746473701] [2023-11-21 22:05:52,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746473701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:05:52,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207616956] [2023-11-21 22:05:52,337 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:05:52,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:05:52,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 22:05:52,338 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:05:52,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 22:05:52,483 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:05:52,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:05:52,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-21 22:05:52,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:05:52,512 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:52,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:52,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-21 22:05:52,621 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-21 22:05:52,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-21 22:05:53,003 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-11-21 22:05:53,004 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 72 treesize of output 66 [2023-11-21 22:05:53,299 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2023-11-21 22:05:53,299 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-21 22:05:53,471 INFO L349 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-11-21 22:05:53,471 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 40 [2023-11-21 22:05:53,520 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:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-21 22:05:53,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:53,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-11-21 22:05:53,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:53,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-11-21 22:05:53,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:53,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:53,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:53,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 22:05:53,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:53,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2023-11-21 22:05:53,861 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:53,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:05:53,876 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)))) (forall ((v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_932 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:53,897 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-21 22:05:53,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:53,935 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse2 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_932) c_threadThread1of1ForFork0_~p~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-21 22:05:54,045 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2023-11-21 22:05:54,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:54,050 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 224 treesize of output 130 [2023-11-21 22:05:54,054 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:05:54,056 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:05:54,066 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:54,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2023-11-21 22:05:54,085 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:54,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1 [2023-11-21 22:05:54,090 INFO L349 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2023-11-21 22:05:54,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1 [2023-11-21 22:05:54,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:54,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 103 [2023-11-21 22:05:54,894 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 65 treesize of output 63 [2023-11-21 22:05:55,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-21 22:05:55,053 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 117 treesize of output 122 [2023-11-21 22:05:55,158 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:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207616956] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:05:55,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:05:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 20] total 58 [2023-11-21 22:05:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164209099] [2023-11-21 22:05:55,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:05:55,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-21 22:05:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:05:55,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-21 22:05:55,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2763, Unknown=5, NotChecked=436, Total=3422 [2023-11-21 22:05:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:55,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 22:05:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.103448275862069) internal successors, (180), 59 states have internal predecessors, (180), 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:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-11-21 22:05:55,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2023-11-21 22:05:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-11-21 22:05:55,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Killed by 15