/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/popl20-bad-buffer-mult-alt3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:01:17,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:01:17,673 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 01:01:17,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:01:17,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:01:17,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:01:17,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:01:17,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:01:17,711 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:01:17,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:01:17,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:01:17,712 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:01:17,713 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:01:17,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:01:17,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:01:17,713 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 01:01:17,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:01:17,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:01:17,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:01:17,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:01:17,982 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:01:17,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-15 01:01:19,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b08b8b12/687f9fe64bdc43c987803ff53f118d2d/FLAG221575f02 [2025-03-15 01:01:19,353 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:01:19,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2025-03-15 01:01:19,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b08b8b12/687f9fe64bdc43c987803ff53f118d2d/FLAG221575f02 [2025-03-15 01:01:19,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b08b8b12/687f9fe64bdc43c987803ff53f118d2d [2025-03-15 01:01:19,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:01:19,735 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:01:19,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:01:19,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:01:19,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:01:19,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:19,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b8623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19, skipping insertion in model container [2025-03-15 01:01:19,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:19,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:01:19,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:01:19,905 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:01:19,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:01:19,961 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:01:19,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19 WrapperNode [2025-03-15 01:01:19,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:01:19,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:01:19,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:01:19,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:01:19,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:19,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,021 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 601 [2025-03-15 01:01:20,021 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:01:20,022 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:01:20,022 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:01:20,022 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:01:20,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:01:20,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:01:20,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:01:20,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:01:20,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (1/1) ... [2025-03-15 01:01:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:01:20,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:01:20,099 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 01:01:20,102 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 01:01:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:01:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:01:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:01:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:01:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:01:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:01:20,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:01:20,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:01:20,124 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:01:20,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:01:20,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:01:20,125 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 01:01:20,236 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:01:20,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:01:20,908 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:01:20,908 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:01:21,340 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:01:21,340 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:01:21,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:01:21 BoogieIcfgContainer [2025-03-15 01:01:21,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:01:21,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:01:21,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:01:21,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:01:21,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:01:19" (1/3) ... [2025-03-15 01:01:21,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1e5e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:01:21, skipping insertion in model container [2025-03-15 01:01:21,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:01:19" (2/3) ... [2025-03-15 01:01:21,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1e5e73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:01:21, skipping insertion in model container [2025-03-15 01:01:21,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:01:21" (3/3) ... [2025-03-15 01:01:21,349 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2025-03-15 01:01:21,361 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:01:21,362 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt3.wvr.c that has 5 procedures, 421 locations, 1 initial locations, 6 loop locations, and 95 error locations. [2025-03-15 01:01:21,363 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:01:21,485 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:01:21,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:01:21,529 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;@45593590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:01:21,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 169 error locations. [2025-03-15 01:01:21,554 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:01:21,555 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-15 01:01:21,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:01:21,559 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:21,559 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:21,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:21,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:21,563 INFO L85 PathProgramCache]: Analyzing trace with hash 588588670, now seen corresponding path program 1 times [2025-03-15 01:01:21,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:21,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295240189] [2025-03-15 01:01:21,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:21,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:21,711 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:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295240189] [2025-03-15 01:01:21,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295240189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:21,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:21,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777863743] [2025-03-15 01:01:21,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:21,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:21,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:21,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:21,745 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 437 [2025-03-15 01:01:21,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 437 transitions, 902 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:21,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:21,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 437 [2025-03-15 01:01:21,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:22,284 INFO L124 PetriNetUnfolderBase]: 748/1725 cut-off events. [2025-03-15 01:01:22,284 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-15 01:01:22,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2932 conditions, 1725 events. 748/1725 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8876 event pairs, 485 based on Foata normal form. 8/1564 useless extension candidates. Maximal degree in co-relation 2496. Up to 1013 conditions per place. [2025-03-15 01:01:22,340 INFO L140 encePairwiseOnDemand]: 356/437 looper letters, 31 selfloop transitions, 2 changer transitions 15/348 dead transitions. [2025-03-15 01:01:22,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 786 flow [2025-03-15 01:01:22,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:22,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1084 transitions. [2025-03-15 01:01:22,359 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8268497330282227 [2025-03-15 01:01:22,363 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -80 predicate places. [2025-03-15 01:01:22,363 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 348 transitions, 786 flow [2025-03-15 01:01:22,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:22,364 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:22,364 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:22,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:01:22,364 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:22,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash -337326970, now seen corresponding path program 1 times [2025-03-15 01:01:22,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458204847] [2025-03-15 01:01:22,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:22,419 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:22,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:22,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458204847] [2025-03-15 01:01:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458204847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537392853] [2025-03-15 01:01:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:22,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:22,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:22,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:22,422 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 437 [2025-03-15 01:01:22,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 348 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:22,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:22,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 437 [2025-03-15 01:01:22,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:22,792 INFO L124 PetriNetUnfolderBase]: 748/1724 cut-off events. [2025-03-15 01:01:22,792 INFO L125 PetriNetUnfolderBase]: For 424/634 co-relation queries the response was YES. [2025-03-15 01:01:22,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 1724 events. 748/1724 cut-off events. For 424/634 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8841 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 3456. Up to 1013 conditions per place. [2025-03-15 01:01:22,806 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 31 selfloop transitions, 2 changer transitions 15/347 dead transitions. [2025-03-15 01:01:22,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 347 transitions, 850 flow [2025-03-15 01:01:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1006 transitions. [2025-03-15 01:01:22,813 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7673531655225019 [2025-03-15 01:01:22,813 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -79 predicate places. [2025-03-15 01:01:22,813 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 347 transitions, 850 flow [2025-03-15 01:01:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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:22,816 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:22,817 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:01:22,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:01:22,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -180797403, now seen corresponding path program 1 times [2025-03-15 01:01:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398131578] [2025-03-15 01:01:22,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:22,874 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:22,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:22,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398131578] [2025-03-15 01:01:22,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398131578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:22,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:22,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:22,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304151494] [2025-03-15 01:01:22,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:22,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:22,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:22,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:22,879 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:22,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 347 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:22,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:22,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:22,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:23,210 INFO L124 PetriNetUnfolderBase]: 748/1723 cut-off events. [2025-03-15 01:01:23,211 INFO L125 PetriNetUnfolderBase]: For 784/1204 co-relation queries the response was YES. [2025-03-15 01:01:23,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 1723 events. 748/1723 cut-off events. For 784/1204 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8804 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 4416. Up to 1013 conditions per place. [2025-03-15 01:01:23,223 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/346 dead transitions. [2025-03-15 01:01:23,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 346 transitions, 908 flow [2025-03-15 01:01:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:23,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:23,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:23,226 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -78 predicate places. [2025-03-15 01:01:23,226 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 346 transitions, 908 flow [2025-03-15 01:01:23,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:23,227 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:23,227 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] [2025-03-15 01:01:23,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:01:23,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:23,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:23,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1289366515, now seen corresponding path program 1 times [2025-03-15 01:01:23,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751758337] [2025-03-15 01:01:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:23,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:23,293 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:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:23,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751758337] [2025-03-15 01:01:23,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751758337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:23,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:23,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:23,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926957562] [2025-03-15 01:01:23,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:23,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:23,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:23,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:23,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:23,295 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:23,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 346 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:23,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:23,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:23,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:23,625 INFO L124 PetriNetUnfolderBase]: 748/1722 cut-off events. [2025-03-15 01:01:23,626 INFO L125 PetriNetUnfolderBase]: For 1294/1924 co-relation queries the response was YES. [2025-03-15 01:01:23,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 1722 events. 748/1722 cut-off events. For 1294/1924 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8776 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 5376. Up to 1013 conditions per place. [2025-03-15 01:01:23,638 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/345 dead transitions. [2025-03-15 01:01:23,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 345 transitions, 966 flow [2025-03-15 01:01:23,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:23,641 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:23,642 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -77 predicate places. [2025-03-15 01:01:23,642 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 345 transitions, 966 flow [2025-03-15 01:01:23,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:23,643 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:23,643 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] [2025-03-15 01:01:23,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:01:23,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:23,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1109907325, now seen corresponding path program 1 times [2025-03-15 01:01:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:23,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521827889] [2025-03-15 01:01:23,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:23,692 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:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521827889] [2025-03-15 01:01:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521827889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:23,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974948958] [2025-03-15 01:01:23,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:23,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:23,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:23,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:23,696 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:23,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 345 transitions, 966 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:23,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:23,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:23,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:24,018 INFO L124 PetriNetUnfolderBase]: 748/1721 cut-off events. [2025-03-15 01:01:24,019 INFO L125 PetriNetUnfolderBase]: For 1954/2794 co-relation queries the response was YES. [2025-03-15 01:01:24,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6979 conditions, 1721 events. 748/1721 cut-off events. For 1954/2794 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8871 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 6336. Up to 1013 conditions per place. [2025-03-15 01:01:24,038 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/344 dead transitions. [2025-03-15 01:01:24,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 344 transitions, 1024 flow [2025-03-15 01:01:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:24,041 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:24,041 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -76 predicate places. [2025-03-15 01:01:24,041 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 344 transitions, 1024 flow [2025-03-15 01:01:24,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,042 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:24,042 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] [2025-03-15 01:01:24,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:01:24,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:24,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash -711581069, now seen corresponding path program 1 times [2025-03-15 01:01:24,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:24,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754069136] [2025-03-15 01:01:24,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:24,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:24,089 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:24,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:24,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754069136] [2025-03-15 01:01:24,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754069136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:24,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:24,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840511289] [2025-03-15 01:01:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:24,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:24,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:24,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:24,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:24,092 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:24,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 344 transitions, 1024 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:24,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:24,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:24,447 INFO L124 PetriNetUnfolderBase]: 748/1720 cut-off events. [2025-03-15 01:01:24,447 INFO L125 PetriNetUnfolderBase]: For 2764/3814 co-relation queries the response was YES. [2025-03-15 01:01:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7990 conditions, 1720 events. 748/1720 cut-off events. For 2764/3814 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8825 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 7296. Up to 1013 conditions per place. [2025-03-15 01:01:24,465 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/343 dead transitions. [2025-03-15 01:01:24,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 343 transitions, 1082 flow [2025-03-15 01:01:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:24,468 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:24,469 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -75 predicate places. [2025-03-15 01:01:24,469 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 343 transitions, 1082 flow [2025-03-15 01:01:24,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,469 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:24,469 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] [2025-03-15 01:01:24,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:01:24,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2109782741, now seen corresponding path program 1 times [2025-03-15 01:01:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105358271] [2025-03-15 01:01:24,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:01:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105358271] [2025-03-15 01:01:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105358271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:24,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680069585] [2025-03-15 01:01:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:24,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:24,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:24,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:24,532 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:24,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 343 transitions, 1082 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:24,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:24,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:24,770 INFO L124 PetriNetUnfolderBase]: 748/1719 cut-off events. [2025-03-15 01:01:24,770 INFO L125 PetriNetUnfolderBase]: For 3724/4984 co-relation queries the response was YES. [2025-03-15 01:01:24,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9001 conditions, 1719 events. 748/1719 cut-off events. For 3724/4984 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8847 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 8256. Up to 1013 conditions per place. [2025-03-15 01:01:24,785 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/342 dead transitions. [2025-03-15 01:01:24,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 342 transitions, 1140 flow [2025-03-15 01:01:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:24,787 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:24,789 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -74 predicate places. [2025-03-15 01:01:24,789 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 342 transitions, 1140 flow [2025-03-15 01:01:24,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,790 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:24,790 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] [2025-03-15 01:01:24,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:01:24,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:24,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1622078026, now seen corresponding path program 1 times [2025-03-15 01:01:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:24,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482793853] [2025-03-15 01:01:24,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:24,838 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:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482793853] [2025-03-15 01:01:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482793853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477541440] [2025-03-15 01:01:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:24,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:24,840 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:24,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 342 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:24,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:24,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:24,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:25,091 INFO L124 PetriNetUnfolderBase]: 748/1718 cut-off events. [2025-03-15 01:01:25,091 INFO L125 PetriNetUnfolderBase]: For 4834/6304 co-relation queries the response was YES. [2025-03-15 01:01:25,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10012 conditions, 1718 events. 748/1718 cut-off events. For 4834/6304 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8846 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 9216. Up to 1013 conditions per place. [2025-03-15 01:01:25,105 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/341 dead transitions. [2025-03-15 01:01:25,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 341 transitions, 1198 flow [2025-03-15 01:01:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:25,107 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:25,110 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -73 predicate places. [2025-03-15 01:01:25,110 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 341 transitions, 1198 flow [2025-03-15 01:01:25,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:25,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:25,111 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] [2025-03-15 01:01:25,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:01:25,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:25,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:25,112 INFO L85 PathProgramCache]: Analyzing trace with hash 932915522, now seen corresponding path program 1 times [2025-03-15 01:01:25,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:25,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388995839] [2025-03-15 01:01:25,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:25,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:25,162 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:25,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:25,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388995839] [2025-03-15 01:01:25,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388995839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:25,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030268531] [2025-03-15 01:01:25,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:25,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:25,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:25,164 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 327 out of 437 [2025-03-15 01:01:25,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 341 transitions, 1198 flow. Second operand has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:25,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:25,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 327 of 437 [2025-03-15 01:01:25,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:25,391 INFO L124 PetriNetUnfolderBase]: 748/1717 cut-off events. [2025-03-15 01:01:25,392 INFO L125 PetriNetUnfolderBase]: For 6094/7774 co-relation queries the response was YES. [2025-03-15 01:01:25,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11023 conditions, 1717 events. 748/1717 cut-off events. For 6094/7774 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8782 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 10176. Up to 1013 conditions per place. [2025-03-15 01:01:25,405 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 28 selfloop transitions, 2 changer transitions 15/340 dead transitions. [2025-03-15 01:01:25,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 340 transitions, 1256 flow [2025-03-15 01:01:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2025-03-15 01:01:25,407 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 01:01:25,408 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -72 predicate places. [2025-03-15 01:01:25,408 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 340 transitions, 1256 flow [2025-03-15 01:01:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.3333333333333) internal successors, (985), 3 states have internal predecessors, (985), 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:25,408 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:25,409 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] [2025-03-15 01:01:25,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:01:25,409 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash 991429533, now seen corresponding path program 1 times [2025-03-15 01:01:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616119339] [2025-03-15 01:01:25,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:25,433 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:25,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:25,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616119339] [2025-03-15 01:01:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616119339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145073584] [2025-03-15 01:01:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:25,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:25,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:25,434 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:25,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 340 transitions, 1256 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:25,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:25,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:25,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:25,677 INFO L124 PetriNetUnfolderBase]: 748/1716 cut-off events. [2025-03-15 01:01:25,677 INFO L125 PetriNetUnfolderBase]: For 7496/9386 co-relation queries the response was YES. [2025-03-15 01:01:25,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12029 conditions, 1716 events. 748/1716 cut-off events. For 7496/9386 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8823 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 11136. Up to 1013 conditions per place. [2025-03-15 01:01:25,691 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 25 selfloop transitions, 1 changer transitions 15/339 dead transitions. [2025-03-15 01:01:25,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 339 transitions, 1304 flow [2025-03-15 01:01:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:25,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:25,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2025-03-15 01:01:25,693 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7780320366132724 [2025-03-15 01:01:25,694 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -71 predicate places. [2025-03-15 01:01:25,694 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 339 transitions, 1304 flow [2025-03-15 01:01:25,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:25,694 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:25,694 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 01:01:25,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:01:25,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:25,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:25,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1248775352, now seen corresponding path program 1 times [2025-03-15 01:01:25,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:25,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754338577] [2025-03-15 01:01:25,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:25,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:26,192 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,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754338577] [2025-03-15 01:01:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754338577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:26,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:26,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:01:26,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494226367] [2025-03-15 01:01:26,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:26,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:01:26,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:26,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:01:26,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:01:26,196 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 437 [2025-03-15 01:01:26,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 339 transitions, 1304 flow. Second operand has 6 states, 6 states have (on average 300.8333333333333) internal successors, (1805), 6 states have internal predecessors, (1805), 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,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:26,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 437 [2025-03-15 01:01:26,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:26,595 INFO L124 PetriNetUnfolderBase]: 748/1714 cut-off events. [2025-03-15 01:01:26,595 INFO L125 PetriNetUnfolderBase]: For 9046/11146 co-relation queries the response was YES. [2025-03-15 01:01:26,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13067 conditions, 1714 events. 748/1714 cut-off events. For 9046/11146 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8871 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 12096. Up to 1030 conditions per place. [2025-03-15 01:01:26,616 INFO L140 encePairwiseOnDemand]: 425/437 looper letters, 48 selfloop transitions, 10 changer transitions 15/337 dead transitions. [2025-03-15 01:01:26,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 337 transitions, 1416 flow [2025-03-15 01:01:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:01:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:01:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1854 transitions. [2025-03-15 01:01:26,621 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7070938215102975 [2025-03-15 01:01:26,621 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -68 predicate places. [2025-03-15 01:01:26,621 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 337 transitions, 1416 flow [2025-03-15 01:01:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.8333333333333) internal successors, (1805), 6 states have internal predecessors, (1805), 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,622 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:26,622 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:01:26,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash -450784193, now seen corresponding path program 1 times [2025-03-15 01:01:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669351177] [2025-03-15 01:01:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:26,668 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,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669351177] [2025-03-15 01:01:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669351177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:26,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176489877] [2025-03-15 01:01:26,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:26,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:26,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:26,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:26,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:26,670 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-03-15 01:01:26,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 337 transitions, 1416 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:26,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-03-15 01:01:26,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:27,021 INFO L124 PetriNetUnfolderBase]: 748/1713 cut-off events. [2025-03-15 01:01:27,021 INFO L125 PetriNetUnfolderBase]: For 10754/13064 co-relation queries the response was YES. [2025-03-15 01:01:27,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14075 conditions, 1713 events. 748/1713 cut-off events. For 10754/13064 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8810 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 13056. Up to 1030 conditions per place. [2025-03-15 01:01:27,038 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 15/336 dead transitions. [2025-03-15 01:01:27,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 336 transitions, 1468 flow [2025-03-15 01:01:27,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:01:27,041 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7765064836003052 [2025-03-15 01:01:27,041 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -67 predicate places. [2025-03-15 01:01:27,041 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 336 transitions, 1468 flow [2025-03-15 01:01:27,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:27,042 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:27,042 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] [2025-03-15 01:01:27,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:01:27,042 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1722529932, now seen corresponding path program 1 times [2025-03-15 01:01:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577394475] [2025-03-15 01:01:27,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:27,078 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:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:27,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577394475] [2025-03-15 01:01:27,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577394475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:27,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350092810] [2025-03-15 01:01:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:27,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:27,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:27,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:27,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:27,080 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:27,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 336 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:27,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:27,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:27,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:27,357 INFO L124 PetriNetUnfolderBase]: 748/1712 cut-off events. [2025-03-15 01:01:27,357 INFO L125 PetriNetUnfolderBase]: For 12603/15123 co-relation queries the response was YES. [2025-03-15 01:01:27,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15081 conditions, 1712 events. 748/1712 cut-off events. For 12603/15123 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8817 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 14016. Up to 1030 conditions per place. [2025-03-15 01:01:27,377 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 25 selfloop transitions, 1 changer transitions 15/335 dead transitions. [2025-03-15 01:01:27,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 335 transitions, 1516 flow [2025-03-15 01:01:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2025-03-15 01:01:27,380 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7780320366132724 [2025-03-15 01:01:27,380 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -66 predicate places. [2025-03-15 01:01:27,380 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 335 transitions, 1516 flow [2025-03-15 01:01:27,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:27,381 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:27,381 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] [2025-03-15 01:01:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:01:27,381 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -189881058, now seen corresponding path program 1 times [2025-03-15 01:01:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:27,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142168731] [2025-03-15 01:01:27,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:27,422 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:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142168731] [2025-03-15 01:01:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142168731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:27,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:27,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:27,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697055039] [2025-03-15 01:01:27,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:27,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:27,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:27,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:27,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:27,424 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 437 [2025-03-15 01:01:27,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 335 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:27,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:27,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 437 [2025-03-15 01:01:27,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:27,709 INFO L124 PetriNetUnfolderBase]: 748/1711 cut-off events. [2025-03-15 01:01:27,709 INFO L125 PetriNetUnfolderBase]: For 14610/17340 co-relation queries the response was YES. [2025-03-15 01:01:27,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16089 conditions, 1711 events. 748/1711 cut-off events. For 14610/17340 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8821 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 14976. Up to 1030 conditions per place. [2025-03-15 01:01:27,732 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 25 selfloop transitions, 2 changer transitions 15/334 dead transitions. [2025-03-15 01:01:27,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 334 transitions, 1568 flow [2025-03-15 01:01:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:27,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1018 transitions. [2025-03-15 01:01:27,735 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7765064836003052 [2025-03-15 01:01:27,736 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -65 predicate places. [2025-03-15 01:01:27,737 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 334 transitions, 1568 flow [2025-03-15 01:01:27,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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:27,737 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:27,738 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:01:27,738 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 133589876, now seen corresponding path program 1 times [2025-03-15 01:01:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:27,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164740018] [2025-03-15 01:01:27,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:27,802 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:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164740018] [2025-03-15 01:01:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164740018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:27,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:27,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306373621] [2025-03-15 01:01:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:27,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:27,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:27,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:27,804 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 437 [2025-03-15 01:01:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 334 transitions, 1568 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:27,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:27,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 437 [2025-03-15 01:01:27,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:28,114 INFO L124 PetriNetUnfolderBase]: 748/1709 cut-off events. [2025-03-15 01:01:28,114 INFO L125 PetriNetUnfolderBase]: For 16758/19698 co-relation queries the response was YES. [2025-03-15 01:01:28,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17095 conditions, 1709 events. 748/1709 cut-off events. For 16758/19698 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8761 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 15936. Up to 1030 conditions per place. [2025-03-15 01:01:28,133 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 27 selfloop transitions, 1 changer transitions 15/332 dead transitions. [2025-03-15 01:01:28,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 332 transitions, 1616 flow [2025-03-15 01:01:28,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2025-03-15 01:01:28,135 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7734553775743707 [2025-03-15 01:01:28,135 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -65 predicate places. [2025-03-15 01:01:28,136 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 332 transitions, 1616 flow [2025-03-15 01:01:28,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:28,136 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:28,136 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] [2025-03-15 01:01:28,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:01:28,136 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:28,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -828392487, now seen corresponding path program 1 times [2025-03-15 01:01:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:28,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082655624] [2025-03-15 01:01:28,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:28,186 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:28,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:28,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082655624] [2025-03-15 01:01:28,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082655624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:28,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:28,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763067194] [2025-03-15 01:01:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:28,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:28,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:28,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:28,190 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:28,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 332 transitions, 1616 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:28,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:28,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:28,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:28,432 INFO L124 PetriNetUnfolderBase]: 748/1708 cut-off events. [2025-03-15 01:01:28,432 INFO L125 PetriNetUnfolderBase]: For 19054/22204 co-relation queries the response was YES. [2025-03-15 01:01:28,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18101 conditions, 1708 events. 748/1708 cut-off events. For 19054/22204 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8816 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 16896. Up to 1030 conditions per place. [2025-03-15 01:01:28,451 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 25 selfloop transitions, 1 changer transitions 15/331 dead transitions. [2025-03-15 01:01:28,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 331 transitions, 1664 flow [2025-03-15 01:01:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1020 transitions. [2025-03-15 01:01:28,454 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7780320366132724 [2025-03-15 01:01:28,455 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -64 predicate places. [2025-03-15 01:01:28,455 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 331 transitions, 1664 flow [2025-03-15 01:01:28,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:28,455 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:28,456 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] [2025-03-15 01:01:28,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:01:28,456 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:28,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:28,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1516165306, now seen corresponding path program 1 times [2025-03-15 01:01:28,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:28,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109295289] [2025-03-15 01:01:28,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:28,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:28,497 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:28,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:28,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109295289] [2025-03-15 01:01:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109295289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:28,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130391882] [2025-03-15 01:01:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:28,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:28,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:28,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:28,499 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 437 [2025-03-15 01:01:28,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 331 transitions, 1664 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:28,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:28,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 437 [2025-03-15 01:01:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:28,736 INFO L124 PetriNetUnfolderBase]: 748/1706 cut-off events. [2025-03-15 01:01:28,736 INFO L125 PetriNetUnfolderBase]: For 21500/24860 co-relation queries the response was YES. [2025-03-15 01:01:28,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19107 conditions, 1706 events. 748/1706 cut-off events. For 21500/24860 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8811 event pairs, 485 based on Foata normal form. 0/1556 useless extension candidates. Maximal degree in co-relation 17856. Up to 1030 conditions per place. [2025-03-15 01:01:28,754 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 27 selfloop transitions, 1 changer transitions 15/329 dead transitions. [2025-03-15 01:01:28,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 329 transitions, 1712 flow [2025-03-15 01:01:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:28,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2025-03-15 01:01:28,756 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7734553775743707 [2025-03-15 01:01:28,757 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -64 predicate places. [2025-03-15 01:01:28,757 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 329 transitions, 1712 flow [2025-03-15 01:01:28,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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:28,758 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:28,758 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] [2025-03-15 01:01:28,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:01:28,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:28,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:28,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1425910537, now seen corresponding path program 1 times [2025-03-15 01:01:28,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821938078] [2025-03-15 01:01:28,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:28,800 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:28,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:28,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821938078] [2025-03-15 01:01:28,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821938078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:28,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:28,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:28,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604238283] [2025-03-15 01:01:28,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:28,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:28,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:28,802 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:28,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 329 transitions, 1712 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:28,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:28,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:28,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:29,251 INFO L124 PetriNetUnfolderBase]: 1256/2843 cut-off events. [2025-03-15 01:01:29,251 INFO L125 PetriNetUnfolderBase]: For 47129/53895 co-relation queries the response was YES. [2025-03-15 01:01:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33817 conditions, 2843 events. 1256/2843 cut-off events. For 47129/53895 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17611 event pairs, 792 based on Foata normal form. 0/2562 useless extension candidates. Maximal degree in co-relation 18816. Up to 1720 conditions per place. [2025-03-15 01:01:29,287 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 45 selfloop transitions, 2 changer transitions 15/349 dead transitions. [2025-03-15 01:01:29,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 349 transitions, 2582 flow [2025-03-15 01:01:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-03-15 01:01:29,289 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7940503432494279 [2025-03-15 01:01:29,289 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -63 predicate places. [2025-03-15 01:01:29,289 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 349 transitions, 2582 flow [2025-03-15 01:01:29,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:29,290 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:29,290 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] [2025-03-15 01:01:29,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:01:29,290 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:29,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:29,291 INFO L85 PathProgramCache]: Analyzing trace with hash -202040452, now seen corresponding path program 1 times [2025-03-15 01:01:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76280977] [2025-03-15 01:01:29,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:29,330 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:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:29,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76280977] [2025-03-15 01:01:29,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76280977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:29,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:29,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826046502] [2025-03-15 01:01:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:29,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:29,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:29,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:29,331 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:29,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 349 transitions, 2582 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:29,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:29,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:29,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:30,097 INFO L124 PetriNetUnfolderBase]: 2192/4795 cut-off events. [2025-03-15 01:01:30,097 INFO L125 PetriNetUnfolderBase]: For 93148/107188 co-relation queries the response was YES. [2025-03-15 01:01:30,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61973 conditions, 4795 events. 2192/4795 cut-off events. For 93148/107188 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 34442 event pairs, 1359 based on Foata normal form. 0/4312 useless extension candidates. Maximal degree in co-relation 19776. Up to 2994 conditions per place. [2025-03-15 01:01:30,171 INFO L140 encePairwiseOnDemand]: 434/437 looper letters, 85 selfloop transitions, 3 changer transitions 15/389 dead transitions. [2025-03-15 01:01:30,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 389 transitions, 4360 flow [2025-03-15 01:01:30,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-03-15 01:01:30,174 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7940503432494279 [2025-03-15 01:01:30,175 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -62 predicate places. [2025-03-15 01:01:30,175 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 389 transitions, 4360 flow [2025-03-15 01:01:30,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:30,175 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:30,175 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] [2025-03-15 01:01:30,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:01:30,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:30,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash -205396117, now seen corresponding path program 1 times [2025-03-15 01:01:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023122559] [2025-03-15 01:01:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:30,209 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:30,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023122559] [2025-03-15 01:01:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023122559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:30,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:30,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412226906] [2025-03-15 01:01:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:30,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:30,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:30,211 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:30,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 389 transitions, 4360 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:30,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:30,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:30,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:31,378 INFO L124 PetriNetUnfolderBase]: 3088/6960 cut-off events. [2025-03-15 01:01:31,378 INFO L125 PetriNetUnfolderBase]: For 177524/196448 co-relation queries the response was YES. [2025-03-15 01:01:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91675 conditions, 6960 events. 3088/6960 cut-off events. For 177524/196448 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 55662 event pairs, 1033 based on Foata normal form. 0/6241 useless extension candidates. Maximal degree in co-relation 24890. Up to 4210 conditions per place. [2025-03-15 01:01:31,475 INFO L140 encePairwiseOnDemand]: 432/437 looper letters, 147 selfloop transitions, 13 changer transitions 15/460 dead transitions. [2025-03-15 01:01:31,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 460 transitions, 7640 flow [2025-03-15 01:01:31,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-03-15 01:01:31,477 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7940503432494279 [2025-03-15 01:01:31,478 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -61 predicate places. [2025-03-15 01:01:31,478 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 460 transitions, 7640 flow [2025-03-15 01:01:31,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:31,478 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:31,478 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] [2025-03-15 01:01:31,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:01:31,478 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:31,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:31,479 INFO L85 PathProgramCache]: Analyzing trace with hash -887283365, now seen corresponding path program 1 times [2025-03-15 01:01:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:31,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733951799] [2025-03-15 01:01:31,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:31,509 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:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733951799] [2025-03-15 01:01:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733951799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011502526] [2025-03-15 01:01:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:31,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:31,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:31,512 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 437 [2025-03-15 01:01:31,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 460 transitions, 7640 flow. Second operand has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:31,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:31,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 437 [2025-03-15 01:01:31,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:33,482 INFO L124 PetriNetUnfolderBase]: 4031/9329 cut-off events. [2025-03-15 01:01:33,482 INFO L125 PetriNetUnfolderBase]: For 260856/283856 co-relation queries the response was YES. [2025-03-15 01:01:33,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125538 conditions, 9329 events. 4031/9329 cut-off events. For 260856/283856 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 80309 event pairs, 667 based on Foata normal form. 4/8359 useless extension candidates. Maximal degree in co-relation 33764. Up to 5501 conditions per place. [2025-03-15 01:01:33,628 INFO L140 encePairwiseOnDemand]: 432/437 looper letters, 263 selfloop transitions, 25 changer transitions 15/587 dead transitions. [2025-03-15 01:01:33,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 587 transitions, 13732 flow [2025-03-15 01:01:33,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2025-03-15 01:01:33,630 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7940503432494279 [2025-03-15 01:01:33,630 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -60 predicate places. [2025-03-15 01:01:33,630 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 587 transitions, 13732 flow [2025-03-15 01:01:33,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.3333333333333) internal successors, (997), 3 states have internal predecessors, (997), 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:33,630 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:01:33,631 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:33,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:01:33,631 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2025-03-15 01:01:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:01:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1611147188, now seen corresponding path program 1 times [2025-03-15 01:01:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:01:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212064771] [2025-03-15 01:01:33,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:01:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:01:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:01:33,677 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:33,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:01:33,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212064771] [2025-03-15 01:01:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212064771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:01:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:01:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:01:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815698427] [2025-03-15 01:01:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:01:33,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:01:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:01:33,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:01:33,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:01:33,679 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 437 [2025-03-15 01:01:33,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 587 transitions, 13732 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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:33,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:01:33,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 437 [2025-03-15 01:01:33,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:01:35,888 INFO L124 PetriNetUnfolderBase]: 4031/9473 cut-off events. [2025-03-15 01:01:35,889 INFO L125 PetriNetUnfolderBase]: For 303396/330086 co-relation queries the response was YES. [2025-03-15 01:01:35,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131189 conditions, 9473 events. 4031/9473 cut-off events. For 303396/330086 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 82484 event pairs, 826 based on Foata normal form. 5/8457 useless extension candidates. Maximal degree in co-relation 43079. Up to 5501 conditions per place. [2025-03-15 01:01:35,941 INFO L140 encePairwiseOnDemand]: 435/437 looper letters, 0 selfloop transitions, 0 changer transitions 586/586 dead transitions. [2025-03-15 01:01:35,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 586 transitions, 14302 flow [2025-03-15 01:01:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:01:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:01:35,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1027 transitions. [2025-03-15 01:01:35,943 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7833714721586575 [2025-03-15 01:01:35,944 INFO L298 CegarLoopForPetriNet]: 433 programPoint places, -59 predicate places. [2025-03-15 01:01:35,944 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 586 transitions, 14302 flow [2025-03-15 01:01:35,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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,959 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-bad-buffer-mult-alt3.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:01:36,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (168 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (167 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (165 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (163 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (162 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (160 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (159 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 169 remaining) [2025-03-15 01:01:36,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (157 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (156 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (155 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (152 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (151 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (150 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (149 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (147 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (146 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (145 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (144 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (142 of 169 remaining) [2025-03-15 01:01:36,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (141 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (140 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (139 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (138 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (135 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (134 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (133 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (132 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (131 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (130 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (129 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (126 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (125 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (124 of 169 remaining) [2025-03-15 01:01:36,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (123 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (122 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (121 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (120 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (119 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (112 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (111 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (108 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (107 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 169 remaining) [2025-03-15 01:01:36,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (105 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (104 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (98 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (97 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 169 remaining) [2025-03-15 01:01:36,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 169 remaining) [2025-03-15 01:01:36,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 169 remaining) [2025-03-15 01:01:36,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 169 remaining) [2025-03-15 01:01:36,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 169 remaining) [2025-03-15 01:01:36,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 169 remaining) [2025-03-15 01:01:36,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 169 remaining) [2025-03-15 01:01:36,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:01:36,018 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] [2025-03-15 01:01:36,023 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:01:36,023 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:01:36,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:01:36 BasicIcfg [2025-03-15 01:01:36,029 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:01:36,030 INFO L158 Benchmark]: Toolchain (without parser) took 16296.15ms. Allocated memory was 71.3MB in the beginning and 2.4GB in the end (delta: 2.4GB). Free memory was 44.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 01:01:36,030 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:36,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.40ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 29.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:01:36,030 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.00ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 26.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:01:36,031 INFO L158 Benchmark]: Boogie Preprocessor took 43.75ms. Allocated memory is still 71.3MB. Free memory was 26.3MB in the beginning and 23.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:01:36,031 INFO L158 Benchmark]: RCFGBuilder took 1274.56ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.4MB in the beginning and 45.0MB in the end (delta: -21.7MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. [2025-03-15 01:01:36,031 INFO L158 Benchmark]: TraceAbstraction took 14685.32ms. Allocated memory was 88.1MB in the beginning and 2.4GB in the end (delta: 2.4GB). Free memory was 43.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-15 01:01:36,032 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.22ms. Allocated memory is still 71.3MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 42.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.40ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 29.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.00ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 26.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.75ms. Allocated memory is still 71.3MB. Free memory was 26.3MB in the beginning and 23.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1274.56ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.4MB in the beginning and 45.0MB in the end (delta: -21.7MB). Peak memory consumption was 34.5MB. Max. memory is 8.0GB. * TraceAbstraction took 14685.32ms. Allocated memory was 88.1MB in the beginning and 2.4GB in the end (delta: 2.4GB). Free memory was 43.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 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: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: 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: 69]: 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: 73]: 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: 73]: 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: 73]: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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: 89]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 141]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: 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 9 procedures, 529 locations, 169 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: 14.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 135 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1131 IncrementalHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 135 mSDtfsCounter, 1131 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14302occurred in iteration=22, InterpolantAutomatonStates: 69, 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, 1.1s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:01:36,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...