/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:09:42,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:09:42,311 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 [2025-03-15 00:09:42,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:09:42,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:09:42,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:09:42,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:09:42,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:09:42,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:09:42,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:09:42,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:09:42,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:09:42,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:09:42,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:09:42,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:09:42,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All 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 [2025-03-15 00:09:42,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:09:42,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:09:42,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:09:42,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:09:42,635 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:09:42,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-15 00:09:43,973 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cff4b259/40c804a8cc2a4c4bb7bd1ccb461492be/FLAG4d642bf1b [2025-03-15 00:09:44,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:09:44,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/48_ticket_lock_low_contention_vs-pthread.i [2025-03-15 00:09:44,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cff4b259/40c804a8cc2a4c4bb7bd1ccb461492be/FLAG4d642bf1b [2025-03-15 00:09:44,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cff4b259/40c804a8cc2a4c4bb7bd1ccb461492be [2025-03-15 00:09:44,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:09:44,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:09:44,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:09:44,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:09:44,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:09:44,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6379ac4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44, skipping insertion in model container [2025-03-15 00:09:44,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:09:44,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:09:44,524 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:09:44,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:09:44,602 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:09:44,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44 WrapperNode [2025-03-15 00:09:44,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:09:44,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:09:44,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:09:44,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:09:44,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,642 INFO L138 Inliner]: procedures = 164, calls = 17, calls flagged for inlining = 4, calls inlined = 5, statements flattened = 86 [2025-03-15 00:09:44,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:09:44,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:09:44,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:09:44,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:09:44,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:09:44,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:09:44,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:09:44,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:09:44,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (1/1) ... [2025-03-15 00:09:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:09:44,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:09:44,713 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) [2025-03-15 00:09:44,721 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 [2025-03-15 00:09:44,752 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-15 00:09:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-15 00:09:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:09:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:09:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:09:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:09:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:09:44,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:09:44,754 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:09:44,848 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:09:44,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:09:45,003 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:09:45,003 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:09:45,028 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:09:45,028 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-15 00:09:45,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:09:45 BoogieIcfgContainer [2025-03-15 00:09:45,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:09:45,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:09:45,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:09:45,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:09:45,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:09:44" (1/3) ... [2025-03-15 00:09:45,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e465216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:09:45, skipping insertion in model container [2025-03-15 00:09:45,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:09:44" (2/3) ... [2025-03-15 00:09:45,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e465216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:09:45, skipping insertion in model container [2025-03-15 00:09:45,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:09:45" (3/3) ... [2025-03-15 00:09:45,040 INFO L128 eAbstractionObserver]: Analyzing ICFG 48_ticket_lock_low_contention_vs-pthread.i [2025-03-15 00:09:45,057 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:09:45,062 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 48_ticket_lock_low_contention_vs-pthread.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-15 00:09:45,062 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:09:45,105 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:09:45,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:09:45,148 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@67a76f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:09:45,148 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 00:09:45,176 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:09:45,176 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-03-15 00:09:45,178 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:09:45,178 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:45,179 INFO L221 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] [2025-03-15 00:09:45,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:09:45,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:45,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1383098230, now seen corresponding path program 1 times [2025-03-15 00:09:45,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:45,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559502574] [2025-03-15 00:09:45,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:45,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559502574] [2025-03-15 00:09:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559502574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102082020] [2025-03-15 00:09:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-15 00:09:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:45,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-15 00:09:45,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-15 00:09:45,371 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 99 [2025-03-15 00:09:45,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 202 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:09:45,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:45,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 99 [2025-03-15 00:09:45,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:45,443 INFO L124 PetriNetUnfolderBase]: 4/189 cut-off events. [2025-03-15 00:09:45,444 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:09:45,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 189 events. 4/189 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 550 event pairs, 4 based on Foata normal form. 16/181 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2025-03-15 00:09:45,451 INFO L140 encePairwiseOnDemand]: 94/99 looper letters, 5 selfloop transitions, 0 changer transitions 0/90 dead transitions. [2025-03-15 00:09:45,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 194 flow [2025-03-15 00:09:45,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-15 00:09:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-15 00:09:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2025-03-15 00:09:45,465 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9292929292929293 [2025-03-15 00:09:45,467 INFO L298 CegarLoopForPetriNet]: 97 programPoint places, -3 predicate places. [2025-03-15 00:09:45,468 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 194 flow [2025-03-15 00:09:45,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:09:45,468 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:45,468 INFO L221 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] [2025-03-15 00:09:45,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:09:45,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:09:45,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1979788872, now seen corresponding path program 1 times [2025-03-15 00:09:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:45,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491837630] [2025-03-15 00:09:45,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:45,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:45,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491837630] [2025-03-15 00:09:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491837630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:45,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:45,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675762079] [2025-03-15 00:09:45,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:45,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:45,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:45,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:45,549 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 99 [2025-03-15 00:09:45,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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) [2025-03-15 00:09:45,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:45,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 99 [2025-03-15 00:09:45,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:45,727 INFO L124 PetriNetUnfolderBase]: 181/739 cut-off events. [2025-03-15 00:09:45,727 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-15 00:09:45,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 739 events. 181/739 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4319 event pairs, 139 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 1123. Up to 354 conditions per place. [2025-03-15 00:09:45,731 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 34 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2025-03-15 00:09:45,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 304 flow [2025-03-15 00:09:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2025-03-15 00:09:45,737 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7946127946127947 [2025-03-15 00:09:45,737 INFO L298 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2025-03-15 00:09:45,738 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 304 flow [2025-03-15 00:09:45,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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) [2025-03-15 00:09:45,738 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:45,738 INFO L221 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] [2025-03-15 00:09:45,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:09:45,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:09:45,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:45,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1835186691, now seen corresponding path program 1 times [2025-03-15 00:09:45,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:45,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741065756] [2025-03-15 00:09:45,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:45,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741065756] [2025-03-15 00:09:45,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741065756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:45,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:45,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:45,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163430978] [2025-03-15 00:09:45,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:45,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:45,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:45,831 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 99 [2025-03-15 00:09:45,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 304 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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) [2025-03-15 00:09:45,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:45,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 99 [2025-03-15 00:09:45,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:46,002 INFO L124 PetriNetUnfolderBase]: 215/825 cut-off events. [2025-03-15 00:09:46,003 INFO L125 PetriNetUnfolderBase]: For 184/222 co-relation queries the response was YES. [2025-03-15 00:09:46,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 825 events. 215/825 cut-off events. For 184/222 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4903 event pairs, 135 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 1663. Up to 390 conditions per place. [2025-03-15 00:09:46,009 INFO L140 encePairwiseOnDemand]: 92/99 looper letters, 44 selfloop transitions, 8 changer transitions 0/118 dead transitions. [2025-03-15 00:09:46,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 118 transitions, 470 flow [2025-03-15 00:09:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:46,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2025-03-15 00:09:46,015 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8080808080808081 [2025-03-15 00:09:46,016 INFO L298 CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places. [2025-03-15 00:09:46,016 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 118 transitions, 470 flow [2025-03-15 00:09:46,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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) [2025-03-15 00:09:46,016 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:46,016 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:09:46,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:09:46,017 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-03-15 00:09:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2036636934, now seen corresponding path program 1 times [2025-03-15 00:09:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:46,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156102449] [2025-03-15 00:09:46,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:09:46,033 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 00:09:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:09:46,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 00:09:46,055 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 00:09:46,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-15 00:09:46,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-15 00:09:46,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-15 00:09:46,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:09:46,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-15 00:09:46,061 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 00:09:46,062 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 00:09:46,083 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:09:46,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:09:46,088 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@67a76f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:09:46,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 00:09:46,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:09:46,092 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-03-15 00:09:46,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:09:46,093 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:46,093 INFO L221 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] [2025-03-15 00:09:46,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:46,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:46,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1523227382, now seen corresponding path program 1 times [2025-03-15 00:09:46,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:46,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681529953] [2025-03-15 00:09:46,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:46,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:46,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:46,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681529953] [2025-03-15 00:09:46,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681529953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:46,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:46,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:46,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218235440] [2025-03-15 00:09:46,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:46,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-15 00:09:46,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:46,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-15 00:09:46,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-15 00:09:46,117 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 130 [2025-03-15 00:09:46,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 130 transitions, 270 flow. Second operand has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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) [2025-03-15 00:09:46,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:46,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 130 [2025-03-15 00:09:46,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:46,231 INFO L124 PetriNetUnfolderBase]: 34/566 cut-off events. [2025-03-15 00:09:46,232 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-15 00:09:46,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653 conditions, 566 events. 34/566 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3272 event pairs, 34 based on Foata normal form. 67/546 useless extension candidates. Maximal degree in co-relation 429. Up to 73 conditions per place. [2025-03-15 00:09:46,243 INFO L140 encePairwiseOnDemand]: 123/130 looper letters, 8 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2025-03-15 00:09:46,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 260 flow [2025-03-15 00:09:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-15 00:09:46,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-15 00:09:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2025-03-15 00:09:46,245 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9192307692307692 [2025-03-15 00:09:46,246 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, -5 predicate places. [2025-03-15 00:09:46,246 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 117 transitions, 260 flow [2025-03-15 00:09:46,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.0) internal successors, (226), 2 states have internal predecessors, (226), 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) [2025-03-15 00:09:46,246 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:46,246 INFO L221 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] [2025-03-15 00:09:46,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:09:46,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:46,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1859273482, now seen corresponding path program 1 times [2025-03-15 00:09:46,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:46,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608275371] [2025-03-15 00:09:46,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:46,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:46,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:46,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608275371] [2025-03-15 00:09:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608275371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:46,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275850596] [2025-03-15 00:09:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:46,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:46,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:46,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:46,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 130 [2025-03-15 00:09:46,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 117 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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) [2025-03-15 00:09:46,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:46,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 130 [2025-03-15 00:09:46,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:47,464 INFO L124 PetriNetUnfolderBase]: 4777/10975 cut-off events. [2025-03-15 00:09:47,464 INFO L125 PetriNetUnfolderBase]: For 1149/1152 co-relation queries the response was YES. [2025-03-15 00:09:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19811 conditions, 10975 events. 4777/10975 cut-off events. For 1149/1152 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 101219 event pairs, 3898 based on Foata normal form. 0/8670 useless extension candidates. Maximal degree in co-relation 18529. Up to 6718 conditions per place. [2025-03-15 00:09:47,643 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 54 selfloop transitions, 9 changer transitions 0/141 dead transitions. [2025-03-15 00:09:47,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 141 transitions, 442 flow [2025-03-15 00:09:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-15 00:09:47,646 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7871794871794872 [2025-03-15 00:09:47,648 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, -3 predicate places. [2025-03-15 00:09:47,648 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 442 flow [2025-03-15 00:09:47,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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) [2025-03-15 00:09:47,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:47,649 INFO L221 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] [2025-03-15 00:09:47,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:09:47,649 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:47,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 586722563, now seen corresponding path program 1 times [2025-03-15 00:09:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:47,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238654122] [2025-03-15 00:09:47,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:47,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:47,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:47,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238654122] [2025-03-15 00:09:47,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238654122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:47,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:47,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:47,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31638359] [2025-03-15 00:09:47,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:47,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:47,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:47,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:47,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:47,718 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 130 [2025-03-15 00:09:47,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2025-03-15 00:09:47,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:47,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 130 [2025-03-15 00:09:47,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:49,073 INFO L124 PetriNetUnfolderBase]: 6284/13795 cut-off events. [2025-03-15 00:09:49,074 INFO L125 PetriNetUnfolderBase]: For 3245/4837 co-relation queries the response was YES. [2025-03-15 00:09:49,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33492 conditions, 13795 events. 6284/13795 cut-off events. For 3245/4837 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 127817 event pairs, 4014 based on Foata normal form. 5/11034 useless extension candidates. Maximal degree in co-relation 31639. Up to 8225 conditions per place. [2025-03-15 00:09:49,207 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 84 selfloop transitions, 14 changer transitions 0/179 dead transitions. [2025-03-15 00:09:49,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 179 transitions, 807 flow [2025-03-15 00:09:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-03-15 00:09:49,208 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-03-15 00:09:49,210 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places. [2025-03-15 00:09:49,210 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 179 transitions, 807 flow [2025-03-15 00:09:49,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2025-03-15 00:09:49,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:49,210 INFO L221 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] [2025-03-15 00:09:49,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:09:49,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:49,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1718394208, now seen corresponding path program 1 times [2025-03-15 00:09:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428274594] [2025-03-15 00:09:49,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:49,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428274594] [2025-03-15 00:09:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428274594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537014424] [2025-03-15 00:09:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:49,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:49,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:49,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:49,262 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 130 [2025-03-15 00:09:49,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 179 transitions, 807 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) [2025-03-15 00:09:49,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:49,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 130 [2025-03-15 00:09:49,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:50,875 INFO L124 PetriNetUnfolderBase]: 7533/17898 cut-off events. [2025-03-15 00:09:50,875 INFO L125 PetriNetUnfolderBase]: For 8767/14388 co-relation queries the response was YES. [2025-03-15 00:09:50,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51810 conditions, 17898 events. 7533/17898 cut-off events. For 8767/14388 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 183210 event pairs, 2872 based on Foata normal form. 36/14710 useless extension candidates. Maximal degree in co-relation 34055. Up to 10074 conditions per place. [2025-03-15 00:09:51,061 INFO L140 encePairwiseOnDemand]: 115/130 looper letters, 141 selfloop transitions, 31 changer transitions 0/256 dead transitions. [2025-03-15 00:09:51,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 256 transitions, 1648 flow [2025-03-15 00:09:51,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2025-03-15 00:09:51,065 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8307692307692308 [2025-03-15 00:09:51,067 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places. [2025-03-15 00:09:51,068 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 256 transitions, 1648 flow [2025-03-15 00:09:51,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) [2025-03-15 00:09:51,068 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:51,068 INFO L221 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] [2025-03-15 00:09:51,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:09:51,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:51,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1577313666, now seen corresponding path program 1 times [2025-03-15 00:09:51,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:51,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991783385] [2025-03-15 00:09:51,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991783385] [2025-03-15 00:09:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991783385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:51,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:51,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:51,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411154282] [2025-03-15 00:09:51,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:51,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:51,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:51,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:51,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:51,135 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 130 [2025-03-15 00:09:51,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 256 transitions, 1648 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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) [2025-03-15 00:09:51,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:51,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 130 [2025-03-15 00:09:51,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:53,199 INFO L124 PetriNetUnfolderBase]: 9125/21246 cut-off events. [2025-03-15 00:09:53,202 INFO L125 PetriNetUnfolderBase]: For 17588/28188 co-relation queries the response was YES. [2025-03-15 00:09:53,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73319 conditions, 21246 events. 9125/21246 cut-off events. For 17588/28188 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 218425 event pairs, 3049 based on Foata normal form. 80/17721 useless extension candidates. Maximal degree in co-relation 48477. Up to 11673 conditions per place. [2025-03-15 00:09:53,479 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 213 selfloop transitions, 25 changer transitions 0/318 dead transitions. [2025-03-15 00:09:53,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 318 transitions, 2634 flow [2025-03-15 00:09:53,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2025-03-15 00:09:53,481 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7871794871794872 [2025-03-15 00:09:53,481 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places. [2025-03-15 00:09:53,482 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 318 transitions, 2634 flow [2025-03-15 00:09:53,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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) [2025-03-15 00:09:53,482 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:53,482 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 00:09:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:09:53,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1349495971, now seen corresponding path program 1 times [2025-03-15 00:09:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296287051] [2025-03-15 00:09:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:53,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:53,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296287051] [2025-03-15 00:09:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296287051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868462217] [2025-03-15 00:09:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:53,532 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 130 [2025-03-15 00:09:53,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 318 transitions, 2634 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2025-03-15 00:09:53,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:53,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 130 [2025-03-15 00:09:53,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:55,782 INFO L124 PetriNetUnfolderBase]: 11035/24551 cut-off events. [2025-03-15 00:09:55,782 INFO L125 PetriNetUnfolderBase]: For 31896/42964 co-relation queries the response was YES. [2025-03-15 00:09:56,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98121 conditions, 24551 events. 11035/24551 cut-off events. For 31896/42964 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 249996 event pairs, 3377 based on Foata normal form. 123/20788 useless extension candidates. Maximal degree in co-relation 63063. Up to 13270 conditions per place. [2025-03-15 00:09:56,178 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 292 selfloop transitions, 45 changer transitions 0/420 dead transitions. [2025-03-15 00:09:56,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 420 transitions, 4348 flow [2025-03-15 00:09:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2025-03-15 00:09:56,187 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7974358974358975 [2025-03-15 00:09:56,188 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places. [2025-03-15 00:09:56,188 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 420 transitions, 4348 flow [2025-03-15 00:09:56,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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) [2025-03-15 00:09:56,188 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:56,188 INFO L221 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] [2025-03-15 00:09:56,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:09:56,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1605232236, now seen corresponding path program 1 times [2025-03-15 00:09:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086486706] [2025-03-15 00:09:56,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:56,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086486706] [2025-03-15 00:09:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086486706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:56,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059469197] [2025-03-15 00:09:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:56,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:56,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:56,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:56,248 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 130 [2025-03-15 00:09:56,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 420 transitions, 4348 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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) [2025-03-15 00:09:56,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:56,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 130 [2025-03-15 00:09:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:59,010 INFO L124 PetriNetUnfolderBase]: 13353/28743 cut-off events. [2025-03-15 00:09:59,011 INFO L125 PetriNetUnfolderBase]: For 54553/68038 co-relation queries the response was YES. [2025-03-15 00:09:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129430 conditions, 28743 events. 13353/28743 cut-off events. For 54553/68038 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 290046 event pairs, 3682 based on Foata normal form. 91/24584 useless extension candidates. Maximal degree in co-relation 89306. Up to 15174 conditions per place. [2025-03-15 00:09:59,367 INFO L140 encePairwiseOnDemand]: 120/130 looper letters, 390 selfloop transitions, 47 changer transitions 2/523 dead transitions. [2025-03-15 00:09:59,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 523 transitions, 6487 flow [2025-03-15 00:09:59,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:09:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:09:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2025-03-15 00:09:59,371 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-03-15 00:09:59,371 INFO L298 CegarLoopForPetriNet]: 128 programPoint places, 7 predicate places. [2025-03-15 00:09:59,371 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 523 transitions, 6487 flow [2025-03-15 00:09:59,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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) [2025-03-15 00:09:59,372 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:59,372 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:09:59,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:09:59,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-15 00:09:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1977551488, now seen corresponding path program 1 times [2025-03-15 00:09:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001360421] [2025-03-15 00:09:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:09:59,381 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 00:09:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:09:59,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 00:09:59,390 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 00:09:59,390 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-15 00:09:59,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-15 00:09:59,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-15 00:09:59,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-15 00:09:59,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-15 00:09:59,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:09:59,391 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:09:59,392 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 00:09:59,392 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 00:09:59,421 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:09:59,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:09:59,426 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@67a76f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:09:59,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-15 00:09:59,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:09:59,431 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2025-03-15 00:09:59,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:09:59,431 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:59,431 INFO L221 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] [2025-03-15 00:09:59,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:09:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1342743370, now seen corresponding path program 1 times [2025-03-15 00:09:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51298255] [2025-03-15 00:09:59,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:59,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51298255] [2025-03-15 00:09:59,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51298255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:59,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:59,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:59,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897995349] [2025-03-15 00:09:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-15 00:09:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:59,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-15 00:09:59,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-15 00:09:59,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2025-03-15 00:09:59,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 340 flow. Second operand has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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) [2025-03-15 00:09:59,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:59,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2025-03-15 00:09:59,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:09:59,605 INFO L124 PetriNetUnfolderBase]: 178/1732 cut-off events. [2025-03-15 00:09:59,605 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-15 00:09:59,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2081 conditions, 1732 events. 178/1732 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 14469 event pairs, 178 based on Foata normal form. 260/1709 useless extension candidates. Maximal degree in co-relation 1375. Up to 298 conditions per place. [2025-03-15 00:09:59,619 INFO L140 encePairwiseOnDemand]: 152/161 looper letters, 11 selfloop transitions, 0 changer transitions 0/144 dead transitions. [2025-03-15 00:09:59,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 328 flow [2025-03-15 00:09:59,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-15 00:09:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-15 00:09:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2025-03-15 00:09:59,621 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-03-15 00:09:59,621 INFO L298 CegarLoopForPetriNet]: 159 programPoint places, -7 predicate places. [2025-03-15 00:09:59,622 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 328 flow [2025-03-15 00:09:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 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) [2025-03-15 00:09:59,622 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:09:59,622 INFO L221 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] [2025-03-15 00:09:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:09:59,622 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:09:59,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:09:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1379637707, now seen corresponding path program 1 times [2025-03-15 00:09:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:09:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120006009] [2025-03-15 00:09:59,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:09:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:09:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:09:59,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:09:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:09:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120006009] [2025-03-15 00:09:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120006009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:09:59,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:09:59,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:09:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127230401] [2025-03-15 00:09:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:09:59,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:09:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:09:59,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:09:59,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:09:59,654 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 161 [2025-03-15 00:09:59,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 144 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-15 00:09:59,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:09:59,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 161 [2025-03-15 00:09:59,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:11,470 INFO L124 PetriNetUnfolderBase]: 88657/162919 cut-off events. [2025-03-15 00:10:11,470 INFO L125 PetriNetUnfolderBase]: For 19176/19197 co-relation queries the response was YES. [2025-03-15 00:10:12,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306408 conditions, 162919 events. 88657/162919 cut-off events. For 19176/19197 co-relation queries the response was YES. Maximal size of possible extension queue 4492. Compared 1798824 event pairs, 74368 based on Foata normal form. 0/127200 useless extension candidates. Maximal degree in co-relation 285590. Up to 109590 conditions per place. [2025-03-15 00:10:13,125 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 74 selfloop transitions, 12 changer transitions 0/179 dead transitions. [2025-03-15 00:10:13,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 179 transitions, 582 flow [2025-03-15 00:10:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2025-03-15 00:10:13,128 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2025-03-15 00:10:13,129 INFO L298 CegarLoopForPetriNet]: 159 programPoint places, -5 predicate places. [2025-03-15 00:10:13,129 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 179 transitions, 582 flow [2025-03-15 00:10:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2025-03-15 00:10:13,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:13,129 INFO L221 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] [2025-03-15 00:10:13,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:10:13,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:10:13,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:13,130 INFO L85 PathProgramCache]: Analyzing trace with hash -652381915, now seen corresponding path program 1 times [2025-03-15 00:10:13,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:13,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200102406] [2025-03-15 00:10:13,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:10:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200102406] [2025-03-15 00:10:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200102406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:13,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:13,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:10:13,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665425752] [2025-03-15 00:10:13,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:13,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:10:13,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:13,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:10:13,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:10:13,168 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 161 [2025-03-15 00:10:13,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 179 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2025-03-15 00:10:13,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:13,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 161 [2025-03-15 00:10:13,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:10:29,796 INFO L124 PetriNetUnfolderBase]: 118290/210009 cut-off events. [2025-03-15 00:10:29,797 INFO L125 PetriNetUnfolderBase]: For 46383/67875 co-relation queries the response was YES. [2025-03-15 00:10:30,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541301 conditions, 210009 events. 118290/210009 cut-off events. For 46383/67875 co-relation queries the response was YES. Maximal size of possible extension queue 5530. Compared 2296317 event pairs, 78631 based on Foata normal form. 91/165509 useless extension candidates. Maximal degree in co-relation 257856. Up to 138589 conditions per place. [2025-03-15 00:10:31,912 INFO L140 encePairwiseOnDemand]: 148/161 looper letters, 124 selfloop transitions, 20 changer transitions 0/240 dead transitions. [2025-03-15 00:10:31,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 240 transitions, 1148 flow [2025-03-15 00:10:31,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:10:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:10:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-03-15 00:10:31,914 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7950310559006211 [2025-03-15 00:10:31,914 INFO L298 CegarLoopForPetriNet]: 159 programPoint places, -3 predicate places. [2025-03-15 00:10:31,914 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 240 transitions, 1148 flow [2025-03-15 00:10:31,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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) [2025-03-15 00:10:31,915 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:10:31,915 INFO L221 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] [2025-03-15 00:10:31,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:10:31,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-15 00:10:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:10:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2049592448, now seen corresponding path program 1 times [2025-03-15 00:10:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:10:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728335557] [2025-03-15 00:10:31,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:10:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:10:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:10:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:10:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:10:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728335557] [2025-03-15 00:10:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728335557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:10:31,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:10:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:10:31,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717870124] [2025-03-15 00:10:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:10:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:10:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:10:31,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:10:31,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:10:31,942 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 161 [2025-03-15 00:10:31,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 240 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2025-03-15 00:10:31,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:10:31,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 161 [2025-03-15 00:10:31,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand