/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/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:59:32,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:59:32,711 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:59:32,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:59:32,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:59:32,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:59:32,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:59:32,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:59:32,739 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:59:32,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:59:32,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:59:32,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:59:32,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:32,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:59:32,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:59:32,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:59:32,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:59:32,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:59:32,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:59:32,742 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:59:32,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:59:33,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:59:33,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:59:33,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:59:33,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:59:33,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-03-15 00:59:34,964 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6becb41/ee91ab1343c944d0acceb5006a71e296/FLAG0781e8de5 [2025-03-15 00:59:35,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:59:35,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-03-15 00:59:35,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6becb41/ee91ab1343c944d0acceb5006a71e296/FLAG0781e8de5 [2025-03-15 00:59:35,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6becb41/ee91ab1343c944d0acceb5006a71e296 [2025-03-15 00:59:35,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:59:35,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:59:35,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:35,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:59:35,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:59:35,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f59ce5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35, skipping insertion in model container [2025-03-15 00:59:35,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:59:35,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:35,390 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:59:35,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:59:35,436 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:59:35,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35 WrapperNode [2025-03-15 00:59:35,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:59:35,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:35,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:59:35,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:59:35,441 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:59:35" (1/1) ... [2025-03-15 00:59:35,448 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:59:35" (1/1) ... [2025-03-15 00:59:35,484 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-03-15 00:59:35,484 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:59:35,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:59:35,485 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:59:35,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:59:35,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:59:35,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:59:35,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:59:35,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:59:35,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (1/1) ... [2025-03-15 00:59:35,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:59:35,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:59:35,547 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:59:35,550 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:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:59:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:59:35,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 00:59:35,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 00:59:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:59:35,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:59:35,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 00:59:35,569 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:59:35,657 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:59:35,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:59:36,282 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:59:36,282 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:59:36,313 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:59:36,314 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 00:59:36,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:36 BoogieIcfgContainer [2025-03-15 00:59:36,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:59:36,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:59:36,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:59:36,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:59:36,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:59:35" (1/3) ... [2025-03-15 00:59:36,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498d6504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:36, skipping insertion in model container [2025-03-15 00:59:36,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:59:35" (2/3) ... [2025-03-15 00:59:36,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498d6504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:59:36, skipping insertion in model container [2025-03-15 00:59:36,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:59:36" (3/3) ... [2025-03-15 00:59:36,321 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-15 00:59:36,333 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:59:36,335 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 674 locations, 1 initial locations, 3 loop locations, and 73 error locations. [2025-03-15 00:59:36,335 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:59:36,469 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 00:59:36,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:59:36,530 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;@269bd0a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:59:36,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2025-03-15 00:59:36,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:59:36,550 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-15 00:59:36,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:59:36,553 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:36,554 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] [2025-03-15 00:59:36,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:36,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash -426194873, now seen corresponding path program 1 times [2025-03-15 00:59:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:36,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145195446] [2025-03-15 00:59:36,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:36,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:36,745 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:59:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145195446] [2025-03-15 00:59:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145195446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:36,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:36,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668774018] [2025-03-15 00:59:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:36,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:36,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:36,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:36,787 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 705 [2025-03-15 00:59:36,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 705 transitions, 1424 flow. Second operand has 3 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 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:59:36,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:36,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 705 [2025-03-15 00:59:36,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:37,240 INFO L124 PetriNetUnfolderBase]: 35/1335 cut-off events. [2025-03-15 00:59:37,241 INFO L125 PetriNetUnfolderBase]: For 26/29 co-relation queries the response was YES. [2025-03-15 00:59:37,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1335 events. 35/1335 cut-off events. For 26/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6908 event pairs, 18 based on Foata normal form. 144/1273 useless extension candidates. Maximal degree in co-relation 1191. Up to 82 conditions per place. [2025-03-15 00:59:37,274 INFO L140 encePairwiseOnDemand]: 679/705 looper letters, 43 selfloop transitions, 2 changer transitions 12/673 dead transitions. [2025-03-15 00:59:37,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 673 transitions, 1448 flow [2025-03-15 00:59:37,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:37,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1974 transitions. [2025-03-15 00:59:37,290 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-15 00:59:37,293 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -8 predicate places. [2025-03-15 00:59:37,293 INFO L471 AbstractCegarLoop]: Abstraction has has 672 places, 673 transitions, 1448 flow [2025-03-15 00:59:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 636.3333333333334) internal successors, (1909), 3 states have internal predecessors, (1909), 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:59:37,295 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:37,295 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:37,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:59:37,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1606248111, now seen corresponding path program 1 times [2025-03-15 00:59:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:37,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366969103] [2025-03-15 00:59:37,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:37,349 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:59:37,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:37,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366969103] [2025-03-15 00:59:37,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366969103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:37,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:37,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:37,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54776284] [2025-03-15 00:59:37,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:37,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:37,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:37,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:37,357 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 705 [2025-03-15 00:59:37,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 673 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:37,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:37,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 705 [2025-03-15 00:59:37,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:37,758 INFO L124 PetriNetUnfolderBase]: 56/1566 cut-off events. [2025-03-15 00:59:37,758 INFO L125 PetriNetUnfolderBase]: For 205/229 co-relation queries the response was YES. [2025-03-15 00:59:37,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1566 events. 56/1566 cut-off events. For 205/229 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9231 event pairs, 36 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 1264. Up to 121 conditions per place. [2025-03-15 00:59:37,772 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 28 selfloop transitions, 2 changer transitions 12/672 dead transitions. [2025-03-15 00:59:37,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 672 transitions, 1506 flow [2025-03-15 00:59:37,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:37,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:37,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2025-03-15 00:59:37,775 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9366430260047282 [2025-03-15 00:59:37,777 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -7 predicate places. [2025-03-15 00:59:37,777 INFO L471 AbstractCegarLoop]: Abstraction has has 673 places, 672 transitions, 1506 flow [2025-03-15 00:59:37,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:37,778 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:37,778 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] [2025-03-15 00:59:37,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:59:37,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:37,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1131415960, now seen corresponding path program 1 times [2025-03-15 00:59:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217520697] [2025-03-15 00:59:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:37,835 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:59:37,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217520697] [2025-03-15 00:59:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217520697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:37,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043795377] [2025-03-15 00:59:37,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:37,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:37,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:37,837 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-15 00:59:37,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 672 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:59:37,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:37,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-15 00:59:37,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:38,043 INFO L124 PetriNetUnfolderBase]: 59/1568 cut-off events. [2025-03-15 00:59:38,044 INFO L125 PetriNetUnfolderBase]: For 437/461 co-relation queries the response was YES. [2025-03-15 00:59:38,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1568 events. 59/1568 cut-off events. For 437/461 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9208 event pairs, 39 based on Foata normal form. 0/1324 useless extension candidates. Maximal degree in co-relation 1307. Up to 124 conditions per place. [2025-03-15 00:59:38,055 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 12/671 dead transitions. [2025-03-15 00:59:38,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 671 transitions, 1528 flow [2025-03-15 00:59:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:38,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-03-15 00:59:38,058 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-03-15 00:59:38,060 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -6 predicate places. [2025-03-15 00:59:38,060 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 671 transitions, 1528 flow [2025-03-15 00:59:38,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:59:38,061 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:38,061 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] [2025-03-15 00:59:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:59:38,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1162586777, now seen corresponding path program 1 times [2025-03-15 00:59:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041237698] [2025-03-15 00:59:38,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:38,096 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:59:38,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041237698] [2025-03-15 00:59:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041237698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:38,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574624616] [2025-03-15 00:59:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:38,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:38,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:38,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:38,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:38,099 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-15 00:59:38,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 671 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:59:38,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:38,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-15 00:59:38,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:38,383 INFO L124 PetriNetUnfolderBase]: 62/1570 cut-off events. [2025-03-15 00:59:38,383 INFO L125 PetriNetUnfolderBase]: For 785/815 co-relation queries the response was YES. [2025-03-15 00:59:38,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 1570 events. 62/1570 cut-off events. For 785/815 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9347 event pairs, 42 based on Foata normal form. 0/1327 useless extension candidates. Maximal degree in co-relation 1338. Up to 127 conditions per place. [2025-03-15 00:59:38,396 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 12/670 dead transitions. [2025-03-15 00:59:38,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 670 transitions, 1550 flow [2025-03-15 00:59:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-03-15 00:59:38,401 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-03-15 00:59:38,401 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -5 predicate places. [2025-03-15 00:59:38,402 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 670 transitions, 1550 flow [2025-03-15 00:59:38,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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:59:38,402 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:38,403 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] [2025-03-15 00:59:38,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:59:38,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:38,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1963321101, now seen corresponding path program 1 times [2025-03-15 00:59:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124485995] [2025-03-15 00:59:38,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:38,445 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:59:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124485995] [2025-03-15 00:59:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124485995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128798408] [2025-03-15 00:59:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:38,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:38,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:38,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 705 [2025-03-15 00:59:38,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 670 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:38,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:38,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 705 [2025-03-15 00:59:38,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:38,734 INFO L124 PetriNetUnfolderBase]: 74/1581 cut-off events. [2025-03-15 00:59:38,735 INFO L125 PetriNetUnfolderBase]: For 2065/2410 co-relation queries the response was YES. [2025-03-15 00:59:38,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2178 conditions, 1581 events. 74/1581 cut-off events. For 2065/2410 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9592 event pairs, 54 based on Foata normal form. 0/1339 useless extension candidates. Maximal degree in co-relation 1480. Up to 139 conditions per place. [2025-03-15 00:59:38,755 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 25 selfloop transitions, 2 changer transitions 12/669 dead transitions. [2025-03-15 00:59:38,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 669 transitions, 1602 flow [2025-03-15 00:59:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2025-03-15 00:59:38,759 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394799054373523 [2025-03-15 00:59:38,760 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -4 predicate places. [2025-03-15 00:59:38,760 INFO L471 AbstractCegarLoop]: Abstraction has has 676 places, 669 transitions, 1602 flow [2025-03-15 00:59:38,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:38,761 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:38,761 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] [2025-03-15 00:59:38,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:59:38,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:38,762 INFO L85 PathProgramCache]: Analyzing trace with hash 112019019, now seen corresponding path program 1 times [2025-03-15 00:59:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:38,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934913749] [2025-03-15 00:59:38,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:38,829 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:59:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:38,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934913749] [2025-03-15 00:59:38,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934913749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:38,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:38,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:38,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969087232] [2025-03-15 00:59:38,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:38,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:38,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:38,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:38,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:38,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 705 [2025-03-15 00:59:38,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 669 transitions, 1602 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:38,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:38,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 705 [2025-03-15 00:59:38,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:39,146 INFO L124 PetriNetUnfolderBase]: 86/1592 cut-off events. [2025-03-15 00:59:39,146 INFO L125 PetriNetUnfolderBase]: For 4487/5057 co-relation queries the response was YES. [2025-03-15 00:59:39,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2391 conditions, 1592 events. 86/1592 cut-off events. For 4487/5057 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10036 event pairs, 66 based on Foata normal form. 0/1348 useless extension candidates. Maximal degree in co-relation 1550. Up to 150 conditions per place. [2025-03-15 00:59:39,155 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 24 selfloop transitions, 2 changer transitions 12/668 dead transitions. [2025-03-15 00:59:39,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 668 transitions, 1654 flow [2025-03-15 00:59:39,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2025-03-15 00:59:39,158 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394799054373523 [2025-03-15 00:59:39,158 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -3 predicate places. [2025-03-15 00:59:39,158 INFO L471 AbstractCegarLoop]: Abstraction has has 677 places, 668 transitions, 1654 flow [2025-03-15 00:59:39,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:39,159 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:39,159 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] [2025-03-15 00:59:39,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:59:39,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:39,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1072372617, now seen corresponding path program 1 times [2025-03-15 00:59:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:39,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121601969] [2025-03-15 00:59:39,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:39,190 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:59:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:39,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121601969] [2025-03-15 00:59:39,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121601969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:39,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:39,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593012495] [2025-03-15 00:59:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:39,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:39,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:39,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:39,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:39,193 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 705 [2025-03-15 00:59:39,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 668 transitions, 1654 flow. Second operand has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:39,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:39,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 705 [2025-03-15 00:59:39,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:39,362 INFO L124 PetriNetUnfolderBase]: 99/1178 cut-off events. [2025-03-15 00:59:39,363 INFO L125 PetriNetUnfolderBase]: For 17672/26653 co-relation queries the response was YES. [2025-03-15 00:59:39,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1178 events. 99/1178 cut-off events. For 17672/26653 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6598 event pairs, 84 based on Foata normal form. 0/999 useless extension candidates. Maximal degree in co-relation 1302. Up to 146 conditions per place. [2025-03-15 00:59:39,378 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 28 selfloop transitions, 2 changer transitions 12/667 dead transitions. [2025-03-15 00:59:39,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 678 places, 667 transitions, 1712 flow [2025-03-15 00:59:39,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2025-03-15 00:59:39,381 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9366430260047282 [2025-03-15 00:59:39,382 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -2 predicate places. [2025-03-15 00:59:39,383 INFO L471 AbstractCegarLoop]: Abstraction has has 678 places, 667 transitions, 1712 flow [2025-03-15 00:59:39,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:39,384 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:39,384 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] [2025-03-15 00:59:39,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:59:39,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:39,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:39,384 INFO L85 PathProgramCache]: Analyzing trace with hash 492333006, now seen corresponding path program 1 times [2025-03-15 00:59:39,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:39,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385125269] [2025-03-15 00:59:39,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:39,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:39,432 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:59:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385125269] [2025-03-15 00:59:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385125269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867780057] [2025-03-15 00:59:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:39,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:39,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:39,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:39,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 650 out of 705 [2025-03-15 00:59:39,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 667 transitions, 1712 flow. Second operand has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:39,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:39,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 650 of 705 [2025-03-15 00:59:39,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:39,643 INFO L124 PetriNetUnfolderBase]: 116/1194 cut-off events. [2025-03-15 00:59:39,644 INFO L125 PetriNetUnfolderBase]: For 45077/62012 co-relation queries the response was YES. [2025-03-15 00:59:39,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1194 events. 116/1194 cut-off events. For 45077/62012 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7212 event pairs, 102 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 1372. Up to 164 conditions per place. [2025-03-15 00:59:39,654 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 28 selfloop transitions, 2 changer transitions 12/666 dead transitions. [2025-03-15 00:59:39,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 666 transitions, 1770 flow [2025-03-15 00:59:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2025-03-15 00:59:39,657 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9366430260047282 [2025-03-15 00:59:39,659 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -1 predicate places. [2025-03-15 00:59:39,659 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 666 transitions, 1770 flow [2025-03-15 00:59:39,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 651.3333333333334) internal successors, (1954), 3 states have internal predecessors, (1954), 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:59:39,660 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:39,660 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] [2025-03-15 00:59:39,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:59:39,660 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:39,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1348438054, now seen corresponding path program 1 times [2025-03-15 00:59:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165076571] [2025-03-15 00:59:39,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:39,695 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:59:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:39,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165076571] [2025-03-15 00:59:39,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165076571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:39,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186375337] [2025-03-15 00:59:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:39,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:39,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:39,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:39,698 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 662 out of 705 [2025-03-15 00:59:39,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 666 transitions, 1770 flow. Second operand has 3 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 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:59:39,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:39,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 662 of 705 [2025-03-15 00:59:39,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:39,913 INFO L124 PetriNetUnfolderBase]: 144/2062 cut-off events. [2025-03-15 00:59:39,913 INFO L125 PetriNetUnfolderBase]: For 71467/89444 co-relation queries the response was YES. [2025-03-15 00:59:39,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3813 conditions, 2062 events. 144/2062 cut-off events. For 71467/89444 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 15398 event pairs, 117 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 2557. Up to 213 conditions per place. [2025-03-15 00:59:39,930 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 16 selfloop transitions, 2 changer transitions 12/665 dead transitions. [2025-03-15 00:59:39,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 665 transitions, 1804 flow [2025-03-15 00:59:39,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2025-03-15 00:59:39,933 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9479905437352246 [2025-03-15 00:59:39,933 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, 0 predicate places. [2025-03-15 00:59:39,933 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 665 transitions, 1804 flow [2025-03-15 00:59:39,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 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:59:39,934 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:39,934 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:59:39,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:59:39,934 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:39,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2054871985, now seen corresponding path program 1 times [2025-03-15 00:59:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539566801] [2025-03-15 00:59:39,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:39,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:59:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539566801] [2025-03-15 00:59:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539566801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538087480] [2025-03-15 00:59:39,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:39,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:39,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:39,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:39,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-15 00:59:39,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 665 transitions, 1804 flow. Second operand has 3 states, 3 states have (on average 667.3333333333334) internal successors, (2002), 3 states have internal predecessors, (2002), 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:59:39,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:39,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-15 00:59:39,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:40,164 INFO L124 PetriNetUnfolderBase]: 134/1834 cut-off events. [2025-03-15 00:59:40,164 INFO L125 PetriNetUnfolderBase]: For 96180/114148 co-relation queries the response was YES. [2025-03-15 00:59:40,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1834 events. 134/1834 cut-off events. For 96180/114148 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13032 event pairs, 110 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 2327. Up to 193 conditions per place. [2025-03-15 00:59:40,179 INFO L140 encePairwiseOnDemand]: 701/705 looper letters, 11 selfloop transitions, 1 changer transitions 12/662 dead transitions. [2025-03-15 00:59:40,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 662 transitions, 1816 flow [2025-03-15 00:59:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2013 transitions. [2025-03-15 00:59:40,182 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9517730496453901 [2025-03-15 00:59:40,182 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -1 predicate places. [2025-03-15 00:59:40,182 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 662 transitions, 1816 flow [2025-03-15 00:59:40,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 667.3333333333334) internal successors, (2002), 3 states have internal predecessors, (2002), 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:59:40,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:40,183 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] [2025-03-15 00:59:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:59:40,183 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:40,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:40,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1242829031, now seen corresponding path program 1 times [2025-03-15 00:59:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723138638] [2025-03-15 00:59:40,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:40,241 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:59:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723138638] [2025-03-15 00:59:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723138638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586949216] [2025-03-15 00:59:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:40,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:40,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:40,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:40,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:40,243 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 705 [2025-03-15 00:59:40,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 662 transitions, 1816 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:40,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:40,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 705 [2025-03-15 00:59:40,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:40,757 INFO L124 PetriNetUnfolderBase]: 261/3527 cut-off events. [2025-03-15 00:59:40,757 INFO L125 PetriNetUnfolderBase]: For 35873/38036 co-relation queries the response was YES. [2025-03-15 00:59:40,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 3527 events. 261/3527 cut-off events. For 35873/38036 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 28581 event pairs, 209 based on Foata normal form. 0/2947 useless extension candidates. Maximal degree in co-relation 4851. Up to 360 conditions per place. [2025-03-15 00:59:40,790 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 25 selfloop transitions, 2 changer transitions 12/661 dead transitions. [2025-03-15 00:59:40,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 661 transitions, 1868 flow [2025-03-15 00:59:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2025-03-15 00:59:40,794 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394799054373523 [2025-03-15 00:59:40,794 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, 0 predicate places. [2025-03-15 00:59:40,794 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 661 transitions, 1868 flow [2025-03-15 00:59:40,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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:59:40,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:40,796 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] [2025-03-15 00:59:40,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:59:40,796 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:40,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash -822000430, now seen corresponding path program 1 times [2025-03-15 00:59:40,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:40,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405131234] [2025-03-15 00:59:40,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:41,164 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:59:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405131234] [2025-03-15 00:59:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405131234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 00:59:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060559032] [2025-03-15 00:59:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 00:59:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:41,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 00:59:41,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 00:59:41,167 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 705 [2025-03-15 00:59:41,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 661 transitions, 1868 flow. Second operand has 6 states, 6 states have (on average 624.8333333333334) internal successors, (3749), 6 states have internal predecessors, (3749), 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:59:41,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:41,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 705 [2025-03-15 00:59:41,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:42,010 INFO L124 PetriNetUnfolderBase]: 679/6311 cut-off events. [2025-03-15 00:59:42,011 INFO L125 PetriNetUnfolderBase]: For 53195/56054 co-relation queries the response was YES. [2025-03-15 00:59:42,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11456 conditions, 6311 events. 679/6311 cut-off events. For 53195/56054 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 58581 event pairs, 575 based on Foata normal form. 0/5310 useless extension candidates. Maximal degree in co-relation 9603. Up to 1159 conditions per place. [2025-03-15 00:59:42,039 INFO L140 encePairwiseOnDemand]: 699/705 looper letters, 53 selfloop transitions, 5 changer transitions 12/660 dead transitions. [2025-03-15 00:59:42,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 660 transitions, 1982 flow [2025-03-15 00:59:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 00:59:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 00:59:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3797 transitions. [2025-03-15 00:59:42,043 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8976359338061466 [2025-03-15 00:59:42,043 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, 4 predicate places. [2025-03-15 00:59:42,043 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 660 transitions, 1982 flow [2025-03-15 00:59:42,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 624.8333333333334) internal successors, (3749), 6 states have internal predecessors, (3749), 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:59:42,045 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:42,045 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, 1] [2025-03-15 00:59:42,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:59:42,045 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:42,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:42,046 INFO L85 PathProgramCache]: Analyzing trace with hash 285930206, now seen corresponding path program 1 times [2025-03-15 00:59:42,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:42,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139985006] [2025-03-15 00:59:42,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:42,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:42,075 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:59:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:42,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139985006] [2025-03-15 00:59:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139985006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824866267] [2025-03-15 00:59:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:42,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:42,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:42,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:42,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 639 out of 705 [2025-03-15 00:59:42,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 660 transitions, 1982 flow. Second operand has 3 states, 3 states have (on average 640.3333333333334) internal successors, (1921), 3 states have internal predecessors, (1921), 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:59:42,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:42,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 639 of 705 [2025-03-15 00:59:42,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:43,164 INFO L124 PetriNetUnfolderBase]: 693/6749 cut-off events. [2025-03-15 00:59:43,165 INFO L125 PetriNetUnfolderBase]: For 52605/57084 co-relation queries the response was YES. [2025-03-15 00:59:43,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12469 conditions, 6749 events. 693/6749 cut-off events. For 52605/57084 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 63286 event pairs, 576 based on Foata normal form. 0/5696 useless extension candidates. Maximal degree in co-relation 10527. Up to 1199 conditions per place. [2025-03-15 00:59:43,199 INFO L140 encePairwiseOnDemand]: 690/705 looper letters, 30 selfloop transitions, 5 changer transitions 12/653 dead transitions. [2025-03-15 00:59:43,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 653 transitions, 2049 flow [2025-03-15 00:59:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1962 transitions. [2025-03-15 00:59:43,203 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9276595744680851 [2025-03-15 00:59:43,203 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -4 predicate places. [2025-03-15 00:59:43,204 INFO L471 AbstractCegarLoop]: Abstraction has has 676 places, 653 transitions, 2049 flow [2025-03-15 00:59:43,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 640.3333333333334) internal successors, (1921), 3 states have internal predecessors, (1921), 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:59:43,205 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:43,205 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, 1, 1, 1] [2025-03-15 00:59:43,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 00:59:43,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -98936092, now seen corresponding path program 1 times [2025-03-15 00:59:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763821538] [2025-03-15 00:59:43,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:43,243 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:59:43,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:43,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763821538] [2025-03-15 00:59:43,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763821538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:43,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:43,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92111569] [2025-03-15 00:59:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:43,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:43,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:43,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:43,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:43,246 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 705 [2025-03-15 00:59:43,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 676 places, 653 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:43,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:43,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 705 [2025-03-15 00:59:43,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:44,269 INFO L124 PetriNetUnfolderBase]: 712/7954 cut-off events. [2025-03-15 00:59:44,269 INFO L125 PetriNetUnfolderBase]: For 64642/69417 co-relation queries the response was YES. [2025-03-15 00:59:44,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14635 conditions, 7954 events. 712/7954 cut-off events. For 64642/69417 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 75829 event pairs, 568 based on Foata normal form. 0/6803 useless extension candidates. Maximal degree in co-relation 12558. Up to 1200 conditions per place. [2025-03-15 00:59:44,318 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 21 selfloop transitions, 5 changer transitions 12/651 dead transitions. [2025-03-15 00:59:44,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 651 transitions, 2120 flow [2025-03-15 00:59:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1992 transitions. [2025-03-15 00:59:44,321 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9418439716312057 [2025-03-15 00:59:44,321 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -7 predicate places. [2025-03-15 00:59:44,321 INFO L471 AbstractCegarLoop]: Abstraction has has 673 places, 651 transitions, 2120 flow [2025-03-15 00:59:44,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:44,322 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:44,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:44,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 00:59:44,323 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1791125759, now seen corresponding path program 1 times [2025-03-15 00:59:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200344289] [2025-03-15 00:59:44,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:44,361 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:59:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:44,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200344289] [2025-03-15 00:59:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200344289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:44,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193135787] [2025-03-15 00:59:44,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:44,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:44,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:44,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:44,364 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 657 out of 705 [2025-03-15 00:59:44,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 651 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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:59:44,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:44,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 705 [2025-03-15 00:59:44,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:46,283 INFO L124 PetriNetUnfolderBase]: 1129/13586 cut-off events. [2025-03-15 00:59:46,283 INFO L125 PetriNetUnfolderBase]: For 81035/88154 co-relation queries the response was YES. [2025-03-15 00:59:46,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24042 conditions, 13586 events. 1129/13586 cut-off events. For 81035/88154 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 148765 event pairs, 896 based on Foata normal form. 57/11703 useless extension candidates. Maximal degree in co-relation 12613. Up to 1939 conditions per place. [2025-03-15 00:59:46,346 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 21 selfloop transitions, 6 changer transitions 12/652 dead transitions. [2025-03-15 00:59:46,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 652 transitions, 2265 flow [2025-03-15 00:59:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1999 transitions. [2025-03-15 00:59:46,349 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9451536643026005 [2025-03-15 00:59:46,350 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -9 predicate places. [2025-03-15 00:59:46,350 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 652 transitions, 2265 flow [2025-03-15 00:59:46,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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:59:46,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:46,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:46,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 00:59:46,352 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:46,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2043279010, now seen corresponding path program 1 times [2025-03-15 00:59:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827051185] [2025-03-15 00:59:46,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:46,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:46,405 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:59:46,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:46,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827051185] [2025-03-15 00:59:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827051185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322144742] [2025-03-15 00:59:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:46,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:46,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:46,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:46,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:46,409 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 657 out of 705 [2025-03-15 00:59:46,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 652 transitions, 2265 flow. Second operand has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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:59:46,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:46,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 705 [2025-03-15 00:59:46,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:49,880 INFO L124 PetriNetUnfolderBase]: 2010/21905 cut-off events. [2025-03-15 00:59:49,880 INFO L125 PetriNetUnfolderBase]: For 112559/119414 co-relation queries the response was YES. [2025-03-15 00:59:49,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40723 conditions, 21905 events. 2010/21905 cut-off events. For 112559/119414 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 267860 event pairs, 1522 based on Foata normal form. 0/18827 useless extension candidates. Maximal degree in co-relation 12845. Up to 3292 conditions per place. [2025-03-15 00:59:49,982 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 27 selfloop transitions, 5 changer transitions 16/658 dead transitions. [2025-03-15 00:59:49,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 658 transitions, 2607 flow [2025-03-15 00:59:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-03-15 00:59:49,985 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-03-15 00:59:49,985 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -11 predicate places. [2025-03-15 00:59:49,985 INFO L471 AbstractCegarLoop]: Abstraction has has 669 places, 658 transitions, 2607 flow [2025-03-15 00:59:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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:59:49,986 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:49,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:49,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 00:59:49,986 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:49,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:49,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1596473083, now seen corresponding path program 1 times [2025-03-15 00:59:49,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:49,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506618040] [2025-03-15 00:59:49,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:49,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:50,010 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:59:50,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:50,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506618040] [2025-03-15 00:59:50,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506618040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:50,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:50,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257276317] [2025-03-15 00:59:50,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:50,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:50,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:50,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:50,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:50,012 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 705 [2025-03-15 00:59:50,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 658 transitions, 2607 flow. Second operand has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:50,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:50,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 705 [2025-03-15 00:59:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:53,180 INFO L124 PetriNetUnfolderBase]: 2021/22856 cut-off events. [2025-03-15 00:59:53,180 INFO L125 PetriNetUnfolderBase]: For 129896/136799 co-relation queries the response was YES. [2025-03-15 00:59:53,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42874 conditions, 22856 events. 2021/22856 cut-off events. For 129896/136799 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 281266 event pairs, 1406 based on Foata normal form. 0/19847 useless extension candidates. Maximal degree in co-relation 12906. Up to 3368 conditions per place. [2025-03-15 00:59:53,324 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 43 selfloop transitions, 3 changer transitions 16/665 dead transitions. [2025-03-15 00:59:53,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 665 transitions, 3125 flow [2025-03-15 00:59:53,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1992 transitions. [2025-03-15 00:59:53,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9418439716312057 [2025-03-15 00:59:53,328 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -15 predicate places. [2025-03-15 00:59:53,328 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 665 transitions, 3125 flow [2025-03-15 00:59:53,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:53,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:53,328 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:59:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 00:59:53,328 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -113614416, now seen corresponding path program 1 times [2025-03-15 00:59:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416199291] [2025-03-15 00:59:53,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:53,357 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:59:53,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416199291] [2025-03-15 00:59:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416199291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:53,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:53,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352599372] [2025-03-15 00:59:53,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:53,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:53,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:53,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:53,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:53,360 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 654 out of 705 [2025-03-15 00:59:53,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 665 transitions, 3125 flow. Second operand has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:53,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:53,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 654 of 705 [2025-03-15 00:59:53,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:59:57,204 INFO L124 PetriNetUnfolderBase]: 2307/24621 cut-off events. [2025-03-15 00:59:57,204 INFO L125 PetriNetUnfolderBase]: For 179372/185880 co-relation queries the response was YES. [2025-03-15 00:59:57,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51802 conditions, 24621 events. 2307/24621 cut-off events. For 179372/185880 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 306060 event pairs, 1657 based on Foata normal form. 0/21812 useless extension candidates. Maximal degree in co-relation 13385. Up to 3765 conditions per place. [2025-03-15 00:59:57,373 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 71 selfloop transitions, 3 changer transitions 16/688 dead transitions. [2025-03-15 00:59:57,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 688 transitions, 4347 flow [2025-03-15 00:59:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:59:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:59:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1993 transitions. [2025-03-15 00:59:57,376 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9423167848699764 [2025-03-15 00:59:57,376 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -19 predicate places. [2025-03-15 00:59:57,376 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 688 transitions, 4347 flow [2025-03-15 00:59:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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:59:57,376 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:59:57,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:57,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 00:59:57,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 00:59:57,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:59:57,377 INFO L85 PathProgramCache]: Analyzing trace with hash -925704745, now seen corresponding path program 1 times [2025-03-15 00:59:57,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:59:57,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009930046] [2025-03-15 00:59:57,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:59:57,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:59:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:59:57,403 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:59:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:59:57,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009930046] [2025-03-15 00:59:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009930046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:59:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:59:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:59:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041816566] [2025-03-15 00:59:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:59:57,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:59:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:59:57,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:59:57,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:59:57,405 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 657 out of 705 [2025-03-15 00:59:57,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 688 transitions, 4347 flow. Second operand has 3 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 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:59:57,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:59:57,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 705 [2025-03-15 00:59:57,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:01,091 INFO L124 PetriNetUnfolderBase]: 2313/23753 cut-off events. [2025-03-15 01:00:01,091 INFO L125 PetriNetUnfolderBase]: For 298202/310437 co-relation queries the response was YES. [2025-03-15 01:00:01,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54361 conditions, 23753 events. 2313/23753 cut-off events. For 298202/310437 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 292575 event pairs, 1149 based on Foata normal form. 1/21313 useless extension candidates. Maximal degree in co-relation 14109. Up to 3759 conditions per place. [2025-03-15 01:00:01,274 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 82 selfloop transitions, 2 changer transitions 17/697 dead transitions. [2025-03-15 01:00:01,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 697 transitions, 5036 flow [2025-03-15 01:00:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-03-15 01:00:01,277 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-03-15 01:00:01,277 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -23 predicate places. [2025-03-15 01:00:01,277 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 697 transitions, 5036 flow [2025-03-15 01:00:01,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 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 01:00:01,278 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:01,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:00:01,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:01,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:01,279 INFO L85 PathProgramCache]: Analyzing trace with hash 336501026, now seen corresponding path program 1 times [2025-03-15 01:00:01,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:01,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249012206] [2025-03-15 01:00:01,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:01,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:01,663 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 01:00:01,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:01,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249012206] [2025-03-15 01:00:01,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249012206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:01,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:01,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:01,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792729556] [2025-03-15 01:00:01,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:01,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:01,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:01,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:01,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:01,666 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 705 [2025-03-15 01:00:01,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 697 transitions, 5036 flow. Second operand has 6 states, 6 states have (on average 623.0) internal successors, (3738), 6 states have internal predecessors, (3738), 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 01:00:01,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:01,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 705 [2025-03-15 01:00:01,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:06,120 INFO L124 PetriNetUnfolderBase]: 2807/25298 cut-off events. [2025-03-15 01:00:06,120 INFO L125 PetriNetUnfolderBase]: For 211817/216420 co-relation queries the response was YES. [2025-03-15 01:00:06,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59869 conditions, 25298 events. 2807/25298 cut-off events. For 211817/216420 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 311114 event pairs, 628 based on Foata normal form. 1/22825 useless extension candidates. Maximal degree in co-relation 14913. Up to 3779 conditions per place. [2025-03-15 01:00:06,335 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 240 selfloop transitions, 5 changer transitions 17/818 dead transitions. [2025-03-15 01:00:06,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 818 transitions, 7550 flow [2025-03-15 01:00:06,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3874 transitions. [2025-03-15 01:00:06,343 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.915839243498818 [2025-03-15 01:00:06,343 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -21 predicate places. [2025-03-15 01:00:06,343 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 818 transitions, 7550 flow [2025-03-15 01:00:06,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 623.0) internal successors, (3738), 6 states have internal predecessors, (3738), 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 01:00:06,344 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:06,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:06,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:00:06,344 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:06,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1733796674, now seen corresponding path program 1 times [2025-03-15 01:00:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754615956] [2025-03-15 01:00:06,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:06,934 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 01:00:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754615956] [2025-03-15 01:00:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754615956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:00:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448401757] [2025-03-15 01:00:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:06,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:00:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:06,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:00:06,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:00:06,937 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 705 [2025-03-15 01:00:06,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 818 transitions, 7550 flow. Second operand has 6 states, 6 states have (on average 623.1666666666666) internal successors, (3739), 6 states have internal predecessors, (3739), 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 01:00:06,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:06,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 705 [2025-03-15 01:00:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:12,059 INFO L124 PetriNetUnfolderBase]: 2982/27699 cut-off events. [2025-03-15 01:00:12,059 INFO L125 PetriNetUnfolderBase]: For 237476/242789 co-relation queries the response was YES. [2025-03-15 01:00:12,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68422 conditions, 27699 events. 2982/27699 cut-off events. For 237476/242789 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 348994 event pairs, 826 based on Foata normal form. 5/25236 useless extension candidates. Maximal degree in co-relation 17125. Up to 3740 conditions per place. [2025-03-15 01:00:12,249 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 291 selfloop transitions, 21 changer transitions 17/885 dead transitions. [2025-03-15 01:00:12,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 885 transitions, 8946 flow [2025-03-15 01:00:12,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:00:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:00:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3859 transitions. [2025-03-15 01:00:12,253 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9122931442080379 [2025-03-15 01:00:12,253 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -19 predicate places. [2025-03-15 01:00:12,253 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 885 transitions, 8946 flow [2025-03-15 01:00:12,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 623.1666666666666) internal successors, (3739), 6 states have internal predecessors, (3739), 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 01:00:12,254 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:12,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:12,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:00:12,255 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:12,256 INFO L85 PathProgramCache]: Analyzing trace with hash 978878680, now seen corresponding path program 1 times [2025-03-15 01:00:12,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:12,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143956807] [2025-03-15 01:00:12,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:12,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:12,295 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 01:00:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143956807] [2025-03-15 01:00:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143956807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:12,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:12,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:12,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945704145] [2025-03-15 01:00:12,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:12,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:12,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:12,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:12,297 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 705 [2025-03-15 01:00:12,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 885 transitions, 8946 flow. Second operand has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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 01:00:12,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:12,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 705 [2025-03-15 01:00:12,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:16,638 INFO L124 PetriNetUnfolderBase]: 2990/27685 cut-off events. [2025-03-15 01:00:16,639 INFO L125 PetriNetUnfolderBase]: For 250542/257051 co-relation queries the response was YES. [2025-03-15 01:00:16,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69618 conditions, 27685 events. 2990/27685 cut-off events. For 250542/257051 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 348865 event pairs, 818 based on Foata normal form. 97/25336 useless extension candidates. Maximal degree in co-relation 17292. Up to 3748 conditions per place. [2025-03-15 01:00:16,962 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 141 selfloop transitions, 2 changer transitions 17/892 dead transitions. [2025-03-15 01:00:16,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 892 transitions, 9610 flow [2025-03-15 01:00:16,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:16,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1988 transitions. [2025-03-15 01:00:16,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.939952718676123 [2025-03-15 01:00:16,965 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -18 predicate places. [2025-03-15 01:00:16,965 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 892 transitions, 9610 flow [2025-03-15 01:00:16,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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 01:00:16,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:16,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:16,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:00:16,966 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:16,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1657961656, now seen corresponding path program 1 times [2025-03-15 01:00:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619725493] [2025-03-15 01:00:16,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:16,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:17,007 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 01:00:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619725493] [2025-03-15 01:00:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619725493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:17,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230123557] [2025-03-15 01:00:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:17,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:17,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:17,009 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 705 [2025-03-15 01:00:17,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 892 transitions, 9610 flow. Second operand has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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 01:00:17,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:17,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 705 [2025-03-15 01:00:17,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:22,235 INFO L124 PetriNetUnfolderBase]: 2993/27646 cut-off events. [2025-03-15 01:00:22,235 INFO L125 PetriNetUnfolderBase]: For 236583/241334 co-relation queries the response was YES. [2025-03-15 01:00:22,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71028 conditions, 27646 events. 2993/27646 cut-off events. For 236583/241334 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 348639 event pairs, 814 based on Foata normal form. 9/25251 useless extension candidates. Maximal degree in co-relation 17699. Up to 3751 conditions per place. [2025-03-15 01:00:22,486 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 141 selfloop transitions, 2 changer transitions 19/893 dead transitions. [2025-03-15 01:00:22,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 893 transitions, 10000 flow [2025-03-15 01:00:22,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:22,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:22,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1988 transitions. [2025-03-15 01:00:22,488 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.939952718676123 [2025-03-15 01:00:22,489 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -17 predicate places. [2025-03-15 01:00:22,489 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 893 transitions, 10000 flow [2025-03-15 01:00:22,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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 01:00:22,489 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:22,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:22,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:00:22,489 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:22,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:22,490 INFO L85 PathProgramCache]: Analyzing trace with hash 535295004, now seen corresponding path program 1 times [2025-03-15 01:00:22,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138516883] [2025-03-15 01:00:22,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:22,691 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 01:00:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:22,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138516883] [2025-03-15 01:00:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138516883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:22,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:22,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:22,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498502520] [2025-03-15 01:00:22,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:22,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:22,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:22,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:22,693 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 705 [2025-03-15 01:00:22,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 893 transitions, 10000 flow. Second operand has 3 states, 3 states have (on average 673.6666666666666) internal successors, (2021), 3 states have internal predecessors, (2021), 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 01:00:22,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:22,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 705 [2025-03-15 01:00:22,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:28,677 INFO L124 PetriNetUnfolderBase]: 3806/33724 cut-off events. [2025-03-15 01:00:28,677 INFO L125 PetriNetUnfolderBase]: For 331327/338637 co-relation queries the response was YES. [2025-03-15 01:00:28,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88201 conditions, 33724 events. 3806/33724 cut-off events. For 331327/338637 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 436684 event pairs, 952 based on Foata normal form. 10/30874 useless extension candidates. Maximal degree in co-relation 23088. Up to 4843 conditions per place. [2025-03-15 01:00:28,944 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 186 selfloop transitions, 1 changer transitions 21/951 dead transitions. [2025-03-15 01:00:28,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 951 transitions, 13344 flow [2025-03-15 01:00:28,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:28,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2029 transitions. [2025-03-15 01:00:28,947 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9593380614657211 [2025-03-15 01:00:28,948 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -16 predicate places. [2025-03-15 01:00:28,948 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 951 transitions, 13344 flow [2025-03-15 01:00:28,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 673.6666666666666) internal successors, (2021), 3 states have internal predecessors, (2021), 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 01:00:28,948 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:28,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:28,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:00:28,948 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:28,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash -694023364, now seen corresponding path program 1 times [2025-03-15 01:00:28,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:28,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077292848] [2025-03-15 01:00:28,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:28,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:28,992 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 01:00:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:28,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077292848] [2025-03-15 01:00:28,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077292848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:28,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:28,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:28,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806867131] [2025-03-15 01:00:28,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:28,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:28,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:28,995 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 705 [2025-03-15 01:00:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 951 transitions, 13344 flow. Second operand has 3 states, 3 states have (on average 674.0) internal successors, (2022), 3 states have internal predecessors, (2022), 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 01:00:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 705 [2025-03-15 01:00:28,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:36,580 INFO L124 PetriNetUnfolderBase]: 4619/40760 cut-off events. [2025-03-15 01:00:36,580 INFO L125 PetriNetUnfolderBase]: For 383123/391723 co-relation queries the response was YES. [2025-03-15 01:00:36,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102786 conditions, 40760 events. 4619/40760 cut-off events. For 383123/391723 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 537897 event pairs, 1115 based on Foata normal form. 36/37581 useless extension candidates. Maximal degree in co-relation 27245. Up to 6119 conditions per place. [2025-03-15 01:00:37,036 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 206 selfloop transitions, 1 changer transitions 23/973 dead transitions. [2025-03-15 01:00:37,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 665 places, 973 transitions, 14940 flow [2025-03-15 01:00:37,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:37,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2028 transitions. [2025-03-15 01:00:37,039 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9588652482269504 [2025-03-15 01:00:37,039 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -15 predicate places. [2025-03-15 01:00:37,039 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 973 transitions, 14940 flow [2025-03-15 01:00:37,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 674.0) internal successors, (2022), 3 states have internal predecessors, (2022), 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 01:00:37,040 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:37,040 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:00:37,040 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:37,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:37,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1885261626, now seen corresponding path program 1 times [2025-03-15 01:00:37,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:37,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135936747] [2025-03-15 01:00:37,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:37,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:37,075 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 01:00:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:37,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135936747] [2025-03-15 01:00:37,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135936747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:37,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128966601] [2025-03-15 01:00:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:37,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:37,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:37,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:37,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 705 [2025-03-15 01:00:37,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 973 transitions, 14940 flow. Second operand has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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 01:00:37,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:37,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 705 [2025-03-15 01:00:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:44,958 INFO L124 PetriNetUnfolderBase]: 4635/40797 cut-off events. [2025-03-15 01:00:44,959 INFO L125 PetriNetUnfolderBase]: For 407783/420593 co-relation queries the response was YES. [2025-03-15 01:00:45,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104308 conditions, 40797 events. 4635/40797 cut-off events. For 407783/420593 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 537901 event pairs, 1131 based on Foata normal form. 35/37632 useless extension candidates. Maximal degree in co-relation 27481. Up to 6132 conditions per place. [2025-03-15 01:00:45,323 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 220 selfloop transitions, 2 changer transitions 23/976 dead transitions. [2025-03-15 01:00:45,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 976 transitions, 15616 flow [2025-03-15 01:00:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:45,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2025-03-15 01:00:45,325 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394799054373523 [2025-03-15 01:00:45,326 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -14 predicate places. [2025-03-15 01:00:45,326 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 976 transitions, 15616 flow [2025-03-15 01:00:45,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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 01:00:45,326 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:45,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:45,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:00:45,327 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:45,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:45,327 INFO L85 PathProgramCache]: Analyzing trace with hash 144335096, now seen corresponding path program 1 times [2025-03-15 01:00:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:45,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407322530] [2025-03-15 01:00:45,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:45,364 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 01:00:45,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407322530] [2025-03-15 01:00:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407322530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177727175] [2025-03-15 01:00:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:45,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:45,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:45,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:45,366 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 705 [2025-03-15 01:00:45,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 976 transitions, 15616 flow. Second operand has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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 01:00:45,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:45,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 705 [2025-03-15 01:00:45,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:00:52,870 INFO L124 PetriNetUnfolderBase]: 4638/40725 cut-off events. [2025-03-15 01:00:52,870 INFO L125 PetriNetUnfolderBase]: For 453850/466968 co-relation queries the response was YES. [2025-03-15 01:00:53,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105899 conditions, 40725 events. 4638/40725 cut-off events. For 453850/466968 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 536016 event pairs, 1144 based on Foata normal form. 35/37638 useless extension candidates. Maximal degree in co-relation 27923. Up to 6134 conditions per place. [2025-03-15 01:00:53,278 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 222 selfloop transitions, 2 changer transitions 23/977 dead transitions. [2025-03-15 01:00:53,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 977 transitions, 16190 flow [2025-03-15 01:00:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:00:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:00:53,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1987 transitions. [2025-03-15 01:00:53,280 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9394799054373523 [2025-03-15 01:00:53,281 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -13 predicate places. [2025-03-15 01:00:53,281 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 977 transitions, 16190 flow [2025-03-15 01:00:53,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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 01:00:53,281 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:00:53,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:00:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 01:00:53,282 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:00:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:00:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 608940959, now seen corresponding path program 1 times [2025-03-15 01:00:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:00:53,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935419503] [2025-03-15 01:00:53,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:00:53,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:00:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:00:53,324 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 01:00:53,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:00:53,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935419503] [2025-03-15 01:00:53,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935419503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:00:53,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:00:53,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:00:53,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22063095] [2025-03-15 01:00:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:00:53,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:00:53,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:00:53,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:00:53,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:00:53,327 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 705 [2025-03-15 01:00:53,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 977 transitions, 16190 flow. Second operand has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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 01:00:53,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:00:53,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 705 [2025-03-15 01:00:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:01,081 INFO L124 PetriNetUnfolderBase]: 4635/40661 cut-off events. [2025-03-15 01:01:01,082 INFO L125 PetriNetUnfolderBase]: For 519961/537731 co-relation queries the response was YES. [2025-03-15 01:01:01,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107514 conditions, 40661 events. 4635/40661 cut-off events. For 519961/537731 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 535179 event pairs, 1160 based on Foata normal form. 35/37642 useless extension candidates. Maximal degree in co-relation 28227. Up to 6138 conditions per place. [2025-03-15 01:01:01,691 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 245 selfloop transitions, 2 changer transitions 23/984 dead transitions. [2025-03-15 01:01:01,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 984 transitions, 17166 flow [2025-03-15 01:01:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1946 transitions. [2025-03-15 01:01:01,694 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9200945626477541 [2025-03-15 01:01:01,694 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -12 predicate places. [2025-03-15 01:01:01,694 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 984 transitions, 17166 flow [2025-03-15 01:01:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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 01:01:01,695 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:01,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 01:01:01,695 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:01:01,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1684965795, now seen corresponding path program 1 times [2025-03-15 01:01:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452607767] [2025-03-15 01:01:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:01,735 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 01:01:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452607767] [2025-03-15 01:01:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452607767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475088826] [2025-03-15 01:01:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:01,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:01,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:01,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:01,737 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 705 [2025-03-15 01:01:01,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 984 transitions, 17166 flow. Second operand has 3 states, 3 states have (on average 656.3333333333334) internal successors, (1969), 3 states have internal predecessors, (1969), 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 01:01:01,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:01,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 705 [2025-03-15 01:01:01,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:09,642 INFO L124 PetriNetUnfolderBase]: 4638/40495 cut-off events. [2025-03-15 01:01:09,642 INFO L125 PetriNetUnfolderBase]: For 578438/597134 co-relation queries the response was YES. [2025-03-15 01:01:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109865 conditions, 40495 events. 4638/40495 cut-off events. For 578438/597134 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 532572 event pairs, 1139 based on Foata normal form. 35/37642 useless extension candidates. Maximal degree in co-relation 28936. Up to 6142 conditions per place. [2025-03-15 01:01:10,001 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 239 selfloop transitions, 2 changer transitions 23/987 dead transitions. [2025-03-15 01:01:10,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 987 transitions, 17902 flow [2025-03-15 01:01:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:10,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1981 transitions. [2025-03-15 01:01:10,004 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9366430260047282 [2025-03-15 01:01:10,005 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -11 predicate places. [2025-03-15 01:01:10,005 INFO L471 AbstractCegarLoop]: Abstraction has has 669 places, 987 transitions, 17902 flow [2025-03-15 01:01:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.3333333333334) internal successors, (1969), 3 states have internal predecessors, (1969), 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 01:01:10,005 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:10,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:10,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 01:01:10,006 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:01:10,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1045041519, now seen corresponding path program 1 times [2025-03-15 01:01:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:10,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425181854] [2025-03-15 01:01:10,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:10,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:10,046 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 01:01:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:10,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425181854] [2025-03-15 01:01:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425181854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751573250] [2025-03-15 01:01:10,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:10,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:10,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:10,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:10,048 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 637 out of 705 [2025-03-15 01:01:10,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 669 places, 987 transitions, 17902 flow. Second operand has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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 01:01:10,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:10,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 637 of 705 [2025-03-15 01:01:10,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:17,748 INFO L124 PetriNetUnfolderBase]: 4637/40459 cut-off events. [2025-03-15 01:01:17,749 INFO L125 PetriNetUnfolderBase]: For 621998/641990 co-relation queries the response was YES. [2025-03-15 01:01:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111340 conditions, 40459 events. 4637/40459 cut-off events. For 621998/641990 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 532017 event pairs, 1144 based on Foata normal form. 35/37638 useless extension candidates. Maximal degree in co-relation 29220. Up to 6142 conditions per place. [2025-03-15 01:01:18,198 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 252 selfloop transitions, 2 changer transitions 23/990 dead transitions. [2025-03-15 01:01:18,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 990 transitions, 18670 flow [2025-03-15 01:01:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1945 transitions. [2025-03-15 01:01:18,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9196217494089834 [2025-03-15 01:01:18,200 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -10 predicate places. [2025-03-15 01:01:18,200 INFO L471 AbstractCegarLoop]: Abstraction has has 670 places, 990 transitions, 18670 flow [2025-03-15 01:01:18,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 641.0) internal successors, (1923), 3 states have internal predecessors, (1923), 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 01:01:18,201 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:18,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:18,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:01:18,201 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:01:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash -371323254, now seen corresponding path program 1 times [2025-03-15 01:01:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557231182] [2025-03-15 01:01:18,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:18,242 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 01:01:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557231182] [2025-03-15 01:01:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557231182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:18,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630526450] [2025-03-15 01:01:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:18,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:18,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:18,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:18,245 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 705 [2025-03-15 01:01:18,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 670 places, 990 transitions, 18670 flow. Second operand has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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 01:01:18,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:18,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 705 [2025-03-15 01:01:18,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:26,506 INFO L124 PetriNetUnfolderBase]: 4647/40435 cut-off events. [2025-03-15 01:01:26,507 INFO L125 PetriNetUnfolderBase]: For 691053/711093 co-relation queries the response was YES. [2025-03-15 01:01:26,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113259 conditions, 40435 events. 4647/40435 cut-off events. For 691053/711093 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 531499 event pairs, 1147 based on Foata normal form. 35/37654 useless extension candidates. Maximal degree in co-relation 29546. Up to 6150 conditions per place. [2025-03-15 01:01:26,935 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 249 selfloop transitions, 2 changer transitions 23/997 dead transitions. [2025-03-15 01:01:26,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 997 transitions, 19702 flow [2025-03-15 01:01:26,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1980 transitions. [2025-03-15 01:01:26,936 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2025-03-15 01:01:26,937 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -9 predicate places. [2025-03-15 01:01:26,937 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 997 transitions, 19702 flow [2025-03-15 01:01:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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 01:01:26,937 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:26,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:26,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 01:01:26,938 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:01:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash 64554285, now seen corresponding path program 1 times [2025-03-15 01:01:26,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:26,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306811967] [2025-03-15 01:01:26,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:26,986 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 01:01:26,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306811967] [2025-03-15 01:01:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306811967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:26,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74271366] [2025-03-15 01:01:26,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:26,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:26,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:26,989 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 705 [2025-03-15 01:01:26,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 997 transitions, 19702 flow. Second operand has 3 states, 3 states have (on average 656.3333333333334) internal successors, (1969), 3 states have internal predecessors, (1969), 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 01:01:26,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:26,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 705 [2025-03-15 01:01:26,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:35,313 INFO L124 PetriNetUnfolderBase]: 4669/40367 cut-off events. [2025-03-15 01:01:35,313 INFO L125 PetriNetUnfolderBase]: For 753799/774161 co-relation queries the response was YES. [2025-03-15 01:01:35,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115726 conditions, 40367 events. 4669/40367 cut-off events. For 753799/774161 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 530045 event pairs, 1136 based on Foata normal form. 35/37662 useless extension candidates. Maximal degree in co-relation 30109. Up to 6158 conditions per place. [2025-03-15 01:01:35,723 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 252 selfloop transitions, 2 changer transitions 23/998 dead transitions. [2025-03-15 01:01:35,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 672 places, 998 transitions, 20352 flow [2025-03-15 01:01:35,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1980 transitions. [2025-03-15 01:01:35,725 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2025-03-15 01:01:35,725 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -8 predicate places. [2025-03-15 01:01:35,725 INFO L471 AbstractCegarLoop]: Abstraction has has 672 places, 998 transitions, 20352 flow [2025-03-15 01:01:35,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.3333333333334) internal successors, (1969), 3 states have internal predecessors, (1969), 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 01:01:35,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:35,726 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:01:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 01:01:35,726 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err21ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-15 01:01:35,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:35,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2021710200, now seen corresponding path program 1 times [2025-03-15 01:01:35,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:35,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967067661] [2025-03-15 01:01:35,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:35,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:35,776 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 01:01:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:35,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967067661] [2025-03-15 01:01:35,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967067661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:35,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:35,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044056354] [2025-03-15 01:01:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:35,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:35,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:35,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:35,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:35,780 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 705 [2025-03-15 01:01:35,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 672 places, 998 transitions, 20352 flow. Second operand has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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 01:01:35,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:35,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 705 [2025-03-15 01:01:35,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:44,286 INFO L124 PetriNetUnfolderBase]: 4662/40287 cut-off events. [2025-03-15 01:01:44,287 INFO L125 PetriNetUnfolderBase]: For 823314/844364 co-relation queries the response was YES. [2025-03-15 01:01:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118122 conditions, 40287 events. 4662/40287 cut-off events. For 823314/844364 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 529455 event pairs, 1131 based on Foata normal form. 35/37662 useless extension candidates. Maximal degree in co-relation 30766. Up to 6158 conditions per place. [2025-03-15 01:01:44,760 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 0 selfloop transitions, 0 changer transitions 1001/1001 dead transitions. [2025-03-15 01:01:44,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 1001 transitions, 21152 flow [2025-03-15 01:01:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1980 transitions. [2025-03-15 01:01:44,761 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9361702127659575 [2025-03-15 01:01:44,762 INFO L298 CegarLoopForPetriNet]: 680 programPoint places, -7 predicate places. [2025-03-15 01:01:44,762 INFO L471 AbstractCegarLoop]: Abstraction has has 673 places, 1001 transitions, 21152 flow [2025-03-15 01:01:44,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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 01:01:44,772 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-1.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2025-03-15 01:01:44,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2025-03-15 01:01:44,846 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2025-03-15 01:01:44,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2025-03-15 01:01:44,848 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2025-03-15 01:01:44,849 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2025-03-15 01:01:44,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 01:01:44,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:44,854 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:01:44,854 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:01:44,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:01:44 BasicIcfg [2025-03-15 01:01:44,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:01:44,861 INFO L158 Benchmark]: Toolchain (without parser) took 129671.95ms. Allocated memory was 71.3MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 43.9MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-03-15 01:01:44,861 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:44,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.01ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 30.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:01:44,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.99ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 26.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:44,862 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 24.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:01:44,862 INFO L158 Benchmark]: RCFGBuilder took 795.66ms. Allocated memory is still 71.3MB. Free memory was 24.1MB in the beginning and 36.3MB in the end (delta: -12.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2025-03-15 01:01:44,862 INFO L158 Benchmark]: TraceAbstraction took 128544.68ms. Allocated memory was 71.3MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 35.1MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2025-03-15 01:01:44,863 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 246.01ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 30.4MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.99ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 26.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 71.3MB. Free memory was 26.9MB in the beginning and 24.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 795.66ms. Allocated memory is still 71.3MB. Free memory was 24.1MB in the beginning and 36.3MB in the end (delta: -12.2MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * TraceAbstraction took 128544.68ms. Allocated memory was 71.3MB in the beginning and 4.9GB in the end (delta: 4.9GB). Free memory was 35.1MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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 5 procedures, 1100 locations, 123 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: 128.4s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 125.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 619 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1397 IncrementalHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 619 mSDtfsCounter, 1397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21152occurred in iteration=33, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 4931 NumberOfCodeBlocks, 4931 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:01:44,880 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...