/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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:43:17,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:43:17,904 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:43:17,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:43:17,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:43:17,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:43:17,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:43:17,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:43:17,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:43:17,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:43:17,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:43:17,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:43:17,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:43:17,950 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:43:17,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:43:17,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:43:17,950 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:43:18,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:43:18,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:43:18,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:43:18,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:43:18,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:43:18,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-15 00:43:19,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04bd8702/a5a3ac1ea6674eb8b95a6c78a3f599d3/FLAG7c5e9100d [2025-03-15 00:43:19,750 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:43:19,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-15 00:43:19,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04bd8702/a5a3ac1ea6674eb8b95a6c78a3f599d3/FLAG7c5e9100d [2025-03-15 00:43:19,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b04bd8702/a5a3ac1ea6674eb8b95a6c78a3f599d3 [2025-03-15 00:43:19,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:43:19,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:43:19,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:43:19,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:43:19,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:43:19,791 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:43:19" (1/1) ... [2025-03-15 00:43:19,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c5ec80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:19, skipping insertion in model container [2025-03-15 00:43:19,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:43:19" (1/1) ... [2025-03-15 00:43:19,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:43:20,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:43:20,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:43:20,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:43:20,205 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:43:20,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20 WrapperNode [2025-03-15 00:43:20,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:43:20,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:43:20,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:43:20,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:43:20,212 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:43:20" (1/1) ... [2025-03-15 00:43:20,221 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:43:20" (1/1) ... [2025-03-15 00:43:20,254 INFO L138 Inliner]: procedures = 165, calls = 35, calls flagged for inlining = 8, calls inlined = 9, statements flattened = 171 [2025-03-15 00:43:20,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:43:20,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:43:20,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:43:20,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:43:20,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,299 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:43:20,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:43:20,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:43:20,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:43:20,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (1/1) ... [2025-03-15 00:43:20,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:43:20,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:43:20,344 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:43:20,346 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:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-15 00:43:20,361 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 00:43:20,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:43:20,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:43:20,362 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:43:20,459 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:43:20,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:43:20,779 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:43:20,780 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:43:20,806 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:43:20,807 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:43:20,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:43:20 BoogieIcfgContainer [2025-03-15 00:43:20,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:43:20,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:43:20,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:43:20,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:43:20,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:43:19" (1/3) ... [2025-03-15 00:43:20,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebb7769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:43:20, skipping insertion in model container [2025-03-15 00:43:20,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:43:20" (2/3) ... [2025-03-15 00:43:20,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ebb7769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:43:20, skipping insertion in model container [2025-03-15 00:43:20,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:43:20" (3/3) ... [2025-03-15 00:43:20,815 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-15 00:43:20,828 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:43:20,830 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 197 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-15 00:43:20,830 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:43:20,913 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 00:43:20,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:43:20,957 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;@5361c7e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:43:20,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-15 00:43:20,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:43:20,976 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-15 00:43:20,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:43:20,979 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:20,979 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:43:20,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -512101648, now seen corresponding path program 1 times [2025-03-15 00:43:20,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:20,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890753019] [2025-03-15 00:43:20,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:43:20,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:43:21,552 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:43:21,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:21,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890753019] [2025-03-15 00:43:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890753019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:21,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:43:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521301416] [2025-03-15 00:43:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:21,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:43:21,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:21,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:43:21,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:43:21,582 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2025-03-15 00:43:21,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 206 transitions, 416 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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:43:21,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:21,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2025-03-15 00:43:21,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:22,086 INFO L124 PetriNetUnfolderBase]: 912/2919 cut-off events. [2025-03-15 00:43:22,087 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 00:43:22,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 2919 events. 912/2919 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 20960 event pairs, 769 based on Foata normal form. 143/2708 useless extension candidates. Maximal degree in co-relation 4591. Up to 1724 conditions per place. [2025-03-15 00:43:22,133 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 67 selfloop transitions, 5 changer transitions 0/192 dead transitions. [2025-03-15 00:43:22,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 192 transitions, 531 flow [2025-03-15 00:43:22,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:43:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:43:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2025-03-15 00:43:22,149 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6707119741100324 [2025-03-15 00:43:22,151 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, -4 predicate places. [2025-03-15 00:43:22,151 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 192 transitions, 531 flow [2025-03-15 00:43:22,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 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:43:22,152 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:22,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:43:22,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:43:22,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -952397381, now seen corresponding path program 1 times [2025-03-15 00:43:22,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:22,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354718983] [2025-03-15 00:43:22,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:43:22,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:43:22,466 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:43:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:22,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354718983] [2025-03-15 00:43:22,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354718983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:22,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:43:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092142714] [2025-03-15 00:43:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:22,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:43:22,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:22,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:43:22,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:43:22,473 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 206 [2025-03-15 00:43:22,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 192 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 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:43:22,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:22,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 206 [2025-03-15 00:43:22,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:23,497 INFO L124 PetriNetUnfolderBase]: 2123/6162 cut-off events. [2025-03-15 00:43:23,498 INFO L125 PetriNetUnfolderBase]: For 443/969 co-relation queries the response was YES. [2025-03-15 00:43:23,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13900 conditions, 6162 events. 2123/6162 cut-off events. For 443/969 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 47903 event pairs, 313 based on Foata normal form. 0/5528 useless extension candidates. Maximal degree in co-relation 13832. Up to 3672 conditions per place. [2025-03-15 00:43:23,530 INFO L140 encePairwiseOnDemand]: 170/206 looper letters, 160 selfloop transitions, 43 changer transitions 0/321 dead transitions. [2025-03-15 00:43:23,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 321 transitions, 1439 flow [2025-03-15 00:43:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:43:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:43:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 946 transitions. [2025-03-15 00:43:23,535 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7653721682847896 [2025-03-15 00:43:23,536 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 1 predicate places. [2025-03-15 00:43:23,536 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 321 transitions, 1439 flow [2025-03-15 00:43:23,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 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:43:23,537 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:23,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:43:23,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:43:23,537 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:23,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:23,538 INFO L85 PathProgramCache]: Analyzing trace with hash 942355989, now seen corresponding path program 1 times [2025-03-15 00:43:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:23,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924239435] [2025-03-15 00:43:23,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:43:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:43:23,794 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:43:23,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:23,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924239435] [2025-03-15 00:43:23,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924239435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:23,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:23,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:43:23,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849945670] [2025-03-15 00:43:23,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:23,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:43:23,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:23,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:43:23,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:43:23,796 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 206 [2025-03-15 00:43:23,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 321 transitions, 1439 flow. Second operand has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 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:43:23,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:23,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 206 [2025-03-15 00:43:23,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:25,286 INFO L124 PetriNetUnfolderBase]: 3399/9325 cut-off events. [2025-03-15 00:43:25,287 INFO L125 PetriNetUnfolderBase]: For 2404/2576 co-relation queries the response was YES. [2025-03-15 00:43:25,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26582 conditions, 9325 events. 3399/9325 cut-off events. For 2404/2576 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 72778 event pairs, 467 based on Foata normal form. 0/8619 useless extension candidates. Maximal degree in co-relation 26507. Up to 5301 conditions per place. [2025-03-15 00:43:25,336 INFO L140 encePairwiseOnDemand]: 188/206 looper letters, 514 selfloop transitions, 76 changer transitions 0/718 dead transitions. [2025-03-15 00:43:25,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 718 transitions, 4989 flow [2025-03-15 00:43:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:43:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:43:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions. [2025-03-15 00:43:25,341 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8106796116504854 [2025-03-15 00:43:25,342 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 6 predicate places. [2025-03-15 00:43:25,342 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 718 transitions, 4989 flow [2025-03-15 00:43:25,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 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:43:25,345 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:25,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:43:25,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1788007723, now seen corresponding path program 1 times [2025-03-15 00:43:25,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:25,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462001833] [2025-03-15 00:43:25,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:43:25,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:43:25,636 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:43:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:25,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462001833] [2025-03-15 00:43:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462001833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:25,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:25,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:43:25,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370249790] [2025-03-15 00:43:25,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:25,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:43:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:25,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:43:25,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:43:25,639 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2025-03-15 00:43:25,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 718 transitions, 4989 flow. Second operand has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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:43:25,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:25,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2025-03-15 00:43:25,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:27,360 INFO L124 PetriNetUnfolderBase]: 3908/10788 cut-off events. [2025-03-15 00:43:27,361 INFO L125 PetriNetUnfolderBase]: For 5271/5785 co-relation queries the response was YES. [2025-03-15 00:43:27,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37399 conditions, 10788 events. 3908/10788 cut-off events. For 5271/5785 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 87447 event pairs, 428 based on Foata normal form. 0/10022 useless extension candidates. Maximal degree in co-relation 37317. Up to 6302 conditions per place. [2025-03-15 00:43:27,420 INFO L140 encePairwiseOnDemand]: 175/206 looper letters, 652 selfloop transitions, 172 changer transitions 0/951 dead transitions. [2025-03-15 00:43:27,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 951 transitions, 8497 flow [2025-03-15 00:43:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:43:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:43:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 985 transitions. [2025-03-15 00:43:27,423 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7969255663430421 [2025-03-15 00:43:27,424 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 11 predicate places. [2025-03-15 00:43:27,424 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 951 transitions, 8497 flow [2025-03-15 00:43:27,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 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:43:27,424 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:27,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:27,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:43:27,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1789901592, now seen corresponding path program 1 times [2025-03-15 00:43:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226977122] [2025-03-15 00:43:27,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:43:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:43:27,996 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:43:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226977122] [2025-03-15 00:43:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226977122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:43:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636844330] [2025-03-15 00:43:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:27,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:43:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:27,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:43:27,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:43:28,000 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:43:28,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 951 transitions, 8497 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:28,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:28,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:43:28,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:30,477 INFO L124 PetriNetUnfolderBase]: 6127/16269 cut-off events. [2025-03-15 00:43:30,477 INFO L125 PetriNetUnfolderBase]: For 13736/15091 co-relation queries the response was YES. [2025-03-15 00:43:30,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68413 conditions, 16269 events. 6127/16269 cut-off events. For 13736/15091 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 139663 event pairs, 393 based on Foata normal form. 36/15214 useless extension candidates. Maximal degree in co-relation 68319. Up to 9252 conditions per place. [2025-03-15 00:43:30,559 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 1664 selfloop transitions, 60 changer transitions 0/1827 dead transitions. [2025-03-15 00:43:30,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 1827 transitions, 20313 flow [2025-03-15 00:43:30,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:43:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:43:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1174 transitions. [2025-03-15 00:43:30,562 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.712378640776699 [2025-03-15 00:43:30,562 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 18 predicate places. [2025-03-15 00:43:30,562 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 1827 transitions, 20313 flow [2025-03-15 00:43:30,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:30,563 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:30,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:30,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:43:30,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:30,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash -950136192, now seen corresponding path program 2 times [2025-03-15 00:43:30,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:30,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146020132] [2025-03-15 00:43:30,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:43:30,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:30,593 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:43:30,594 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:43:30,989 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:43:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146020132] [2025-03-15 00:43:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146020132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:30,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:30,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:43:30,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191197072] [2025-03-15 00:43:30,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:30,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:43:30,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:30,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:43:30,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:43:30,993 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:43:30,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 1827 transitions, 20313 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:30,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:30,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:43:30,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:35,519 INFO L124 PetriNetUnfolderBase]: 8171/21625 cut-off events. [2025-03-15 00:43:35,519 INFO L125 PetriNetUnfolderBase]: For 26589/29591 co-relation queries the response was YES. [2025-03-15 00:43:35,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107276 conditions, 21625 events. 8171/21625 cut-off events. For 26589/29591 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 198554 event pairs, 427 based on Foata normal form. 55/20236 useless extension candidates. Maximal degree in co-relation 107170. Up to 12439 conditions per place. [2025-03-15 00:43:35,622 INFO L140 encePairwiseOnDemand]: 194/206 looper letters, 2796 selfloop transitions, 128 changer transitions 0/3027 dead transitions. [2025-03-15 00:43:35,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 3027 transitions, 40029 flow [2025-03-15 00:43:35,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:43:35,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:43:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1170 transitions. [2025-03-15 00:43:35,625 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7099514563106796 [2025-03-15 00:43:35,625 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 25 predicate places. [2025-03-15 00:43:35,625 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 3027 transitions, 40029 flow [2025-03-15 00:43:35,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:35,626 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:35,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:35,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:43:35,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:35,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1912589080, now seen corresponding path program 3 times [2025-03-15 00:43:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:35,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317727574] [2025-03-15 00:43:35,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:43:35,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:35,644 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:43:35,644 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:43:35,967 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:43:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317727574] [2025-03-15 00:43:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317727574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:43:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699004934] [2025-03-15 00:43:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:35,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:43:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:35,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:43:35,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:43:35,970 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:43:35,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 3027 transitions, 40029 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:35,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:35,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:43:35,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:43:45,655 INFO L124 PetriNetUnfolderBase]: 13050/34426 cut-off events. [2025-03-15 00:43:45,656 INFO L125 PetriNetUnfolderBase]: For 60291/69288 co-relation queries the response was YES. [2025-03-15 00:43:45,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195323 conditions, 34426 events. 13050/34426 cut-off events. For 60291/69288 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 348071 event pairs, 545 based on Foata normal form. 87/32282 useless extension candidates. Maximal degree in co-relation 195205. Up to 19477 conditions per place. [2025-03-15 00:43:45,842 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 5206 selfloop transitions, 88 changer transitions 0/5397 dead transitions. [2025-03-15 00:43:45,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 5397 transitions, 82747 flow [2025-03-15 00:43:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:43:45,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:43:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1249 transitions. [2025-03-15 00:43:45,844 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7578883495145631 [2025-03-15 00:43:45,845 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 32 predicate places. [2025-03-15 00:43:45,845 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 5397 transitions, 82747 flow [2025-03-15 00:43:45,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:45,845 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:43:45,845 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:43:45,845 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:43:45,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:43:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash 297595312, now seen corresponding path program 4 times [2025-03-15 00:43:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:43:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206157634] [2025-03-15 00:43:45,846 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:43:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:43:45,867 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:43:45,868 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:43:46,111 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:43:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:43:46,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206157634] [2025-03-15 00:43:46,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206157634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:43:46,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:43:46,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:43:46,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586057952] [2025-03-15 00:43:46,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:43:46,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:43:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:43:46,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:43:46,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:43:46,114 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:43:46,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 5397 transitions, 82747 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:43:46,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:43:46,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:43:46,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:44:02,162 INFO L124 PetriNetUnfolderBase]: 13185/35263 cut-off events. [2025-03-15 00:44:02,162 INFO L125 PetriNetUnfolderBase]: For 81771/95695 co-relation queries the response was YES. [2025-03-15 00:44:02,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223505 conditions, 35263 events. 13185/35263 cut-off events. For 81771/95695 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 359425 event pairs, 482 based on Foata normal form. 222/33214 useless extension candidates. Maximal degree in co-relation 223375. Up to 19639 conditions per place. [2025-03-15 00:44:02,373 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 5365 selfloop transitions, 52 changer transitions 0/5520 dead transitions. [2025-03-15 00:44:02,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 5520 transitions, 95447 flow [2025-03-15 00:44:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:44:02,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:44:02,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1243 transitions. [2025-03-15 00:44:02,376 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.754247572815534 [2025-03-15 00:44:02,376 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 39 predicate places. [2025-03-15 00:44:02,376 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 5520 transitions, 95447 flow [2025-03-15 00:44:02,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:02,377 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:44:02,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:02,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:44:02,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:44:02,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:44:02,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1533085472, now seen corresponding path program 5 times [2025-03-15 00:44:02,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:44:02,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818580503] [2025-03-15 00:44:02,378 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:44:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:44:02,398 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:44:02,398 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:44:02,684 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:44:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:44:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818580503] [2025-03-15 00:44:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818580503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:44:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:44:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:44:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810808081] [2025-03-15 00:44:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:44:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:44:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:44:02,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:44:02,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:44:02,686 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:44:02,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 5520 transitions, 95447 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:02,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:44:02,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:44:02,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:44:21,729 INFO L124 PetriNetUnfolderBase]: 13187/34938 cut-off events. [2025-03-15 00:44:21,729 INFO L125 PetriNetUnfolderBase]: For 112863/128299 co-relation queries the response was YES. [2025-03-15 00:44:21,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248725 conditions, 34938 events. 13187/34938 cut-off events. For 112863/128299 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 354702 event pairs, 545 based on Foata normal form. 176/32864 useless extension candidates. Maximal degree in co-relation 248583. Up to 19656 conditions per place. [2025-03-15 00:44:21,932 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 5241 selfloop transitions, 196 changer transitions 0/5540 dead transitions. [2025-03-15 00:44:21,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 5540 transitions, 106669 flow [2025-03-15 00:44:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:44:21,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:44:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1205 transitions. [2025-03-15 00:44:21,934 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7311893203883495 [2025-03-15 00:44:21,935 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 46 predicate places. [2025-03-15 00:44:21,935 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 5540 transitions, 106669 flow [2025-03-15 00:44:21,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:21,935 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:44:21,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:21,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:44:21,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:44:21,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:44:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash -77125500, now seen corresponding path program 6 times [2025-03-15 00:44:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:44:21,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25081216] [2025-03-15 00:44:21,936 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:44:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:44:21,953 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:44:21,953 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:44:22,157 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:44:22,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:44:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25081216] [2025-03-15 00:44:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25081216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:44:22,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:44:22,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:44:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078731597] [2025-03-15 00:44:22,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:44:22,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:44:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:44:22,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:44:22,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:44:22,159 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:44:22,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 5540 transitions, 106669 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:22,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:44:22,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:44:22,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:44:38,638 INFO L124 PetriNetUnfolderBase]: 11088/29533 cut-off events. [2025-03-15 00:44:38,638 INFO L125 PetriNetUnfolderBase]: For 119297/132744 co-relation queries the response was YES. [2025-03-15 00:44:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231262 conditions, 29533 events. 11088/29533 cut-off events. For 119297/132744 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 290074 event pairs, 451 based on Foata normal form. 216/27866 useless extension candidates. Maximal degree in co-relation 231108. Up to 16570 conditions per place. [2025-03-15 00:44:38,813 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 4426 selfloop transitions, 64 changer transitions 0/4593 dead transitions. [2025-03-15 00:44:38,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 4593 transitions, 96965 flow [2025-03-15 00:44:38,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:44:38,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:44:38,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1199 transitions. [2025-03-15 00:44:38,816 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7275485436893204 [2025-03-15 00:44:38,816 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 53 predicate places. [2025-03-15 00:44:38,816 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 4593 transitions, 96965 flow [2025-03-15 00:44:38,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:38,816 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:44:38,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:38,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:44:38,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:44:38,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:44:38,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1664160308, now seen corresponding path program 7 times [2025-03-15 00:44:38,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:44:38,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775353008] [2025-03-15 00:44:38,821 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:44:38,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:44:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:44:39,034 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:44:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:44:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775353008] [2025-03-15 00:44:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775353008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:44:39,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:44:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:44:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164387351] [2025-03-15 00:44:39,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:44:39,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:44:39,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:44:39,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:44:39,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:44:39,036 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:44:39,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 4593 transitions, 96965 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:39,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:44:39,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:44:39,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:44:53,905 INFO L124 PetriNetUnfolderBase]: 11164/29739 cut-off events. [2025-03-15 00:44:53,906 INFO L125 PetriNetUnfolderBase]: For 150188/166764 co-relation queries the response was YES. [2025-03-15 00:44:53,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253937 conditions, 29739 events. 11164/29739 cut-off events. For 150188/166764 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 292268 event pairs, 558 based on Foata normal form. 124/27955 useless extension candidates. Maximal degree in co-relation 253771. Up to 16607 conditions per place. [2025-03-15 00:44:54,129 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 4427 selfloop transitions, 107 changer transitions 0/4637 dead transitions. [2025-03-15 00:44:54,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 4637 transitions, 106959 flow [2025-03-15 00:44:54,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:44:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:44:54,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1201 transitions. [2025-03-15 00:44:54,131 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7287621359223301 [2025-03-15 00:44:54,131 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 60 predicate places. [2025-03-15 00:44:54,131 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 4637 transitions, 106959 flow [2025-03-15 00:44:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:54,132 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:44:54,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:54,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:44:54,132 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:44:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:44:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1272525236, now seen corresponding path program 8 times [2025-03-15 00:44:54,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:44:54,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110264374] [2025-03-15 00:44:54,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:44:54,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:44:54,148 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:44:54,148 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:44:54,321 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:44:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:44:54,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110264374] [2025-03-15 00:44:54,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110264374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:44:54,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:44:54,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:44:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059721276] [2025-03-15 00:44:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:44:54,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:44:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:44:54,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:44:54,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:44:54,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:44:54,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 4637 transitions, 106959 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:44:54,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:44:54,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:44:54,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:07,906 INFO L124 PetriNetUnfolderBase]: 9452/25677 cut-off events. [2025-03-15 00:45:07,906 INFO L125 PetriNetUnfolderBase]: For 158424/174067 co-relation queries the response was YES. [2025-03-15 00:45:07,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233944 conditions, 25677 events. 9452/25677 cut-off events. For 158424/174067 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 247068 event pairs, 415 based on Foata normal form. 160/24243 useless extension candidates. Maximal degree in co-relation 233766. Up to 14107 conditions per place. [2025-03-15 00:45:08,115 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 3832 selfloop transitions, 110 changer transitions 0/4045 dead transitions. [2025-03-15 00:45:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 4045 transitions, 100727 flow [2025-03-15 00:45:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:45:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:45:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1206 transitions. [2025-03-15 00:45:08,118 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7317961165048543 [2025-03-15 00:45:08,118 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 67 predicate places. [2025-03-15 00:45:08,118 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 4045 transitions, 100727 flow [2025-03-15 00:45:08,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:08,119 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:08,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:45:08,119 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:45:08,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash 26301920, now seen corresponding path program 9 times [2025-03-15 00:45:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:08,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684833835] [2025-03-15 00:45:08,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 00:45:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:08,138 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 00:45:08,138 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:08,344 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:45:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:08,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684833835] [2025-03-15 00:45:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684833835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:08,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:08,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:45:08,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152009680] [2025-03-15 00:45:08,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:08,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:45:08,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:08,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:45:08,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:45:08,346 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:45:08,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 4045 transitions, 100727 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:08,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:08,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:45:08,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:20,589 INFO L124 PetriNetUnfolderBase]: 9380/25684 cut-off events. [2025-03-15 00:45:20,590 INFO L125 PetriNetUnfolderBase]: For 190433/206459 co-relation queries the response was YES. [2025-03-15 00:45:20,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252239 conditions, 25684 events. 9380/25684 cut-off events. For 190433/206459 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 248054 event pairs, 518 based on Foata normal form. 92/24166 useless extension candidates. Maximal degree in co-relation 252049. Up to 14144 conditions per place. [2025-03-15 00:45:20,795 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 3856 selfloop transitions, 130 changer transitions 0/4089 dead transitions. [2025-03-15 00:45:20,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 4089 transitions, 109801 flow [2025-03-15 00:45:20,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:45:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:45:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1225 transitions. [2025-03-15 00:45:20,797 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7433252427184466 [2025-03-15 00:45:20,797 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 74 predicate places. [2025-03-15 00:45:20,797 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 4089 transitions, 109801 flow [2025-03-15 00:45:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:20,798 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:20,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:20,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:45:20,798 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:45:20,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:20,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1164273798, now seen corresponding path program 10 times [2025-03-15 00:45:20,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574398642] [2025-03-15 00:45:20,798 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 00:45:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:20,809 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 00:45:20,810 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:20,968 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:45:20,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:20,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574398642] [2025-03-15 00:45:20,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574398642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:20,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:20,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:45:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105151933] [2025-03-15 00:45:20,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:20,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:45:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:20,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:45:20,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:45:20,970 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:45:20,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 4089 transitions, 109801 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:20,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:20,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:45:20,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:35,477 INFO L124 PetriNetUnfolderBase]: 9515/26517 cut-off events. [2025-03-15 00:45:35,478 INFO L125 PetriNetUnfolderBase]: For 227131/251198 co-relation queries the response was YES. [2025-03-15 00:45:35,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275708 conditions, 26517 events. 9515/26517 cut-off events. For 227131/251198 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 258735 event pairs, 406 based on Foata normal form. 191/25063 useless extension candidates. Maximal degree in co-relation 275506. Up to 14368 conditions per place. [2025-03-15 00:45:35,707 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 4056 selfloop transitions, 53 changer transitions 0/4212 dead transitions. [2025-03-15 00:45:35,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 4212 transitions, 121361 flow [2025-03-15 00:45:35,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:45:35,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:45:35,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1219 transitions. [2025-03-15 00:45:35,710 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7396844660194175 [2025-03-15 00:45:35,710 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 81 predicate places. [2025-03-15 00:45:35,710 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 4212 transitions, 121361 flow [2025-03-15 00:45:35,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:35,711 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:35,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:35,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:45:35,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:45:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -822990824, now seen corresponding path program 11 times [2025-03-15 00:45:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070005260] [2025-03-15 00:45:35,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 00:45:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:35,729 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:45:35,730 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:36,103 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:45:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070005260] [2025-03-15 00:45:36,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070005260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:36,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:36,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:45:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008093848] [2025-03-15 00:45:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:36,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:45:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:36,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:45:36,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:45:36,105 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:45:36,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 4212 transitions, 121361 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:36,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:36,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:45:36,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:45:54,213 INFO L124 PetriNetUnfolderBase]: 11846/32358 cut-off events. [2025-03-15 00:45:54,213 INFO L125 PetriNetUnfolderBase]: For 345187/377164 co-relation queries the response was YES. [2025-03-15 00:45:54,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363610 conditions, 32358 events. 11846/32358 cut-off events. For 345187/377164 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 326566 event pairs, 583 based on Foata normal form. 142/30477 useless extension candidates. Maximal degree in co-relation 363396. Up to 17655 conditions per place. [2025-03-15 00:45:54,688 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 5081 selfloop transitions, 99 changer transitions 0/5283 dead transitions. [2025-03-15 00:45:54,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 5283 transitions, 163469 flow [2025-03-15 00:45:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:45:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:45:54,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1251 transitions. [2025-03-15 00:45:54,690 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7591019417475728 [2025-03-15 00:45:54,690 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 88 predicate places. [2025-03-15 00:45:54,690 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 5283 transitions, 163469 flow [2025-03-15 00:45:54,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:54,690 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:45:54,691 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:45:54,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:45:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:45:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1861765500, now seen corresponding path program 12 times [2025-03-15 00:45:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:45:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391244996] [2025-03-15 00:45:54,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 00:45:54,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:45:54,702 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 00:45:54,702 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:45:54,857 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:45:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:45:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391244996] [2025-03-15 00:45:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391244996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:45:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:45:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:45:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645880730] [2025-03-15 00:45:54,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:45:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:45:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:45:54,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:45:54,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:45:54,859 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:45:54,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 5283 transitions, 163469 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:45:54,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:45:54,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:45:54,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:18,037 INFO L124 PetriNetUnfolderBase]: 9722/27188 cut-off events. [2025-03-15 00:46:18,037 INFO L125 PetriNetUnfolderBase]: For 319066/349153 co-relation queries the response was YES. [2025-03-15 00:46:18,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320846 conditions, 27188 events. 9722/27188 cut-off events. For 319066/349153 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 266813 event pairs, 391 based on Foata normal form. 237/25760 useless extension candidates. Maximal degree in co-relation 320620. Up to 14678 conditions per place. [2025-03-15 00:46:18,275 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 4225 selfloop transitions, 57 changer transitions 0/4385 dead transitions. [2025-03-15 00:46:18,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 4385 transitions, 143501 flow [2025-03-15 00:46:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:46:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:46:18,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1237 transitions. [2025-03-15 00:46:18,277 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7506067961165048 [2025-03-15 00:46:18,277 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 95 predicate places. [2025-03-15 00:46:18,277 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 4385 transitions, 143501 flow [2025-03-15 00:46:18,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:46:18,278 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:46:18,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:46:18,278 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:46:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:46:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2050117296, now seen corresponding path program 13 times [2025-03-15 00:46:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:46:18,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328651217] [2025-03-15 00:46:18,279 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 00:46:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:46:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:46:18,456 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:46:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:46:18,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328651217] [2025-03-15 00:46:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328651217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:46:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:46:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:46:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203453970] [2025-03-15 00:46:18,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:46:18,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:46:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:46:18,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:46:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:46:18,457 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:46:18,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 4385 transitions, 143501 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:46:18,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:46:18,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:46:18,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:35,159 INFO L124 PetriNetUnfolderBase]: 9798/26976 cut-off events. [2025-03-15 00:46:35,159 INFO L125 PetriNetUnfolderBase]: For 375472/400710 co-relation queries the response was YES. [2025-03-15 00:46:35,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340967 conditions, 26976 events. 9798/26976 cut-off events. For 375472/400710 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 262973 event pairs, 494 based on Foata normal form. 146/25468 useless extension candidates. Maximal degree in co-relation 340729. Up to 14707 conditions per place. [2025-03-15 00:46:35,417 INFO L140 encePairwiseOnDemand]: 193/206 looper letters, 4172 selfloop transitions, 130 changer transitions 0/4405 dead transitions. [2025-03-15 00:46:35,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 4405 transitions, 152773 flow [2025-03-15 00:46:35,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:46:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:46:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1225 transitions. [2025-03-15 00:46:35,419 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7433252427184466 [2025-03-15 00:46:35,419 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 102 predicate places. [2025-03-15 00:46:35,420 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 4405 transitions, 152773 flow [2025-03-15 00:46:35,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:46:35,420 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:46:35,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:46:35,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:46:35,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:46:35,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1691351172, now seen corresponding path program 14 times [2025-03-15 00:46:35,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:46:35,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470631726] [2025-03-15 00:46:35,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 00:46:35,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:46:35,434 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 00:46:35,434 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 00:46:35,757 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:46:35,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:46:35,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470631726] [2025-03-15 00:46:35,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470631726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:46:35,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:46:35,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 00:46:35,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225031824] [2025-03-15 00:46:35,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:46:35,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 00:46:35,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:46:35,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 00:46:35,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 00:46:35,759 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 206 [2025-03-15 00:46:35,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 4405 transitions, 152773 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:46:35,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:46:35,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 206 [2025-03-15 00:46:35,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:39,982 INFO L124 PetriNetUnfolderBase]: 1793/5803 cut-off events. [2025-03-15 00:46:39,982 INFO L125 PetriNetUnfolderBase]: For 88329/91079 co-relation queries the response was YES. [2025-03-15 00:46:39,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73764 conditions, 5803 events. 1793/5803 cut-off events. For 88329/91079 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 47923 event pairs, 33 based on Foata normal form. 174/5786 useless extension candidates. Maximal degree in co-relation 73514. Up to 2777 conditions per place. [2025-03-15 00:46:40,033 INFO L140 encePairwiseOnDemand]: 192/206 looper letters, 1325 selfloop transitions, 94 changer transitions 0/1522 dead transitions. [2025-03-15 00:46:40,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1522 transitions, 52505 flow [2025-03-15 00:46:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:46:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:46:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1152 transitions. [2025-03-15 00:46:40,036 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6990291262135923 [2025-03-15 00:46:40,036 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 101 predicate places. [2025-03-15 00:46:40,036 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 1522 transitions, 52505 flow [2025-03-15 00:46:40,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 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:46:40,036 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:46:40,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:46:40,037 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:46:40,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:46:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1237469579, now seen corresponding path program 1 times [2025-03-15 00:46:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:46:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095332621] [2025-03-15 00:46:40,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:46:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:46:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:46:40,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:46:40,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:46:40,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095332621] [2025-03-15 00:46:40,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095332621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:46:40,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:46:40,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 00:46:40,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890189434] [2025-03-15 00:46:40,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:46:40,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 00:46:40,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:46:40,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 00:46:40,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 00:46:40,168 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 206 [2025-03-15 00:46:40,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 1522 transitions, 52505 flow. Second operand has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 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:46:40,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:46:40,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 206 [2025-03-15 00:46:40,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:42,484 INFO L124 PetriNetUnfolderBase]: 2267/7583 cut-off events. [2025-03-15 00:46:42,484 INFO L125 PetriNetUnfolderBase]: For 124033/127416 co-relation queries the response was YES. [2025-03-15 00:46:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99504 conditions, 7583 events. 2267/7583 cut-off events. For 124033/127416 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 62453 event pairs, 43 based on Foata normal form. 27/7376 useless extension candidates. Maximal degree in co-relation 99230. Up to 3728 conditions per place. [2025-03-15 00:46:42,542 INFO L140 encePairwiseOnDemand]: 195/206 looper letters, 1130 selfloop transitions, 34 changer transitions 359/1978 dead transitions. [2025-03-15 00:46:42,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 1978 transitions, 72165 flow [2025-03-15 00:46:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 00:46:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 00:46:42,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1028 transitions. [2025-03-15 00:46:42,544 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6237864077669902 [2025-03-15 00:46:42,544 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 108 predicate places. [2025-03-15 00:46:42,544 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 1978 transitions, 72165 flow [2025-03-15 00:46:42,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.55555555555556) internal successors, (1085), 9 states have internal predecessors, (1085), 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:46:42,544 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:46:42,544 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:42,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 00:46:42,545 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 14 more)] === [2025-03-15 00:46:42,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:46:42,545 INFO L85 PathProgramCache]: Analyzing trace with hash 271641433, now seen corresponding path program 1 times [2025-03-15 00:46:42,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:46:42,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552743725] [2025-03-15 00:46:42,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:46:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:46:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:46:42,739 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:46:42,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:46:42,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552743725] [2025-03-15 00:46:42,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552743725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:46:42,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:46:42,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:46:42,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148385903] [2025-03-15 00:46:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:46:42,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:46:42,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:46:42,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:46:42,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:46:42,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 206 [2025-03-15 00:46:42,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 1978 transitions, 72165 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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:46:42,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:46:42,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 206 [2025-03-15 00:46:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:46:45,471 INFO L124 PetriNetUnfolderBase]: 2249/7536 cut-off events. [2025-03-15 00:46:45,472 INFO L125 PetriNetUnfolderBase]: For 135799/139072 co-relation queries the response was YES. [2025-03-15 00:46:45,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102175 conditions, 7536 events. 2249/7536 cut-off events. For 135799/139072 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 62031 event pairs, 45 based on Foata normal form. 3/7333 useless extension candidates. Maximal degree in co-relation 101894. Up to 3686 conditions per place. [2025-03-15 00:46:45,506 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 0 selfloop transitions, 0 changer transitions 1963/1963 dead transitions. [2025-03-15 00:46:45,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 1963 transitions, 74889 flow [2025-03-15 00:46:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:46:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:46:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2025-03-15 00:46:45,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6423948220064725 [2025-03-15 00:46:45,508 INFO L298 CegarLoopForPetriNet]: 200 programPoint places, 112 predicate places. [2025-03-15 00:46:45,508 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 1963 transitions, 74889 flow [2025-03-15 00:46:45,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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:46:45,524 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i_petrified1_AllErrorsAtOnce [2025-03-15 00:46:45,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONDATA_RACE (5 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr3ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr4ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2025-03-15 00:46:45,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr5ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2025-03-15 00:46:45,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 00:46:45,648 INFO L422 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1, 1, 1] [2025-03-15 00:46:45,657 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:46:45,657 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:46:45,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:46:45 BasicIcfg [2025-03-15 00:46:45,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:46:45,662 INFO L158 Benchmark]: Toolchain (without parser) took 205876.89ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 42.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-15 00:46:45,663 INFO L158 Benchmark]: CDTParser took 1.25ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:46:45,663 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.54ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 21.9MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 00:46:45,663 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.19ms. Allocated memory is still 71.3MB. Free memory was 21.9MB in the beginning and 19.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:46:45,663 INFO L158 Benchmark]: Boogie Preprocessor took 58.13ms. Allocated memory is still 71.3MB. Free memory was 19.3MB in the beginning and 43.4MB in the end (delta: -24.1MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-15 00:46:45,663 INFO L158 Benchmark]: RCFGBuilder took 493.24ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 21.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-15 00:46:45,664 INFO L158 Benchmark]: TraceAbstraction took 204853.15ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 19.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-15 00:46:45,665 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 36.0MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.54ms. Allocated memory is still 71.3MB. Free memory was 42.5MB in the beginning and 21.9MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.19ms. Allocated memory is still 71.3MB. Free memory was 21.9MB in the beginning and 19.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 58.13ms. Allocated memory is still 71.3MB. Free memory was 19.3MB in the beginning and 43.4MB in the end (delta: -24.1MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * RCFGBuilder took 493.24ms. Allocated memory is still 71.3MB. Free memory was 43.4MB in the beginning and 21.0MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 204853.15ms. Allocated memory was 71.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 19.7MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 715]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 723]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 726]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 724]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 728]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 297 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 204.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 198.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5924 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5924 mSDsluCounter, 6369 SdHoareTripleChecker+Invalid, 6.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3888 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10756 IncrementalHoareTripleChecker+Invalid, 10981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 2481 mSDtfsCounter, 10756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163469occurred in iteration=15, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1633 NumberOfCodeBlocks, 1617 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1613 ConstructedInterpolants, 0 QuantifiedInterpolants, 6567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:46:45,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...