/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/14_spin2003.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:05:49,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:05:50,034 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:05:50,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:05:50,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:05:50,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:05:50,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:05:50,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:05:50,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:05:50,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:05:50,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:05:50,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:05:50,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:05:50,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:05:50,070 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:05:50,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:05:50,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:05:50,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:05:50,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:05:50,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:05:50,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-03-15 00:05:51,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211457c48/d654abe410444dbea3be74a832b269f8/FLAG6be5e3e3c [2025-03-15 00:05:51,851 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:05:51,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003.i [2025-03-15 00:05:51,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211457c48/d654abe410444dbea3be74a832b269f8/FLAG6be5e3e3c [2025-03-15 00:05:52,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211457c48/d654abe410444dbea3be74a832b269f8 [2025-03-15 00:05:52,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:05:52,170 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:05:52,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:05:52,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:05:52,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:05:52,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50ae8f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52, skipping insertion in model container [2025-03-15 00:05:52,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:05:52,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:05:52,397 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:05:52,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:05:52,467 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:05:52,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52 WrapperNode [2025-03-15 00:05:52,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:05:52,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:05:52,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:05:52,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:05:52,475 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:05:52" (1/1) ... [2025-03-15 00:05:52,486 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:05:52" (1/1) ... [2025-03-15 00:05:52,501 INFO L138 Inliner]: procedures = 161, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2025-03-15 00:05:52,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:05:52,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:05:52,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:05:52,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:05:52,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:05:52,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:05:52,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:05:52,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:05:52,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (1/1) ... [2025-03-15 00:05:52,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:05:52,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:05:52,564 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:05:52,583 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:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-15 00:05:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-15 00:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:05:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:05:52,603 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:05:52,697 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:05:52,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:05:52,788 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:05:52,788 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:05:52,805 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:05:52,805 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-15 00:05:52,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:05:52 BoogieIcfgContainer [2025-03-15 00:05:52,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:05:52,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:05:52,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:05:52,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:05:52,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:05:52" (1/3) ... [2025-03-15 00:05:52,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2950453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:05:52, skipping insertion in model container [2025-03-15 00:05:52,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:05:52" (2/3) ... [2025-03-15 00:05:52,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2950453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:05:52, skipping insertion in model container [2025-03-15 00:05:52,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:05:52" (3/3) ... [2025-03-15 00:05:52,813 INFO L128 eAbstractionObserver]: Analyzing ICFG 14_spin2003.i [2025-03-15 00:05:52,827 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:05:52,829 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 14_spin2003.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 3 error locations. [2025-03-15 00:05:52,830 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:05:52,875 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:05:52,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:05:52,911 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;@7b6940c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:05:52,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 00:05:52,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:05:52,938 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-15 00:05:52,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:05:52,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:52,940 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:05:52,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-15 00:05:52,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -510019553, now seen corresponding path program 1 times [2025-03-15 00:05:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:52,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152865531] [2025-03-15 00:05:52,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:53,026 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 00:05:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:53,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 00:05:53,055 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 00:05:53,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-03-15 00:05:53,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-03-15 00:05:53,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:05:53,059 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-15 00:05:53,065 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 00:05:53,065 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 00:05:53,098 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:05:53,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:05:53,118 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;@7b6940c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:05:53,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 00:05:53,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:05:53,133 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-03-15 00:05:53,133 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:05:53,133 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:53,133 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:05:53,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 00:05:53,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:53,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1476467371, now seen corresponding path program 1 times [2025-03-15 00:05:53,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:53,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360164392] [2025-03-15 00:05:53,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:53,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:53,252 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:05:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360164392] [2025-03-15 00:05:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360164392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:05:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246749701] [2025-03-15 00:05:53,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:53,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:53,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:53,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:05:53,282 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 87 [2025-03-15 00:05:53,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:53,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:53,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 87 [2025-03-15 00:05:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:53,484 INFO L124 PetriNetUnfolderBase]: 171/606 cut-off events. [2025-03-15 00:05:53,484 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-15 00:05:53,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 606 events. 171/606 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3428 event pairs, 127 based on Foata normal form. 251/739 useless extension candidates. Maximal degree in co-relation 888. Up to 317 conditions per place. [2025-03-15 00:05:53,497 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 34 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-15 00:05:53,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 89 transitions, 273 flow [2025-03-15 00:05:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 211 transitions. [2025-03-15 00:05:53,507 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8084291187739464 [2025-03-15 00:05:53,513 INFO L298 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2025-03-15 00:05:53,513 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 273 flow [2025-03-15 00:05:53,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:05:53,513 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:53,514 INFO L221 CegarLoopForPetriNet]: trace histogram [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:05:53,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:05:53,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 00:05:53,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 221822750, now seen corresponding path program 1 times [2025-03-15 00:05:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777536149] [2025-03-15 00:05:53,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:53,539 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 00:05:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:53,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 00:05:53,563 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 00:05:53,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 00:05:53,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-03-15 00:05:53,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-03-15 00:05:53,563 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-03-15 00:05:53,564 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-03-15 00:05:53,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:05:53,564 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-15 00:05:53,565 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 00:05:53,565 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 00:05:53,603 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:05:53,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:05:53,610 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;@7b6940c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:05:53,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 00:05:53,617 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:05:53,618 INFO L124 PetriNetUnfolderBase]: 0/48 cut-off events. [2025-03-15 00:05:53,618 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 00:05:53,618 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:53,618 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:05:53,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-15 00:05:53,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:53,619 INFO L85 PathProgramCache]: Analyzing trace with hash 849110519, now seen corresponding path program 1 times [2025-03-15 00:05:53,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:53,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677931021] [2025-03-15 00:05:53,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:53,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:53,682 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:05:53,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:53,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677931021] [2025-03-15 00:05:53,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677931021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:05:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585916795] [2025-03-15 00:05:53,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:53,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:53,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:53,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:05:53,684 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 118 [2025-03-15 00:05:53,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:05:53,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:53,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 118 [2025-03-15 00:05:53,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:54,799 INFO L124 PetriNetUnfolderBase]: 4413/9721 cut-off events. [2025-03-15 00:05:54,800 INFO L125 PetriNetUnfolderBase]: For 1159/1159 co-relation queries the response was YES. [2025-03-15 00:05:54,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17415 conditions, 9721 events. 4413/9721 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 86853 event pairs, 3508 based on Foata normal form. 3428/10987 useless extension candidates. Maximal degree in co-relation 15279. Up to 6015 conditions per place. [2025-03-15 00:05:54,880 INFO L140 encePairwiseOnDemand]: 101/118 looper letters, 55 selfloop transitions, 9 changer transitions 0/128 dead transitions. [2025-03-15 00:05:54,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 128 transitions, 414 flow [2025-03-15 00:05:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:54,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-03-15 00:05:54,883 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8107344632768362 [2025-03-15 00:05:54,883 INFO L298 CegarLoopForPetriNet]: 119 programPoint places, -8 predicate places. [2025-03-15 00:05:54,883 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 128 transitions, 414 flow [2025-03-15 00:05:54,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:05:54,884 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:54,884 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:05:54,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:05:54,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-15 00:05:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1184563723, now seen corresponding path program 1 times [2025-03-15 00:05:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898101091] [2025-03-15 00:05:54,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:54,939 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:05:54,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898101091] [2025-03-15 00:05:54,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898101091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:54,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:54,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:05:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913270498] [2025-03-15 00:05:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:54,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:05:54,941 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 118 [2025-03-15 00:05:54,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 128 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:05:54,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:54,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 118 [2025-03-15 00:05:54,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:05:56,085 INFO L124 PetriNetUnfolderBase]: 5791/12207 cut-off events. [2025-03-15 00:05:56,086 INFO L125 PetriNetUnfolderBase]: For 2704/3864 co-relation queries the response was YES. [2025-03-15 00:05:56,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30065 conditions, 12207 events. 5791/12207 cut-off events. For 2704/3864 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 109277 event pairs, 3586 based on Foata normal form. 5/9681 useless extension candidates. Maximal degree in co-relation 26920. Up to 7367 conditions per place. [2025-03-15 00:05:56,171 INFO L140 encePairwiseOnDemand]: 108/118 looper letters, 88 selfloop transitions, 14 changer transitions 0/167 dead transitions. [2025-03-15 00:05:56,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 167 transitions, 786 flow [2025-03-15 00:05:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:05:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:05:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2025-03-15 00:05:56,175 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740112994350282 [2025-03-15 00:05:56,176 INFO L298 CegarLoopForPetriNet]: 119 programPoint places, -6 predicate places. [2025-03-15 00:05:56,176 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 167 transitions, 786 flow [2025-03-15 00:05:56,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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:05:56,176 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:56,176 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:05:56,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:05:56,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-03-15 00:05:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1349475463, now seen corresponding path program 1 times [2025-03-15 00:05:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952637235] [2025-03-15 00:05:56,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:56,188 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 00:05:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 00:05:56,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 00:05:56,197 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 00:05:56,197 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-15 00:05:56,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-03-15 00:05:56,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-03-15 00:05:56,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-03-15 00:05:56,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-03-15 00:05:56,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-03-15 00:05:56,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:05:56,198 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-15 00:05:56,199 WARN L336 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 00:05:56,199 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-15 00:05:56,218 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:05:56,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:05:56,228 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;@7b6940c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:05:56,228 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-15 00:05:56,235 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:05:56,235 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-03-15 00:05:56,235 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:05:56,235 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:05:56,235 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:05:56,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-15 00:05:56,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:05:56,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1911398839, now seen corresponding path program 1 times [2025-03-15 00:05:56,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:05:56,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48133892] [2025-03-15 00:05:56,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:05:56,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:05:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:05:56,269 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:05:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:05:56,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48133892] [2025-03-15 00:05:56,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48133892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:05:56,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:05:56,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:05:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142707952] [2025-03-15 00:05:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:05:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:05:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:05:56,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:05:56,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:05:56,271 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2025-03-15 00:05:56,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 149 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:05:56,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:05:56,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2025-03-15 00:05:56,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:06,318 INFO L124 PetriNetUnfolderBase]: 80937/145853 cut-off events. [2025-03-15 00:06:06,319 INFO L125 PetriNetUnfolderBase]: For 24082/24082 co-relation queries the response was YES. [2025-03-15 00:06:06,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269156 conditions, 145853 events. 80937/145853 cut-off events. For 24082/24082 co-relation queries the response was YES. Maximal size of possible extension queue 4087. Compared 1571848 event pairs, 66339 based on Foata normal form. 45613/157631 useless extension candidates. Maximal degree in co-relation 235699. Up to 97787 conditions per place. [2025-03-15 00:06:07,887 INFO L140 encePairwiseOnDemand]: 127/149 looper letters, 76 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2025-03-15 00:06:07,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 167 transitions, 559 flow [2025-03-15 00:06:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:06:07,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:06:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-15 00:06:07,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8120805369127517 [2025-03-15 00:06:07,890 INFO L298 CegarLoopForPetriNet]: 150 programPoint places, -10 predicate places. [2025-03-15 00:06:07,890 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 559 flow [2025-03-15 00:06:07,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:06:07,890 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:07,890 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:06:07,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:06:07,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-15 00:06:07,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:07,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1280261165, now seen corresponding path program 1 times [2025-03-15 00:06:07,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:07,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656584721] [2025-03-15 00:06:07,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:07,937 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:06:07,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:07,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656584721] [2025-03-15 00:06:07,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656584721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:07,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:06:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511395923] [2025-03-15 00:06:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:07,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:07,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:07,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:07,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:06:07,939 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2025-03-15 00:06:07,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 559 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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:06:07,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:07,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2025-03-15 00:06:07,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:21,109 INFO L124 PetriNetUnfolderBase]: 107879/188083 cut-off events. [2025-03-15 00:06:21,109 INFO L125 PetriNetUnfolderBase]: For 46789/69735 co-relation queries the response was YES. [2025-03-15 00:06:21,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484646 conditions, 188083 events. 107879/188083 cut-off events. For 46789/69735 co-relation queries the response was YES. Maximal size of possible extension queue 4940. Compared 2004384 event pairs, 70635 based on Foata normal form. 70/146564 useless extension candidates. Maximal degree in co-relation 430535. Up to 123706 conditions per place. [2025-03-15 00:06:23,315 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 130 selfloop transitions, 20 changer transitions 0/230 dead transitions. [2025-03-15 00:06:23,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 230 transitions, 1141 flow [2025-03-15 00:06:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:06:23,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:06:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2025-03-15 00:06:23,317 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740492170022372 [2025-03-15 00:06:23,317 INFO L298 CegarLoopForPetriNet]: 150 programPoint places, -8 predicate places. [2025-03-15 00:06:23,317 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 230 transitions, 1141 flow [2025-03-15 00:06:23,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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:06:23,318 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:23,318 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] [2025-03-15 00:06:23,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:06:23,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-15 00:06:23,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash -805513995, now seen corresponding path program 1 times [2025-03-15 00:06:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017481887] [2025-03-15 00:06:23,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:23,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:23,354 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:06:23,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:23,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017481887] [2025-03-15 00:06:23,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017481887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:23,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:23,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:06:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365301607] [2025-03-15 00:06:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:23,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:23,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:23,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:23,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:06:23,356 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2025-03-15 00:06:23,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 230 transitions, 1141 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:06:23,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:23,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2025-03-15 00:06:23,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:06:40,733 INFO L124 PetriNetUnfolderBase]: 134867/229665 cut-off events. [2025-03-15 00:06:40,733 INFO L125 PetriNetUnfolderBase]: For 96140/164168 co-relation queries the response was YES. [2025-03-15 00:06:41,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754553 conditions, 229665 events. 134867/229665 cut-off events. For 96140/164168 co-relation queries the response was YES. Maximal size of possible extension queue 5779. Compared 2426725 event pairs, 76235 based on Foata normal form. 139/180539 useless extension candidates. Maximal degree in co-relation 675469. Up to 151175 conditions per place. [2025-03-15 00:06:43,705 INFO L140 encePairwiseOnDemand]: 136/149 looper letters, 193 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2025-03-15 00:06:43,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 294 transitions, 1984 flow [2025-03-15 00:06:43,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:06:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:06:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2025-03-15 00:06:43,707 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7762863534675615 [2025-03-15 00:06:43,707 INFO L298 CegarLoopForPetriNet]: 150 programPoint places, -6 predicate places. [2025-03-15 00:06:43,707 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 294 transitions, 1984 flow [2025-03-15 00:06:43,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:06:43,708 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:06:43,708 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 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:06:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:06:43,708 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-15 00:06:43,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:06:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1217608694, now seen corresponding path program 1 times [2025-03-15 00:06:43,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:06:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878254685] [2025-03-15 00:06:43,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:06:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:06:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:06:43,748 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:06:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:06:43,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878254685] [2025-03-15 00:06:43,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878254685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:06:43,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:06:43,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:06:43,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552976348] [2025-03-15 00:06:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:06:43,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:06:43,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:06:43,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:06:43,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:06:43,749 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2025-03-15 00:06:43,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 294 transitions, 1984 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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:06:43,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:06:43,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2025-03-15 00:06:43,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand