/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 03:42:25,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 03:42:25,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 03:42:25,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 03:42:25,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 03:42:25,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 03:42:25,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 03:42:25,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 03:42:25,217 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 03:42:25,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 03:42:25,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 03:42:25,218 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 03:42:25,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 03:42:25,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 03:42:25,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 03:42:25,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 03:42:25,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 03:42:25,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 03:42:25,220 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 03:42:25,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 03:42:25,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 03:42:25,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 03:42:25,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 03:42:25,221 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 03:42:25,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 03:42:25,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:42:25,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 03:42:25,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 03:42:25,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 03:42:25,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 03:42:25,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 03:42:25,229 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 03:42:25,229 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 03:42:25,229 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/UAutomizer-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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 03:42:25,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 03:42:25,429 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 03:42:25,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 03:42:25,433 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 03:42:25,433 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 03:42:25,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-30 03:42:26,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 03:42:26,833 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 03:42:26,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-struct-in-array.i [2023-11-30 03:42:26,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1a86444/9a8a9788067d47c094253fe6d4a0606e/FLAGbb475b02f [2023-11-30 03:42:26,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1a86444/9a8a9788067d47c094253fe6d4a0606e [2023-11-30 03:42:26,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 03:42:26,861 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 03:42:26,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 03:42:26,862 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 03:42:26,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 03:42:26,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:42:26" (1/1) ... [2023-11-30 03:42:26,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8fe1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:26, skipping insertion in model container [2023-11-30 03:42:26,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 03:42:26" (1/1) ... [2023-11-30 03:42:26,907 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 03:42:27,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:42:27,265 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 03:42:27,300 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 03:42:27,341 INFO L206 MainTranslator]: Completed translation [2023-11-30 03:42:27,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27 WrapperNode [2023-11-30 03:42:27,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 03:42:27,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 03:42:27,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 03:42:27,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 03:42:27,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,411 INFO L138 Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2023-11-30 03:42:27,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 03:42:27,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 03:42:27,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 03:42:27,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 03:42:27,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,438 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 03:42:27,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 03:42:27,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 03:42:27,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 03:42:27,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (1/1) ... [2023-11-30 03:42:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 03:42:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:42:27,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 03:42:27,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 03:42:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 03:42:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-30 03:42:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 03:42:27,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-30 03:42:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 03:42:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 03:42:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 03:42:27,533 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-11-30 03:42:27,533 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-11-30 03:42:27,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 03:42:27,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 03:42:27,535 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 03:42:27,766 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 03:42:27,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 03:42:28,045 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 03:42:28,056 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 03:42:28,056 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 03:42:28,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:42:28 BoogieIcfgContainer [2023-11-30 03:42:28,057 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 03:42:28,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 03:42:28,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 03:42:28,062 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 03:42:28,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 03:42:26" (1/3) ... [2023-11-30 03:42:28,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160bd159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:42:28, skipping insertion in model container [2023-11-30 03:42:28,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 03:42:27" (2/3) ... [2023-11-30 03:42:28,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160bd159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 03:42:28, skipping insertion in model container [2023-11-30 03:42:28,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 03:42:28" (3/3) ... [2023-11-30 03:42:28,064 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-in-array.i [2023-11-30 03:42:28,080 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 03:42:28,080 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-30 03:42:28,080 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 03:42:28,171 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-30 03:42:28,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow [2023-11-30 03:42:28,298 INFO L124 PetriNetUnfolderBase]: 6/188 cut-off events. [2023-11-30 03:42:28,298 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-30 03:42:28,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 382 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-11-30 03:42:28,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow [2023-11-30 03:42:28,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow [2023-11-30 03:42:28,326 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:42:28,334 INFO L362 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=PETRI_NET, 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;@44ebf49e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:42:28,335 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-30 03:42:28,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:42:28,353 INFO L124 PetriNetUnfolderBase]: 3/43 cut-off events. [2023-11-30 03:42:28,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:42:28,354 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:28,354 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:28,354 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:28,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:28,358 INFO L85 PathProgramCache]: Analyzing trace with hash 578939384, now seen corresponding path program 1 times [2023-11-30 03:42:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141370464] [2023-11-30 03:42:28,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:29,105 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-30 03:42:29,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141370464] [2023-11-30 03:42:29,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141370464] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:29,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:29,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218267706] [2023-11-30 03:42:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:29,118 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:29,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:29,148 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 122 [2023-11-30 03:42:29,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 68.5) internal successors, (411), 6 states have internal predecessors, (411), 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-30 03:42:29,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:29,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 122 [2023-11-30 03:42:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:29,674 INFO L124 PetriNetUnfolderBase]: 324/1071 cut-off events. [2023-11-30 03:42:29,675 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-30 03:42:29,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1071 events. 324/1071 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6598 event pairs, 114 based on Foata normal form. 15/956 useless extension candidates. Maximal degree in co-relation 1687. Up to 558 conditions per place. [2023-11-30 03:42:29,688 INFO L140 encePairwiseOnDemand]: 102/122 looper letters, 93 selfloop transitions, 24 changer transitions 1/184 dead transitions. [2023-11-30 03:42:29,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 184 transitions, 609 flow [2023-11-30 03:42:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 526 transitions. [2023-11-30 03:42:29,706 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7185792349726776 [2023-11-30 03:42:29,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 526 transitions. [2023-11-30 03:42:29,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 526 transitions. [2023-11-30 03:42:29,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:29,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 526 transitions. [2023-11-30 03:42:29,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.66666666666667) internal successors, (526), 6 states have internal predecessors, (526), 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-30 03:42:29,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:29,723 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:29,728 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2023-11-30 03:42:29,729 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 184 transitions, 609 flow [2023-11-30 03:42:29,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.5) internal successors, (411), 6 states have internal predecessors, (411), 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-30 03:42:29,729 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:29,729 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:29,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 03:42:29,730 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:29,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:29,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2012313278, now seen corresponding path program 1 times [2023-11-30 03:42:29,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934334354] [2023-11-30 03:42:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:29,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:29,839 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-30 03:42:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:29,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934334354] [2023-11-30 03:42:29,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934334354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:29,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:29,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503750087] [2023-11-30 03:42:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:29,842 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:42:29,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:29,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:42:29,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:42:29,844 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122 [2023-11-30 03:42:29,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 184 transitions, 609 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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-30 03:42:29,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:29,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122 [2023-11-30 03:42:29,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:30,004 INFO L124 PetriNetUnfolderBase]: 324/1058 cut-off events. [2023-11-30 03:42:30,005 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-30 03:42:30,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1058 events. 324/1058 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6218 event pairs, 114 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 1720. Up to 567 conditions per place. [2023-11-30 03:42:30,011 INFO L140 encePairwiseOnDemand]: 114/122 looper letters, 35 selfloop transitions, 6 changer transitions 2/192 dead transitions. [2023-11-30 03:42:30,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 192 transitions, 711 flow [2023-11-30 03:42:30,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 583 transitions. [2023-11-30 03:42:30,014 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2023-11-30 03:42:30,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 583 transitions. [2023-11-30 03:42:30,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 583 transitions. [2023-11-30 03:42:30,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:30,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 583 transitions. [2023-11-30 03:42:30,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-30 03:42:30,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:30,018 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:30,018 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2023-11-30 03:42:30,019 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 192 transitions, 711 flow [2023-11-30 03:42:30,019 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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-30 03:42:30,019 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:30,019 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:30,019 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 03:42:30,020 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:30,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:30,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1180280619, now seen corresponding path program 1 times [2023-11-30 03:42:30,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:30,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906166322] [2023-11-30 03:42:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:30,351 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-30 03:42:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906166322] [2023-11-30 03:42:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906166322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:30,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:30,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210921851] [2023-11-30 03:42:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:30,355 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:30,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:30,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:30,357 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 122 [2023-11-30 03:42:30,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 192 transitions, 711 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-30 03:42:30,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:30,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 122 [2023-11-30 03:42:30,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:30,744 INFO L124 PetriNetUnfolderBase]: 491/1519 cut-off events. [2023-11-30 03:42:30,746 INFO L125 PetriNetUnfolderBase]: For 116/124 co-relation queries the response was YES. [2023-11-30 03:42:30,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3883 conditions, 1519 events. 491/1519 cut-off events. For 116/124 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 9959 event pairs, 48 based on Foata normal form. 0/1358 useless extension candidates. Maximal degree in co-relation 3561. Up to 848 conditions per place. [2023-11-30 03:42:30,755 INFO L140 encePairwiseOnDemand]: 99/122 looper letters, 148 selfloop transitions, 54 changer transitions 14/287 dead transitions. [2023-11-30 03:42:30,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 287 transitions, 1518 flow [2023-11-30 03:42:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:30,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 519 transitions. [2023-11-30 03:42:30,761 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7090163934426229 [2023-11-30 03:42:30,761 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 519 transitions. [2023-11-30 03:42:30,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 519 transitions. [2023-11-30 03:42:30,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:30,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 519 transitions. [2023-11-30 03:42:30,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 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-30 03:42:30,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:30,765 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:30,766 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 15 predicate places. [2023-11-30 03:42:30,766 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 287 transitions, 1518 flow [2023-11-30 03:42:30,766 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-30 03:42:30,767 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:30,767 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:30,767 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 03:42:30,767 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:30,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash -396544275, now seen corresponding path program 1 times [2023-11-30 03:42:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111378092] [2023-11-30 03:42:30,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:30,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:31,108 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-30 03:42:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:31,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111378092] [2023-11-30 03:42:31,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111378092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:31,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:31,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:31,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511606097] [2023-11-30 03:42:31,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:31,110 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:31,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:31,111 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 122 [2023-11-30 03:42:31,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 287 transitions, 1518 flow. Second operand has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-30 03:42:31,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:31,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 122 [2023-11-30 03:42:31,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:31,690 INFO L124 PetriNetUnfolderBase]: 902/2533 cut-off events. [2023-11-30 03:42:31,690 INFO L125 PetriNetUnfolderBase]: For 605/627 co-relation queries the response was YES. [2023-11-30 03:42:31,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8024 conditions, 2533 events. 902/2533 cut-off events. For 605/627 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 18386 event pairs, 151 based on Foata normal form. 4/2325 useless extension candidates. Maximal degree in co-relation 7639. Up to 1407 conditions per place. [2023-11-30 03:42:31,706 INFO L140 encePairwiseOnDemand]: 91/122 looper letters, 228 selfloop transitions, 147 changer transitions 33/489 dead transitions. [2023-11-30 03:42:31,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 489 transitions, 3594 flow [2023-11-30 03:42:31,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:31,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 624 transitions. [2023-11-30 03:42:31,709 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8524590163934426 [2023-11-30 03:42:31,709 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 624 transitions. [2023-11-30 03:42:31,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 624 transitions. [2023-11-30 03:42:31,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:31,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 624 transitions. [2023-11-30 03:42:31,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.0) internal successors, (624), 6 states have internal predecessors, (624), 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-30 03:42:31,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:31,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:31,715 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 20 predicate places. [2023-11-30 03:42:31,715 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 489 transitions, 3594 flow [2023-11-30 03:42:31,716 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 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-30 03:42:31,716 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:31,716 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:31,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 03:42:31,718 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:31,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1832465533, now seen corresponding path program 1 times [2023-11-30 03:42:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:31,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895008161] [2023-11-30 03:42:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:32,302 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-30 03:42:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895008161] [2023-11-30 03:42:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895008161] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:42:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824657569] [2023-11-30 03:42:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:32,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:32,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:42:32,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:42:32,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-30 03:42:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:32,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-30 03:42:32,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:42:32,462 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-30 03:42:32,500 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:42:32,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 03:42:32,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 03:42:32,558 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-30 03:42:32,606 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-30 03:42:32,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:32,623 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-30 03:42:32,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:32,645 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-30 03:42:32,673 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-30 03:42:32,683 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-30 03:42:32,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:42:32,714 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 3 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2023-11-30 03:42:32,733 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset))) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:42:32,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 3 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) c_threadThread1of1ForFork0_~t~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_192) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:42:32,859 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-30 03:42:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 03:42:32,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824657569] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:42:32,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:42:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2023-11-30 03:42:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931691275] [2023-11-30 03:42:32,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:42:32,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 03:42:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:32,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 03:42:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2023-11-30 03:42:32,878 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2023-11-30 03:42:32,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 489 transitions, 3594 flow. Second operand has 19 states, 19 states have (on average 49.31578947368421) internal successors, (937), 19 states have internal predecessors, (937), 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-30 03:42:32,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:32,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2023-11-30 03:42:32,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:35,049 INFO L124 PetriNetUnfolderBase]: 1168/3081 cut-off events. [2023-11-30 03:42:35,050 INFO L125 PetriNetUnfolderBase]: For 1691/1788 co-relation queries the response was YES. [2023-11-30 03:42:35,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11910 conditions, 3081 events. 1168/3081 cut-off events. For 1691/1788 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 22366 event pairs, 20 based on Foata normal form. 15/2911 useless extension candidates. Maximal degree in co-relation 11441. Up to 1621 conditions per place. [2023-11-30 03:42:35,069 INFO L140 encePairwiseOnDemand]: 87/122 looper letters, 505 selfloop transitions, 201 changer transitions 120/874 dead transitions. [2023-11-30 03:42:35,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 874 transitions, 7840 flow [2023-11-30 03:42:35,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-30 03:42:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-30 03:42:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1885 transitions. [2023-11-30 03:42:35,075 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4984135378106822 [2023-11-30 03:42:35,075 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 1885 transitions. [2023-11-30 03:42:35,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 1885 transitions. [2023-11-30 03:42:35,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:35,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 1885 transitions. [2023-11-30 03:42:35,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 60.806451612903224) internal successors, (1885), 31 states have internal predecessors, (1885), 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-30 03:42:35,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-30 03:42:35,086 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-30 03:42:35,086 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 50 predicate places. [2023-11-30 03:42:35,086 INFO L500 AbstractCegarLoop]: Abstraction has has 171 places, 874 transitions, 7840 flow [2023-11-30 03:42:35,087 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 49.31578947368421) internal successors, (937), 19 states have internal predecessors, (937), 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-30 03:42:35,087 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:35,087 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:35,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 03:42:35,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:35,293 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:35,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:35,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1664169463, now seen corresponding path program 1 times [2023-11-30 03:42:35,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:35,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108224203] [2023-11-30 03:42:35,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:35,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:42:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108224203] [2023-11-30 03:42:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108224203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:42:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387203975] [2023-11-30 03:42:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:35,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:42:35,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:42:35,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-30 03:42:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:35,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 03:42:35,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:42:35,923 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-30 03:42:35,944 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:42:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 03:42:35,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 03:42:36,103 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-30 03:42:36,134 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-30 03:42:36,170 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-30 03:42:36,213 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-30 03:42:36,342 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-30 03:42:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:42:36,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:42:36,388 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))) is different from false [2023-11-30 03:42:36,432 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0))) is different from false [2023-11-30 03:42:36,446 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0))))) is different from false [2023-11-30 03:42:36,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_292 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_292) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-30 03:42:36,541 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-30 03:42:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-30 03:42:36,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387203975] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:42:36,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:42:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 30 [2023-11-30 03:42:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59865126] [2023-11-30 03:42:36,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:42:36,565 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-30 03:42:36,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:36,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-30 03:42:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=605, Unknown=4, NotChecked=212, Total=930 [2023-11-30 03:42:36,570 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122 [2023-11-30 03:42:36,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 874 transitions, 7840 flow. Second operand has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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-30 03:42:36,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:36,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122 [2023-11-30 03:42:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:38,319 INFO L124 PetriNetUnfolderBase]: 1144/3007 cut-off events. [2023-11-30 03:42:38,319 INFO L125 PetriNetUnfolderBase]: For 2277/2589 co-relation queries the response was YES. [2023-11-30 03:42:38,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13908 conditions, 3007 events. 1144/3007 cut-off events. For 2277/2589 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 21577 event pairs, 64 based on Foata normal form. 26/2871 useless extension candidates. Maximal degree in co-relation 13354. Up to 1592 conditions per place. [2023-11-30 03:42:38,341 INFO L140 encePairwiseOnDemand]: 106/122 looper letters, 622 selfloop transitions, 34 changer transitions 144/856 dead transitions. [2023-11-30 03:42:38,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 856 transitions, 9234 flow [2023-11-30 03:42:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-30 03:42:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-30 03:42:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1211 transitions. [2023-11-30 03:42:38,345 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.49631147540983606 [2023-11-30 03:42:38,345 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1211 transitions. [2023-11-30 03:42:38,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1211 transitions. [2023-11-30 03:42:38,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:38,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1211 transitions. [2023-11-30 03:42:38,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 60.55) internal successors, (1211), 20 states have internal predecessors, (1211), 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-30 03:42:38,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 122.0) internal successors, (2562), 21 states have internal predecessors, (2562), 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-30 03:42:38,352 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 122.0) internal successors, (2562), 21 states have internal predecessors, (2562), 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-30 03:42:38,355 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places. [2023-11-30 03:42:38,355 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 856 transitions, 9234 flow [2023-11-30 03:42:38,356 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 52.29032258064516) internal successors, (1621), 31 states have internal predecessors, (1621), 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-30 03:42:38,356 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:38,356 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:38,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 03:42:38,562 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-30 03:42:38,562 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:38,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:38,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1234583565, now seen corresponding path program 1 times [2023-11-30 03:42:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:38,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144943283] [2023-11-30 03:42:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:42:38,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:38,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144943283] [2023-11-30 03:42:38,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144943283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:38,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:38,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:38,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880621443] [2023-11-30 03:42:38,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:38,849 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:38,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:38,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:38,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:38,850 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 122 [2023-11-30 03:42:38,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 856 transitions, 9234 flow. Second operand has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 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-30 03:42:38,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:38,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 122 [2023-11-30 03:42:38,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:39,582 INFO L124 PetriNetUnfolderBase]: 1198/3114 cut-off events. [2023-11-30 03:42:39,582 INFO L125 PetriNetUnfolderBase]: For 4088/4236 co-relation queries the response was YES. [2023-11-30 03:42:39,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16366 conditions, 3114 events. 1198/3114 cut-off events. For 4088/4236 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 22418 event pairs, 76 based on Foata normal form. 3/2959 useless extension candidates. Maximal degree in co-relation 15732. Up to 1772 conditions per place. [2023-11-30 03:42:39,611 INFO L140 encePairwiseOnDemand]: 111/122 looper letters, 520 selfloop transitions, 57 changer transitions 190/909 dead transitions. [2023-11-30 03:42:39,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 909 transitions, 11321 flow [2023-11-30 03:42:39,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions. [2023-11-30 03:42:39,614 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.639344262295082 [2023-11-30 03:42:39,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 468 transitions. [2023-11-30 03:42:39,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions. [2023-11-30 03:42:39,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:39,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions. [2023-11-30 03:42:39,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 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-30 03:42:39,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:39,616 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-30 03:42:39,617 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 72 predicate places. [2023-11-30 03:42:39,617 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 909 transitions, 11321 flow [2023-11-30 03:42:39,617 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.33333333333333) internal successors, (410), 6 states have internal predecessors, (410), 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-30 03:42:39,618 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:39,618 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:39,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 03:42:39,618 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2023-11-30 03:42:39,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -767136527, now seen corresponding path program 1 times [2023-11-30 03:42:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305575025] [2023-11-30 03:42:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:42:39,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 03:42:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 03:42:39,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 03:42:39,713 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 03:42:39,714 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-11-30 03:42:39,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2023-11-30 03:42:39,715 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2023-11-30 03:42:39,716 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2023-11-30 03:42:39,716 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 03:42:39,717 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:39,720 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 03:42:39,720 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 03:42:39,742 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 03:42:39,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow [2023-11-30 03:42:39,776 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2023-11-30 03:42:39,776 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 03:42:39,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 764 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. [2023-11-30 03:42:39,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow [2023-11-30 03:42:39,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow [2023-11-30 03:42:39,781 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 03:42:39,784 INFO L362 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=PETRI_NET, 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;@44ebf49e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 03:42:39,784 INFO L363 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-30 03:42:39,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 03:42:39,787 INFO L124 PetriNetUnfolderBase]: 3/43 cut-off events. [2023-11-30 03:42:39,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 03:42:39,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:39,787 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:39,787 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:39,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2078961544, now seen corresponding path program 1 times [2023-11-30 03:42:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872691285] [2023-11-30 03:42:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:39,958 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-30 03:42:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872691285] [2023-11-30 03:42:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872691285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77330529] [2023-11-30 03:42:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:39,962 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:39,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:39,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:39,963 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 140 [2023-11-30 03:42:39,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-30 03:42:39,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:39,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 140 [2023-11-30 03:42:39,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:41,405 INFO L124 PetriNetUnfolderBase]: 5730/12322 cut-off events. [2023-11-30 03:42:41,405 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2023-11-30 03:42:41,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21874 conditions, 12322 events. 5730/12322 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 102531 event pairs, 2310 based on Foata normal form. 122/10884 useless extension candidates. Maximal degree in co-relation 14254. Up to 7546 conditions per place. [2023-11-30 03:42:41,482 INFO L140 encePairwiseOnDemand]: 116/140 looper letters, 111 selfloop transitions, 43 changer transitions 1/231 dead transitions. [2023-11-30 03:42:41,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 231 transitions, 794 flow [2023-11-30 03:42:41,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions. [2023-11-30 03:42:41,485 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7416666666666667 [2023-11-30 03:42:41,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 623 transitions. [2023-11-30 03:42:41,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions. [2023-11-30 03:42:41,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:41,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions. [2023-11-30 03:42:41,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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-30 03:42:41,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:41,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:41,490 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 5 predicate places. [2023-11-30 03:42:41,490 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 231 transitions, 794 flow [2023-11-30 03:42:41,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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-30 03:42:41,490 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:41,490 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:41,490 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 03:42:41,490 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:41,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1521651250, now seen corresponding path program 1 times [2023-11-30 03:42:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692955441] [2023-11-30 03:42:41,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:41,535 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-30 03:42:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692955441] [2023-11-30 03:42:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692955441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:41,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058241644] [2023-11-30 03:42:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:41,537 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 03:42:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 03:42:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 03:42:41,539 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2023-11-30 03:42:41,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 231 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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-30 03:42:41,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:41,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2023-11-30 03:42:41,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:42,735 INFO L124 PetriNetUnfolderBase]: 5730/12215 cut-off events. [2023-11-30 03:42:42,736 INFO L125 PetriNetUnfolderBase]: For 425/463 co-relation queries the response was YES. [2023-11-30 03:42:42,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22569 conditions, 12215 events. 5730/12215 cut-off events. For 425/463 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 101290 event pairs, 2310 based on Foata normal form. 0/10663 useless extension candidates. Maximal degree in co-relation 14606. Up to 7555 conditions per place. [2023-11-30 03:42:43,015 INFO L140 encePairwiseOnDemand]: 132/140 looper letters, 41 selfloop transitions, 6 changer transitions 2/241 dead transitions. [2023-11-30 03:42:43,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 241 transitions, 912 flow [2023-11-30 03:42:43,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 683 transitions. [2023-11-30 03:42:43,017 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8130952380952381 [2023-11-30 03:42:43,018 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 683 transitions. [2023-11-30 03:42:43,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 683 transitions. [2023-11-30 03:42:43,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:43,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 683 transitions. [2023-11-30 03:42:43,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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-30 03:42:43,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:43,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:43,022 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2023-11-30 03:42:43,022 INFO L500 AbstractCegarLoop]: Abstraction has has 150 places, 241 transitions, 912 flow [2023-11-30 03:42:43,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 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-30 03:42:43,023 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:43,023 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:43,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 03:42:43,023 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:43,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash -789065557, now seen corresponding path program 1 times [2023-11-30 03:42:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:43,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240199000] [2023-11-30 03:42:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:43,183 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-30 03:42:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240199000] [2023-11-30 03:42:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240199000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:43,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:43,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760753562] [2023-11-30 03:42:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:43,184 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:43,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:43,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:43,185 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 140 [2023-11-30 03:42:43,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 241 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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-30 03:42:43,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:43,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 140 [2023-11-30 03:42:43,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:45,507 INFO L124 PetriNetUnfolderBase]: 9180/18797 cut-off events. [2023-11-30 03:42:45,508 INFO L125 PetriNetUnfolderBase]: For 1547/1645 co-relation queries the response was YES. [2023-11-30 03:42:45,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49674 conditions, 18797 events. 9180/18797 cut-off events. For 1547/1645 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 157899 event pairs, 1727 based on Foata normal form. 6/16643 useless extension candidates. Maximal degree in co-relation 31606. Up to 12089 conditions per place. [2023-11-30 03:42:45,628 INFO L140 encePairwiseOnDemand]: 113/140 looper letters, 220 selfloop transitions, 108 changer transitions 7/418 dead transitions. [2023-11-30 03:42:45,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 418 transitions, 2297 flow [2023-11-30 03:42:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2023-11-30 03:42:45,630 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-30 03:42:45,630 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2023-11-30 03:42:45,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2023-11-30 03:42:45,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:45,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2023-11-30 03:42:45,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 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-30 03:42:45,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:45,634 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:45,634 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 15 predicate places. [2023-11-30 03:42:45,634 INFO L500 AbstractCegarLoop]: Abstraction has has 155 places, 418 transitions, 2297 flow [2023-11-30 03:42:45,634 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 states have internal predecessors, (465), 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-30 03:42:45,635 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:45,635 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:45,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 03:42:45,635 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:45,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -468383767, now seen corresponding path program 1 times [2023-11-30 03:42:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156471940] [2023-11-30 03:42:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:45,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:45,916 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-30 03:42:45,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:45,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156471940] [2023-11-30 03:42:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156471940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:42:45,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:42:45,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:42:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619247576] [2023-11-30 03:42:45,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:42:45,917 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:42:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:45,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:42:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:42:45,919 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 140 [2023-11-30 03:42:45,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 418 transitions, 2297 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-30 03:42:45,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:45,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 140 [2023-11-30 03:42:45,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:50,071 INFO L124 PetriNetUnfolderBase]: 18236/35559 cut-off events. [2023-11-30 03:42:50,071 INFO L125 PetriNetUnfolderBase]: For 7287/7566 co-relation queries the response was YES. [2023-11-30 03:42:50,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116130 conditions, 35559 events. 18236/35559 cut-off events. For 7287/7566 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 321198 event pairs, 2768 based on Foata normal form. 36/32069 useless extension candidates. Maximal degree in co-relation 25980. Up to 22824 conditions per place. [2023-11-30 03:42:50,325 INFO L140 encePairwiseOnDemand]: 105/140 looper letters, 412 selfloop transitions, 319 changer transitions 10/834 dead transitions. [2023-11-30 03:42:50,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 834 transitions, 6423 flow [2023-11-30 03:42:50,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:42:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:42:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-11-30 03:42:50,328 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2023-11-30 03:42:50,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-11-30 03:42:50,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-11-30 03:42:50,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:50,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-11-30 03:42:50,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 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-30 03:42:50,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:50,334 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:42:50,334 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 20 predicate places. [2023-11-30 03:42:50,335 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 834 transitions, 6423 flow [2023-11-30 03:42:50,335 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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-30 03:42:50,335 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:50,335 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:50,335 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 03:42:50,335 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:50,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1503340799, now seen corresponding path program 1 times [2023-11-30 03:42:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:50,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495012180] [2023-11-30 03:42:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:50,812 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-30 03:42:50,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:42:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495012180] [2023-11-30 03:42:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495012180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:42:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209232405] [2023-11-30 03:42:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:50,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:50,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:42:50,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:42:50,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-30 03:42:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:42:50,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-30 03:42:50,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:42:50,947 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-30 03:42:50,955 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:42:50,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 03:42:50,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 03:42:50,991 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-30 03:42:51,022 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-30 03:42:51,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:51,032 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-30 03:42:51,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:42:51,054 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-30 03:42:51,070 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-30 03:42:51,077 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-30 03:42:51,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:42:51,095 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-30 03:42:51,107 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_580 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_580) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-30 03:42:51,211 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-30 03:42:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-30 03:42:51,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209232405] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:42:51,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:42:51,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 16 [2023-11-30 03:42:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744659999] [2023-11-30 03:42:51,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:42:51,229 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-30 03:42:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:42:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-30 03:42:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=173, Unknown=2, NotChecked=54, Total=272 [2023-11-30 03:42:51,232 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 140 [2023-11-30 03:42:51,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 834 transitions, 6423 flow. Second operand has 17 states, 17 states have (on average 59.35294117647059) internal successors, (1009), 17 states have internal predecessors, (1009), 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-30 03:42:51,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:42:51,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 140 [2023-11-30 03:42:51,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:42:59,179 INFO L124 PetriNetUnfolderBase]: 27603/51061 cut-off events. [2023-11-30 03:42:59,179 INFO L125 PetriNetUnfolderBase]: For 25779/30335 co-relation queries the response was YES. [2023-11-30 03:42:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203245 conditions, 51061 events. 27603/51061 cut-off events. For 25779/30335 co-relation queries the response was YES. Maximal size of possible extension queue 1485. Compared 465363 event pairs, 2736 based on Foata normal form. 113/46703 useless extension candidates. Maximal degree in co-relation 140136. Up to 30905 conditions per place. [2023-11-30 03:42:59,569 INFO L140 encePairwiseOnDemand]: 101/140 looper letters, 1467 selfloop transitions, 718 changer transitions 50/2295 dead transitions. [2023-11-30 03:42:59,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 2295 transitions, 21925 flow [2023-11-30 03:42:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-30 03:42:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-30 03:42:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2337 transitions. [2023-11-30 03:42:59,579 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5384792626728111 [2023-11-30 03:42:59,579 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2337 transitions. [2023-11-30 03:42:59,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2337 transitions. [2023-11-30 03:42:59,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:42:59,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2337 transitions. [2023-11-30 03:42:59,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 75.38709677419355) internal successors, (2337), 31 states have internal predecessors, (2337), 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-30 03:42:59,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-30 03:42:59,597 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 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-30 03:42:59,597 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 50 predicate places. [2023-11-30 03:42:59,597 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 2295 transitions, 21925 flow [2023-11-30 03:42:59,598 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 59.35294117647059) internal successors, (1009), 17 states have internal predecessors, (1009), 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-30 03:42:59,598 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:42:59,598 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:42:59,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-30 03:42:59,806 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:42:59,807 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:42:59,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:42:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 459975355, now seen corresponding path program 1 times [2023-11-30 03:42:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:42:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281756414] [2023-11-30 03:42:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:42:59,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:42:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:00,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:43:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281756414] [2023-11-30 03:43:00,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281756414] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:43:00,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604333097] [2023-11-30 03:43:00,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:00,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:00,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:43:00,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:43:00,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-30 03:43:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:00,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-30 03:43:00,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:43:00,319 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-30 03:43:00,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 03:43:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 03:43:00,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-30 03:43:00,518 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-30 03:43:00,548 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-30 03:43:00,576 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-30 03:43:00,620 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-30 03:43:00,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:43:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 03:43:00,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:43:00,700 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))) is different from false [2023-11-30 03:43:00,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0))))) is different from false [2023-11-30 03:43:00,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#ts~0#1.offset|)) (.cse2 (+ 3 |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) (+ |c_ULTIMATE.start_main_~#ts~0#1.offset| 1)))) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|) 0)) (forall ((v_ArrVal_680 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_680) |c_ULTIMATE.start_main_~#ts~0#1.base|) .cse2) 0))))) is different from false [2023-11-30 03:43:00,811 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-30 03:43:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-30 03:43:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604333097] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:43:00,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:43:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2023-11-30 03:43:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350757199] [2023-11-30 03:43:00,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:43:00,831 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-30 03:43:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:43:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-30 03:43:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870 [2023-11-30 03:43:00,834 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140 [2023-11-30 03:43:00,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 2295 transitions, 21925 flow. Second operand has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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-30 03:43:00,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:43:00,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140 [2023-11-30 03:43:00,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:43:14,818 INFO L124 PetriNetUnfolderBase]: 31515/58267 cut-off events. [2023-11-30 03:43:14,818 INFO L125 PetriNetUnfolderBase]: For 38987/43383 co-relation queries the response was YES. [2023-11-30 03:43:14,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281247 conditions, 58267 events. 31515/58267 cut-off events. For 38987/43383 co-relation queries the response was YES. Maximal size of possible extension queue 1638. Compared 534917 event pairs, 2318 based on Foata normal form. 540/53969 useless extension candidates. Maximal degree in co-relation 242795. Up to 35531 conditions per place. [2023-11-30 03:43:15,215 INFO L140 encePairwiseOnDemand]: 112/140 looper letters, 2428 selfloop transitions, 901 changer transitions 70/3473 dead transitions. [2023-11-30 03:43:15,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 3473 transitions, 40177 flow [2023-11-30 03:43:15,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-30 03:43:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-11-30 03:43:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2428 transitions. [2023-11-30 03:43:15,220 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5419642857142857 [2023-11-30 03:43:15,220 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2428 transitions. [2023-11-30 03:43:15,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2428 transitions. [2023-11-30 03:43:15,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:43:15,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2428 transitions. [2023-11-30 03:43:15,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 75.875) internal successors, (2428), 32 states have internal predecessors, (2428), 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-30 03:43:15,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 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-30 03:43:15,231 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 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-30 03:43:15,231 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 81 predicate places. [2023-11-30 03:43:15,231 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 3473 transitions, 40177 flow [2023-11-30 03:43:15,232 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 61.3) internal successors, (1839), 30 states have internal predecessors, (1839), 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-30 03:43:15,232 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:43:15,232 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:43:15,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 03:43:15,437 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:15,437 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:43:15,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:43:15,438 INFO L85 PathProgramCache]: Analyzing trace with hash 429703151, now seen corresponding path program 1 times [2023-11-30 03:43:15,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:43:15,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505992244] [2023-11-30 03:43:15,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:43:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 03:43:15,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:43:15,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505992244] [2023-11-30 03:43:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505992244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 03:43:15,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 03:43:15,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 03:43:15,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951564876] [2023-11-30 03:43:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 03:43:15,666 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 03:43:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:43:15,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 03:43:15,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-30 03:43:15,667 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 140 [2023-11-30 03:43:15,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 3473 transitions, 40177 flow. Second operand has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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-30 03:43:15,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:43:15,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 140 [2023-11-30 03:43:15,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:43:33,102 INFO L124 PetriNetUnfolderBase]: 33878/61959 cut-off events. [2023-11-30 03:43:33,102 INFO L125 PetriNetUnfolderBase]: For 58046/63369 co-relation queries the response was YES. [2023-11-30 03:43:33,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341084 conditions, 61959 events. 33878/61959 cut-off events. For 58046/63369 co-relation queries the response was YES. Maximal size of possible extension queue 1684. Compared 561628 event pairs, 2758 based on Foata normal form. 42/56769 useless extension candidates. Maximal degree in co-relation 167783. Up to 39843 conditions per place. [2023-11-30 03:43:33,643 INFO L140 encePairwiseOnDemand]: 125/140 looper letters, 3123 selfloop transitions, 307 changer transitions 83/3827 dead transitions. [2023-11-30 03:43:33,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 3827 transitions, 51492 flow [2023-11-30 03:43:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 03:43:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 03:43:33,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2023-11-30 03:43:33,644 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6702380952380952 [2023-11-30 03:43:33,644 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 563 transitions. [2023-11-30 03:43:33,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 563 transitions. [2023-11-30 03:43:33,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:43:33,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 563 transitions. [2023-11-30 03:43:33,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 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-30 03:43:33,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:43:33,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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-30 03:43:33,648 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 86 predicate places. [2023-11-30 03:43:33,648 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 3827 transitions, 51492 flow [2023-11-30 03:43:33,648 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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-30 03:43:33,648 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:43:33,648 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:43:33,648 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 03:43:33,649 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:43:33,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:43:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1587439492, now seen corresponding path program 1 times [2023-11-30 03:43:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:43:33,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503994381] [2023-11-30 03:43:33,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:43:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:34,040 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-30 03:43:34,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:43:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503994381] [2023-11-30 03:43:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503994381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:43:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727846746] [2023-11-30 03:43:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:43:34,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:43:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:43:34,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:43:34,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-30 03:43:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:43:34,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-30 03:43:34,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:43:34,217 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-30 03:43:34,298 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-30 03:43:34,318 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-30 03:43:34,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:34,353 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-30 03:43:34,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:43:34,388 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-30 03:43:34,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:43:34,426 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-30 03:43:34,432 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-30 03:43:34,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:43:34,456 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-30 03:43:34,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false [2023-11-30 03:43:34,481 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_823 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_823) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:43:34,625 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-30 03:43:34,659 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-30 03:43:34,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727846746] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:43:34,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:43:34,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2023-11-30 03:43:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087409516] [2023-11-30 03:43:34,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:43:34,660 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-30 03:43:34,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:43:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-30 03:43:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=763, Unknown=3, NotChecked=174, Total=1056 [2023-11-30 03:43:34,662 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 140 [2023-11-30 03:43:34,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 3827 transitions, 51492 flow. Second operand has 33 states, 33 states have (on average 60.78787878787879) internal successors, (2006), 33 states have internal predecessors, (2006), 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-30 03:43:34,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:43:34,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 140 [2023-11-30 03:43:34,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:44:01,360 INFO L124 PetriNetUnfolderBase]: 38199/68923 cut-off events. [2023-11-30 03:44:01,360 INFO L125 PetriNetUnfolderBase]: For 89957/103086 co-relation queries the response was YES. [2023-11-30 03:44:01,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443045 conditions, 68923 events. 38199/68923 cut-off events. For 89957/103086 co-relation queries the response was YES. Maximal size of possible extension queue 1881. Compared 625406 event pairs, 3079 based on Foata normal form. 290/63566 useless extension candidates. Maximal degree in co-relation 203199. Up to 45416 conditions per place. [2023-11-30 03:44:01,965 INFO L140 encePairwiseOnDemand]: 106/140 looper letters, 3612 selfloop transitions, 1131 changer transitions 111/4941 dead transitions. [2023-11-30 03:44:01,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 4941 transitions, 76139 flow [2023-11-30 03:44:01,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-30 03:44:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-30 03:44:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1817 transitions. [2023-11-30 03:44:01,967 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5642857142857143 [2023-11-30 03:44:01,967 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1817 transitions. [2023-11-30 03:44:01,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1817 transitions. [2023-11-30 03:44:01,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:44:01,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1817 transitions. [2023-11-30 03:44:01,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 79.0) internal successors, (1817), 23 states have internal predecessors, (1817), 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-30 03:44:01,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-30 03:44:01,974 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 140.0) internal successors, (3360), 24 states have internal predecessors, (3360), 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-30 03:44:01,974 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 108 predicate places. [2023-11-30 03:44:01,975 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 4941 transitions, 76139 flow [2023-11-30 03:44:01,975 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 60.78787878787879) internal successors, (2006), 33 states have internal predecessors, (2006), 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-30 03:44:01,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:44:01,975 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:44:01,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 03:44:02,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 03:44:02,181 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:44:02,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:44:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -221187049, now seen corresponding path program 1 times [2023-11-30 03:44:02,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:44:02,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663943506] [2023-11-30 03:44:02,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:44:02,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:44:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:44:02,565 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-30 03:44:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:44:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663943506] [2023-11-30 03:44:02,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663943506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:44:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652315138] [2023-11-30 03:44:02,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:44:02,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:44:02,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:44:02,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:44:02,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-30 03:44:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:44:02,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-30 03:44:02,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:44:02,934 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-30 03:44:03,090 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-30 03:44:03,114 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-30 03:44:03,148 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-30 03:44:03,189 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-30 03:44:03,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:44:03,234 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-30 03:44:03,264 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-30 03:44:03,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:44:03,282 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false [2023-11-30 03:44:03,296 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))))) is different from false [2023-11-30 03:44:03,310 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_923) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false [2023-11-30 03:44:03,447 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-30 03:44:03,479 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-30 03:44:03,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652315138] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:44:03,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:44:03,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2023-11-30 03:44:03,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225936686] [2023-11-30 03:44:03,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:44:03,480 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-30 03:44:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:44:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-30 03:44:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190 [2023-11-30 03:44:03,482 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140 [2023-11-30 03:44:03,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 4941 transitions, 76139 flow. Second operand has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 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-30 03:44:03,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:44:03,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140 [2023-11-30 03:44:03,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:44:43,292 INFO L124 PetriNetUnfolderBase]: 45276/81574 cut-off events. [2023-11-30 03:44:43,293 INFO L125 PetriNetUnfolderBase]: For 133197/147146 co-relation queries the response was YES. [2023-11-30 03:44:43,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595291 conditions, 81574 events. 45276/81574 cut-off events. For 133197/147146 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 754158 event pairs, 3572 based on Foata normal form. 186/75165 useless extension candidates. Maximal degree in co-relation 422633. Up to 54922 conditions per place. [2023-11-30 03:44:44,070 INFO L140 encePairwiseOnDemand]: 107/140 looper letters, 4909 selfloop transitions, 1472 changer transitions 151/6639 dead transitions. [2023-11-30 03:44:44,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 6639 transitions, 116065 flow [2023-11-30 03:44:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-30 03:44:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-30 03:44:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1754 transitions. [2023-11-30 03:44:44,073 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5694805194805195 [2023-11-30 03:44:44,073 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1754 transitions. [2023-11-30 03:44:44,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1754 transitions. [2023-11-30 03:44:44,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:44:44,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1754 transitions. [2023-11-30 03:44:44,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 79.72727272727273) internal successors, (1754), 22 states have internal predecessors, (1754), 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-30 03:44:44,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 140.0) internal successors, (3220), 23 states have internal predecessors, (3220), 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-30 03:44:44,079 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 140.0) internal successors, (3220), 23 states have internal predecessors, (3220), 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-30 03:44:44,080 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 129 predicate places. [2023-11-30 03:44:44,080 INFO L500 AbstractCegarLoop]: Abstraction has has 269 places, 6639 transitions, 116065 flow [2023-11-30 03:44:44,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 62.68571428571428) internal successors, (2194), 35 states have internal predecessors, (2194), 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-30 03:44:44,081 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:44:44,081 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:44:44,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-30 03:44:44,286 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 03:44:44,286 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:44:44,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:44:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash -387163283, now seen corresponding path program 2 times [2023-11-30 03:44:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:44:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967467258] [2023-11-30 03:44:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:44:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:44:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:44:44,778 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-30 03:44:44,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:44:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967467258] [2023-11-30 03:44:44,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967467258] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:44:44,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400344759] [2023-11-30 03:44:44,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 03:44:44,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:44:44,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:44:44,780 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:44:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-30 03:44:44,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 03:44:44,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 03:44:44,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-30 03:44:44,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:44:45,014 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-30 03:44:45,042 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-30 03:44:45,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2023-11-30 03:44:45,066 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 03:44:45,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-30 03:44:45,110 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-30 03:44:45,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-30 03:44:45,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-30 03:44:45,266 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 24 treesize of output 12 [2023-11-30 03:44:45,904 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-30 03:44:45,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-30 03:44:45,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-30 03:44:46,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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-30 03:44:46,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2023-11-30 03:44:46,165 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-30 03:44:46,196 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-30 03:44:46,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:44:46,220 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false [2023-11-30 03:44:46,259 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false [2023-11-30 03:44:46,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:44:46,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#ts~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:44:46,693 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-30 03:44:46,695 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-30 03:44:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-30 03:44:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400344759] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:44:46,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:44:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 19] total 51 [2023-11-30 03:44:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473479815] [2023-11-30 03:44:46,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:44:46,885 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-30 03:44:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:44:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-30 03:44:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2037, Unknown=4, NotChecked=380, Total=2652 [2023-11-30 03:44:46,888 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 140 [2023-11-30 03:44:46,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 6639 transitions, 116065 flow. Second operand has 52 states, 52 states have (on average 40.75) internal successors, (2119), 52 states have internal predecessors, (2119), 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-30 03:44:46,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:44:46,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 140 [2023-11-30 03:44:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 03:47:20,193 INFO L124 PetriNetUnfolderBase]: 105836/188093 cut-off events. [2023-11-30 03:47:20,193 INFO L125 PetriNetUnfolderBase]: For 407712/428114 co-relation queries the response was YES. [2023-11-30 03:47:20,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535363 conditions, 188093 events. 105836/188093 cut-off events. For 407712/428114 co-relation queries the response was YES. Maximal size of possible extension queue 4591. Compared 1908789 event pairs, 5456 based on Foata normal form. 1464/175363 useless extension candidates. Maximal degree in co-relation 572957. Up to 127544 conditions per place. [2023-11-30 03:47:22,417 INFO L140 encePairwiseOnDemand]: 98/140 looper letters, 10956 selfloop transitions, 6630 changer transitions 324/17949 dead transitions. [2023-11-30 03:47:22,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 17949 transitions, 348746 flow [2023-11-30 03:47:22,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-11-30 03:47:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2023-11-30 03:47:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 5837 transitions. [2023-11-30 03:47:22,427 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.37902597402597404 [2023-11-30 03:47:22,427 INFO L72 ComplementDD]: Start complementDD. Operand 110 states and 5837 transitions. [2023-11-30 03:47:22,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 5837 transitions. [2023-11-30 03:47:22,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 03:47:22,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 110 states and 5837 transitions. [2023-11-30 03:47:22,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 111 states, 110 states have (on average 53.06363636363636) internal successors, (5837), 110 states have internal predecessors, (5837), 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-30 03:47:22,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 111 states, 111 states have (on average 140.0) internal successors, (15540), 111 states have internal predecessors, (15540), 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-30 03:47:22,457 INFO L81 ComplementDD]: Finished complementDD. Result has 111 states, 111 states have (on average 140.0) internal successors, (15540), 111 states have internal predecessors, (15540), 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-30 03:47:22,458 INFO L307 CegarLoopForPetriNet]: 140 programPoint places, 238 predicate places. [2023-11-30 03:47:22,458 INFO L500 AbstractCegarLoop]: Abstraction has has 378 places, 17949 transitions, 348746 flow [2023-11-30 03:47:22,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 40.75) internal successors, (2119), 52 states have internal predecessors, (2119), 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-30 03:47:22,459 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 03:47:22,459 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:47:22,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-30 03:47:22,667 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:22,668 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2023-11-30 03:47:22,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 03:47:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1109845327, now seen corresponding path program 1 times [2023-11-30 03:47:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 03:47:22,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477125665] [2023-11-30 03:47:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:47:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 03:47:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:47:23,333 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-30 03:47:23,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 03:47:23,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477125665] [2023-11-30 03:47:23,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477125665] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 03:47:23,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126278552] [2023-11-30 03:47:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 03:47:23,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:47:23,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 03:47:23,336 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 03:47:23,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 03:47:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 03:47:23,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 03:47:23,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 03:47:23,499 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-30 03:47:23,533 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-30 03:47:23,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-30 03:47:23,623 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-30 03:47:23,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 23 treesize of output 33 [2023-11-30 03:47:23,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 03:47:23,679 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-30 03:47:23,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2023-11-30 03:47:24,002 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-11-30 03:47:24,002 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 62 treesize of output 62 [2023-11-30 03:47:24,020 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 24 treesize of output 18 [2023-11-30 03:47:24,329 INFO L349 Elim1Store]: treesize reduction 36, result has 29.4 percent of original size [2023-11-30 03:47:24,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 3 case distinctions, treesize of input 71 treesize of output 63 [2023-11-30 03:47:24,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:24,551 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 70 treesize of output 50 [2023-11-30 03:47:24,573 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-30 03:47:24,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 21 treesize of output 20 [2023-11-30 03:47:24,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:24,588 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-30 03:47:24,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:24,600 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-30 03:47:24,619 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-30 03:47:24,626 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-30 03:47:24,626 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 03:47:24,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false [2023-11-30 03:47:24,762 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1158 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1158) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false [2023-11-30 03:47:24,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false [2023-11-30 03:47:24,869 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:47:24,873 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false [2023-11-30 03:47:24,878 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false [2023-11-30 03:47:24,892 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) is different from false [2023-11-30 03:47:24,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1153 (Array Int Int)) (v_ArrVal_1152 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#ts~0#1.base|) |c_ULTIMATE.start_main_~#ts~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1152) .cse0 v_ArrVal_1153) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false [2023-11-30 03:47:25,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 03:47:25,103 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 241 treesize of output 144 [2023-11-30 03:47:25,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2023-11-30 03:47:25,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-11-30 03:47:25,328 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-30 03:47:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126278552] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 03:47:25,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 03:47:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 47 [2023-11-30 03:47:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047979911] [2023-11-30 03:47:25,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 03:47:25,329 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-30 03:47:25,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 03:47:25,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-30 03:47:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1402, Unknown=36, NotChecked=664, Total=2256 [2023-11-30 03:47:25,332 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140 [2023-11-30 03:47:25,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 17949 transitions, 348746 flow. Second operand has 48 states, 48 states have (on average 53.166666666666664) internal successors, (2552), 48 states have internal predecessors, (2552), 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-30 03:47:25,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 03:47:25,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140 [2023-11-30 03:47:25,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 03:55:27,033 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:55:27,045 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 03:55:27,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-30 03:55:27,563 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2023-11-30 03:55:27,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 03:55:27,763 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 03:55:27,764 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). [2023-11-30 03:55:27,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2023-11-30 03:55:27,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2023-11-30 03:55:27,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2023-11-30 03:55:27,764 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2023-11-30 03:55:27,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2023-11-30 03:55:27,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2023-11-30 03:55:27,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-30 03:55:27,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2023-11-30 03:55:27,765 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2023-11-30 03:55:27,765 INFO L457 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 03:55:27,768 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-11-30 03:55:27,768 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 03:55:27,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 03:55:27 BasicIcfg [2023-11-30 03:55:27,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 03:55:27,772 INFO L158 Benchmark]: Toolchain (without parser) took 780910.43ms. Allocated memory was 637.5MB in the beginning and 11.2GB in the end (delta: 10.5GB). Free memory was 585.4MB in the beginning and 7.2GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. [2023-11-30 03:55:27,772 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 373.3MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 03:55:27,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.95ms. Allocated memory is still 637.5MB. Free memory was 585.4MB in the beginning and 557.4MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 03:55:27,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.76ms. Allocated memory is still 637.5MB. Free memory was 557.4MB in the beginning and 554.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:55:27,772 INFO L158 Benchmark]: Boogie Preprocessor took 48.82ms. Allocated memory is still 637.5MB. Free memory was 554.6MB in the beginning and 552.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 03:55:27,773 INFO L158 Benchmark]: RCFGBuilder took 595.83ms. Allocated memory is still 637.5MB. Free memory was 552.6MB in the beginning and 593.3MB in the end (delta: -40.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 03:55:27,773 INFO L158 Benchmark]: TraceAbstraction took 779712.36ms. Allocated memory was 637.5MB in the beginning and 11.2GB in the end (delta: 10.5GB). Free memory was 592.3MB in the beginning and 7.2GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. [2023-11-30 03:55:27,774 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 373.3MB. Free memory is still 326.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 479.95ms. Allocated memory is still 637.5MB. Free memory was 585.4MB in the beginning and 557.4MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.76ms. Allocated memory is still 637.5MB. Free memory was 557.4MB in the beginning and 554.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 48.82ms. Allocated memory is still 637.5MB. Free memory was 554.6MB in the beginning and 552.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 595.83ms. Allocated memory is still 637.5MB. Free memory was 552.6MB in the beginning and 593.3MB in the end (delta: -40.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 779712.36ms. Allocated memory was 637.5MB in the beginning and 11.2GB in the end (delta: 10.5GB). Free memory was 592.3MB in the beginning and 7.2GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1038]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (48states, 51/140 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 1597942 conditions, 177377 events (101812/177376 cut-off events. For 628688/641493 co-relation queries the response was YES. Maximal size of possible extension queue 6291. Compared 1866249 event pairs, 4546 based on Foata normal form. 354/171672 useless extension candidates. Maximal degree in co-relation 533731. Up to 117384 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 136 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.5s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1454 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1454 mSDsluCounter, 1234 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2058 IncrementalHoareTripleChecker+Unchecked, 897 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4204 IncrementalHoareTripleChecker+Invalid, 6700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 337 mSDtfsCounter, 4204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 232 SyntacticMatches, 11 SemanticMatches, 110 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11321occurred in iteration=7, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 519 NumberOfCodeBlocks, 519 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 566 ConstructedInterpolants, 11 QuantifiedInterpolants, 3735 SizeOfPredicates, 16 NumberOfNonLiveVariables, 438 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 1/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 153 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 768.0s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 756.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8190 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8190 mSDsluCounter, 6039 SdHoareTripleChecker+Invalid, 13.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17646 IncrementalHoareTripleChecker+Unchecked, 5271 mSDsCounter, 1044 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29381 IncrementalHoareTripleChecker+Invalid, 48071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1044 mSolverCounterUnsat, 768 mSDtfsCounter, 29381 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1201 GetRequests, 680 SyntacticMatches, 57 SemanticMatches, 464 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 14369 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=348746occurred in iteration=10, InterpolantAutomatonStates: 248, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 989 NumberOfCodeBlocks, 989 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1355 ConstructedInterpolants, 91 QuantifiedInterpolants, 13711 SizeOfPredicates, 81 NumberOfNonLiveVariables, 1384 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 1/73 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown