/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-queue-add-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:04:40,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:04:40,187 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:04:40,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:04:40,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:04:40,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:04:40,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:04:40,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:04:40,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:04:40,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:40,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:04:40,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:04:40,217 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:04:40,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:04:40,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:04:40,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:04:40,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:04:40,471 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:04:40,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-03-15 01:04:41,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ac768b6/58f454ba40584b2a869cd765e699f3b3/FLAG8c27af014 [2025-03-15 01:04:41,797 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:04:41,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-3.wvr.c [2025-03-15 01:04:41,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ac768b6/58f454ba40584b2a869cd765e699f3b3/FLAG8c27af014 [2025-03-15 01:04:42,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ac768b6/58f454ba40584b2a869cd765e699f3b3 [2025-03-15 01:04:42,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:04:42,196 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:04:42,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:42,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:04:42,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:04:42,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7a3797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42, skipping insertion in model container [2025-03-15 01:04:42,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:04:42,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:42,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:04:42,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:42,378 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:04:42,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42 WrapperNode [2025-03-15 01:04:42,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:42,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:42,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:04:42,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:04:42,384 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:04:42" (1/1) ... [2025-03-15 01:04:42,389 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:04:42" (1/1) ... [2025-03-15 01:04:42,409 INFO L138 Inliner]: procedures = 24, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 447 [2025-03-15 01:04:42,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:42,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:04:42,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:04:42,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:04:42,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,453 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:04:42,456 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:04:42,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:04:42,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:04:42,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (1/1) ... [2025-03-15 01:04:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:04:42,486 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:04:42,491 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:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:04:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:04:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:04:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:04:42,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:04:42,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:04:42,511 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:04:42,615 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:04:42,616 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:04:43,196 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:04:43,196 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:04:43,547 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:04:43,547 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-15 01:04:43,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:43 BoogieIcfgContainer [2025-03-15 01:04:43,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:04:43,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:04:43,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:04:43,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:04:43,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:04:42" (1/3) ... [2025-03-15 01:04:43,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade4b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:43, skipping insertion in model container [2025-03-15 01:04:43,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:42" (2/3) ... [2025-03-15 01:04:43,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ade4b33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:43, skipping insertion in model container [2025-03-15 01:04:43,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:43" (3/3) ... [2025-03-15 01:04:43,555 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-3.wvr.c [2025-03-15 01:04:43,568 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:04:43,570 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-3.wvr.c that has 4 procedures, 336 locations, 1 initial locations, 5 loop locations, and 67 error locations. [2025-03-15 01:04:43,570 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:04:43,655 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:04:43,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:04:43,717 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;@518fe1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:04:43,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 119 error locations. [2025-03-15 01:04:43,741 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:04:43,742 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 01:04:43,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:04:43,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:43,745 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:43,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:43,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 997521166, now seen corresponding path program 1 times [2025-03-15 01:04:43,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:43,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116898240] [2025-03-15 01:04:43,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:43,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:43,929 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:04:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:43,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116898240] [2025-03-15 01:04:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116898240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:43,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:43,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757728897] [2025-03-15 01:04:43,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:43,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:43,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:43,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:43,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:43,960 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 349 [2025-03-15 01:04:43,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 349 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 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:04:43,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:43,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 349 [2025-03-15 01:04:43,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:44,225 INFO L124 PetriNetUnfolderBase]: 110/724 cut-off events. [2025-03-15 01:04:44,225 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-15 01:04:44,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 724 events. 110/724 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3247 event pairs, 77 based on Foata normal form. 7/616 useless extension candidates. Maximal degree in co-relation 676. Up to 184 conditions per place. [2025-03-15 01:04:44,239 INFO L140 encePairwiseOnDemand]: 292/349 looper letters, 22 selfloop transitions, 2 changer transitions 14/285 dead transitions. [2025-03-15 01:04:44,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 285 transitions, 638 flow [2025-03-15 01:04:44,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2025-03-15 01:04:44,257 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8443170964660937 [2025-03-15 01:04:44,259 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -53 predicate places. [2025-03-15 01:04:44,260 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 285 transitions, 638 flow [2025-03-15 01:04:44,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.3333333333333) internal successors, (808), 3 states have internal predecessors, (808), 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:04:44,261 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:44,261 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] [2025-03-15 01:04:44,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:04:44,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:44,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 829183485, now seen corresponding path program 1 times [2025-03-15 01:04:44,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:44,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057056754] [2025-03-15 01:04:44,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:44,325 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:04:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:44,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057056754] [2025-03-15 01:04:44,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057056754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:44,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:44,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230689333] [2025-03-15 01:04:44,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:44,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:44,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:44,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:44,331 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-03-15 01:04:44,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 285 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:44,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-03-15 01:04:44,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:44,487 INFO L124 PetriNetUnfolderBase]: 110/723 cut-off events. [2025-03-15 01:04:44,488 INFO L125 PetriNetUnfolderBase]: For 138/152 co-relation queries the response was YES. [2025-03-15 01:04:44,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 723 events. 110/723 cut-off events. For 138/152 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3236 event pairs, 77 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 798. Up to 184 conditions per place. [2025-03-15 01:04:44,492 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 14/284 dead transitions. [2025-03-15 01:04:44,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 284 transitions, 674 flow [2025-03-15 01:04:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:44,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-15 01:04:44,494 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8042024832855779 [2025-03-15 01:04:44,494 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -52 predicate places. [2025-03-15 01:04:44,494 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 284 transitions, 674 flow [2025-03-15 01:04:44,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,495 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:44,495 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] [2025-03-15 01:04:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:04:44,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:44,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 607947087, now seen corresponding path program 1 times [2025-03-15 01:04:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026550381] [2025-03-15 01:04:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:44,550 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:04:44,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:44,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026550381] [2025-03-15 01:04:44,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026550381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:44,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:44,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:44,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457190042] [2025-03-15 01:04:44,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:44,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:44,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:44,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:44,553 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-03-15 01:04:44,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 284 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:44,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-03-15 01:04:44,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:44,717 INFO L124 PetriNetUnfolderBase]: 110/722 cut-off events. [2025-03-15 01:04:44,717 INFO L125 PetriNetUnfolderBase]: For 286/308 co-relation queries the response was YES. [2025-03-15 01:04:44,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 722 events. 110/722 cut-off events. For 286/308 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3263 event pairs, 77 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 920. Up to 184 conditions per place. [2025-03-15 01:04:44,725 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 14/283 dead transitions. [2025-03-15 01:04:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 710 flow [2025-03-15 01:04:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-15 01:04:44,728 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8042024832855779 [2025-03-15 01:04:44,729 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -51 predicate places. [2025-03-15 01:04:44,729 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 283 transitions, 710 flow [2025-03-15 01:04:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,730 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:44,730 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] [2025-03-15 01:04:44,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:04:44,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:44,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2059078676, now seen corresponding path program 1 times [2025-03-15 01:04:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756255184] [2025-03-15 01:04:44,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:44,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:44,791 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:04:44,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756255184] [2025-03-15 01:04:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756255184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:44,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:44,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257627630] [2025-03-15 01:04:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:44,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:44,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:44,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:44,796 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-03-15 01:04:44,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 283 transitions, 710 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:44,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-03-15 01:04:44,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:44,949 INFO L124 PetriNetUnfolderBase]: 110/721 cut-off events. [2025-03-15 01:04:44,949 INFO L125 PetriNetUnfolderBase]: For 494/524 co-relation queries the response was YES. [2025-03-15 01:04:44,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 721 events. 110/721 cut-off events. For 494/524 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3249 event pairs, 77 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 1042. Up to 184 conditions per place. [2025-03-15 01:04:44,955 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 17 selfloop transitions, 2 changer transitions 14/282 dead transitions. [2025-03-15 01:04:44,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 282 transitions, 746 flow [2025-03-15 01:04:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-15 01:04:44,959 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8042024832855779 [2025-03-15 01:04:44,960 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -50 predicate places. [2025-03-15 01:04:44,960 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 282 transitions, 746 flow [2025-03-15 01:04:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:44,961 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:44,961 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:04:44,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:04:44,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1288542166, now seen corresponding path program 1 times [2025-03-15 01:04:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483645865] [2025-03-15 01:04:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,009 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:04:45,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483645865] [2025-03-15 01:04:45,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483645865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468092762] [2025-03-15 01:04:45,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,011 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-03-15 01:04:45,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 282 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:45,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-03-15 01:04:45,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:45,131 INFO L124 PetriNetUnfolderBase]: 110/716 cut-off events. [2025-03-15 01:04:45,131 INFO L125 PetriNetUnfolderBase]: For 768/806 co-relation queries the response was YES. [2025-03-15 01:04:45,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 716 events. 110/716 cut-off events. For 768/806 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3194 event pairs, 34 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 1165. Up to 185 conditions per place. [2025-03-15 01:04:45,137 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 19 selfloop transitions, 2 changer transitions 14/287 dead transitions. [2025-03-15 01:04:45,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 287 transitions, 850 flow [2025-03-15 01:04:45,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-03-15 01:04:45,140 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8175740210124164 [2025-03-15 01:04:45,140 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -49 predicate places. [2025-03-15 01:04:45,140 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 287 transitions, 850 flow [2025-03-15 01:04:45,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:45,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:45,141 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] [2025-03-15 01:04:45,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:04:45,141 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2004227503, now seen corresponding path program 1 times [2025-03-15 01:04:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:45,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455359093] [2025-03-15 01:04:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,182 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:04:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455359093] [2025-03-15 01:04:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455359093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836411401] [2025-03-15 01:04:45,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,184 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-03-15 01:04:45,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 287 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:45,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-03-15 01:04:45,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:45,313 INFO L124 PetriNetUnfolderBase]: 110/715 cut-off events. [2025-03-15 01:04:45,313 INFO L125 PetriNetUnfolderBase]: For 1100/1146 co-relation queries the response was YES. [2025-03-15 01:04:45,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1682 conditions, 715 events. 110/715 cut-off events. For 1100/1146 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3170 event pairs, 34 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 1288. Up to 185 conditions per place. [2025-03-15 01:04:45,319 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 20 selfloop transitions, 2 changer transitions 14/286 dead transitions. [2025-03-15 01:04:45,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 286 transitions, 892 flow [2025-03-15 01:04:45,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-03-15 01:04:45,321 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-03-15 01:04:45,323 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -48 predicate places. [2025-03-15 01:04:45,323 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 286 transitions, 892 flow [2025-03-15 01:04:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:45,324 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:45,324 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] [2025-03-15 01:04:45,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:04:45,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:45,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1431931874, now seen corresponding path program 1 times [2025-03-15 01:04:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695211064] [2025-03-15 01:04:45,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,370 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:04:45,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695211064] [2025-03-15 01:04:45,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695211064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622953103] [2025-03-15 01:04:45,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,372 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 349 [2025-03-15 01:04:45,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 286 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:45,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 349 [2025-03-15 01:04:45,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:45,498 INFO L124 PetriNetUnfolderBase]: 115/727 cut-off events. [2025-03-15 01:04:45,498 INFO L125 PetriNetUnfolderBase]: For 1849/1969 co-relation queries the response was YES. [2025-03-15 01:04:45,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 727 events. 115/727 cut-off events. For 1849/1969 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3425 event pairs, 51 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1424. Up to 185 conditions per place. [2025-03-15 01:04:45,505 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 23 selfloop transitions, 2 changer transitions 14/285 dead transitions. [2025-03-15 01:04:45,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 285 transitions, 940 flow [2025-03-15 01:04:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:45,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 842 transitions. [2025-03-15 01:04:45,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8042024832855779 [2025-03-15 01:04:45,510 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -47 predicate places. [2025-03-15 01:04:45,510 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 285 transitions, 940 flow [2025-03-15 01:04:45,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 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:04:45,510 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:45,510 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] [2025-03-15 01:04:45,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:04:45,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:45,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:45,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1311370654, now seen corresponding path program 1 times [2025-03-15 01:04:45,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:45,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146114070] [2025-03-15 01:04:45,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:45,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,548 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:04:45,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146114070] [2025-03-15 01:04:45,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146114070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184199483] [2025-03-15 01:04:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,551 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-03-15 01:04:45,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 285 transitions, 940 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:45,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-03-15 01:04:45,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:45,678 INFO L124 PetriNetUnfolderBase]: 131/860 cut-off events. [2025-03-15 01:04:45,678 INFO L125 PetriNetUnfolderBase]: For 2433/2619 co-relation queries the response was YES. [2025-03-15 01:04:45,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 860 events. 131/860 cut-off events. For 2433/2619 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4462 event pairs, 31 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1848. Up to 207 conditions per place. [2025-03-15 01:04:45,684 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 30 selfloop transitions, 3 changer transitions 14/296 dead transitions. [2025-03-15 01:04:45,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 296 transitions, 1203 flow [2025-03-15 01:04:45,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-03-15 01:04:45,686 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8185291308500477 [2025-03-15 01:04:45,688 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -46 predicate places. [2025-03-15 01:04:45,688 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 296 transitions, 1203 flow [2025-03-15 01:04:45,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:45,689 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:45,689 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:45,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:04:45,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:45,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:45,689 INFO L85 PathProgramCache]: Analyzing trace with hash 680241520, now seen corresponding path program 1 times [2025-03-15 01:04:45,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095825431] [2025-03-15 01:04:45,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:45,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:45,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095825431] [2025-03-15 01:04:45,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095825431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929177504] [2025-03-15 01:04:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-03-15 01:04:45,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 296 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:45,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-03-15 01:04:45,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:45,852 INFO L124 PetriNetUnfolderBase]: 131/859 cut-off events. [2025-03-15 01:04:45,853 INFO L125 PetriNetUnfolderBase]: For 3093/3309 co-relation queries the response was YES. [2025-03-15 01:04:45,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 859 events. 131/859 cut-off events. For 3093/3309 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4459 event pairs, 31 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1992. Up to 207 conditions per place. [2025-03-15 01:04:45,859 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 32 selfloop transitions, 2 changer transitions 14/295 dead transitions. [2025-03-15 01:04:45,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 295 transitions, 1269 flow [2025-03-15 01:04:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-03-15 01:04:45,862 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-03-15 01:04:45,863 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -45 predicate places. [2025-03-15 01:04:45,863 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 295 transitions, 1269 flow [2025-03-15 01:04:45,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:45,864 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:45,864 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] [2025-03-15 01:04:45,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:04:45,864 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:45,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1420733843, now seen corresponding path program 1 times [2025-03-15 01:04:45,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:45,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169458630] [2025-03-15 01:04:45,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:45,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:45,917 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:04:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169458630] [2025-03-15 01:04:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169458630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:45,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:45,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109804434] [2025-03-15 01:04:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:45,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:45,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:45,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:45,919 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-03-15 01:04:45,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 295 transitions, 1269 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:45,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:45,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-03-15 01:04:45,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:46,023 INFO L124 PetriNetUnfolderBase]: 131/871 cut-off events. [2025-03-15 01:04:46,024 INFO L125 PetriNetUnfolderBase]: For 3954/4216 co-relation queries the response was YES. [2025-03-15 01:04:46,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 871 events. 131/871 cut-off events. For 3954/4216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4475 event pairs, 31 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 2136. Up to 207 conditions per place. [2025-03-15 01:04:46,030 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 32 selfloop transitions, 1 changer transitions 14/294 dead transitions. [2025-03-15 01:04:46,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 294 transitions, 1331 flow [2025-03-15 01:04:46,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:46,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2025-03-15 01:04:46,033 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8118433619866284 [2025-03-15 01:04:46,033 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -44 predicate places. [2025-03-15 01:04:46,033 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 294 transitions, 1331 flow [2025-03-15 01:04:46,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:46,034 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:46,034 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] [2025-03-15 01:04:46,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:04:46,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:46,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1202927368, now seen corresponding path program 1 times [2025-03-15 01:04:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:46,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520455572] [2025-03-15 01:04:46,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:46,091 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:04:46,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:46,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520455572] [2025-03-15 01:04:46,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520455572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:46,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586865178] [2025-03-15 01:04:46,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:46,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:46,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:46,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:46,093 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-03-15 01:04:46,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 294 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:46,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:46,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-03-15 01:04:46,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:46,227 INFO L124 PetriNetUnfolderBase]: 131/818 cut-off events. [2025-03-15 01:04:46,227 INFO L125 PetriNetUnfolderBase]: For 5548/5840 co-relation queries the response was YES. [2025-03-15 01:04:46,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2736 conditions, 818 events. 131/818 cut-off events. For 5548/5840 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3973 event pairs, 38 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 2228. Up to 207 conditions per place. [2025-03-15 01:04:46,235 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 32 selfloop transitions, 2 changer transitions 14/293 dead transitions. [2025-03-15 01:04:46,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 1397 flow [2025-03-15 01:04:46,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-03-15 01:04:46,237 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-03-15 01:04:46,238 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -43 predicate places. [2025-03-15 01:04:46,238 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 293 transitions, 1397 flow [2025-03-15 01:04:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:46,239 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:46,239 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] [2025-03-15 01:04:46,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:04:46,239 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:46,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:46,240 INFO L85 PathProgramCache]: Analyzing trace with hash 307830896, now seen corresponding path program 1 times [2025-03-15 01:04:46,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:46,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482253321] [2025-03-15 01:04:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:46,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:46,729 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:04:46,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:46,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482253321] [2025-03-15 01:04:46,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482253321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:46,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:46,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:04:46,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947984468] [2025-03-15 01:04:46,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:46,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:04:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:46,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:04:46,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:04:46,732 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 349 [2025-03-15 01:04:46,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 293 transitions, 1397 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 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:04:46,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:46,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 349 [2025-03-15 01:04:46,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:46,937 INFO L124 PetriNetUnfolderBase]: 131/816 cut-off events. [2025-03-15 01:04:46,937 INFO L125 PetriNetUnfolderBase]: For 6636/6966 co-relation queries the response was YES. [2025-03-15 01:04:46,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 816 events. 131/816 cut-off events. For 6636/6966 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3959 event pairs, 38 based on Foata normal form. 0/689 useless extension candidates. Maximal degree in co-relation 2372. Up to 207 conditions per place. [2025-03-15 01:04:46,945 INFO L140 encePairwiseOnDemand]: 337/349 looper letters, 55 selfloop transitions, 10 changer transitions 14/291 dead transitions. [2025-03-15 01:04:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 291 transitions, 1523 flow [2025-03-15 01:04:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:04:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:04:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1525 transitions. [2025-03-15 01:04:46,949 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7282712511938872 [2025-03-15 01:04:46,949 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -40 predicate places. [2025-03-15 01:04:46,949 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 291 transitions, 1523 flow [2025-03-15 01:04:46,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 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:04:46,951 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:46,951 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] [2025-03-15 01:04:46,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:04:46,951 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:46,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:46,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1072554662, now seen corresponding path program 1 times [2025-03-15 01:04:46,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:46,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983398237] [2025-03-15 01:04:46,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:46,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:47,008 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:04:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983398237] [2025-03-15 01:04:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983398237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:47,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154006459] [2025-03-15 01:04:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:47,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:47,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:47,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:47,011 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-03-15 01:04:47,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 291 transitions, 1523 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:47,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:47,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-03-15 01:04:47,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:47,124 INFO L124 PetriNetUnfolderBase]: 131/867 cut-off events. [2025-03-15 01:04:47,125 INFO L125 PetriNetUnfolderBase]: For 6860/7260 co-relation queries the response was YES. [2025-03-15 01:04:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3142 conditions, 867 events. 131/867 cut-off events. For 6860/7260 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4440 event pairs, 31 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 2568. Up to 207 conditions per place. [2025-03-15 01:04:47,132 INFO L140 encePairwiseOnDemand]: 347/349 looper letters, 32 selfloop transitions, 1 changer transitions 14/290 dead transitions. [2025-03-15 01:04:47,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 290 transitions, 1585 flow [2025-03-15 01:04:47,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:47,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 850 transitions. [2025-03-15 01:04:47,134 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8118433619866284 [2025-03-15 01:04:47,134 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -39 predicate places. [2025-03-15 01:04:47,134 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 290 transitions, 1585 flow [2025-03-15 01:04:47,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 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:04:47,135 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:47,135 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:47,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:04:47,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:47,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:47,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1657468355, now seen corresponding path program 1 times [2025-03-15 01:04:47,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:47,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885685097] [2025-03-15 01:04:47,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:47,170 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:04:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885685097] [2025-03-15 01:04:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885685097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754647793] [2025-03-15 01:04:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:47,171 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 349 [2025-03-15 01:04:47,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 290 transitions, 1585 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:47,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:47,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 349 [2025-03-15 01:04:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:47,306 INFO L124 PetriNetUnfolderBase]: 131/866 cut-off events. [2025-03-15 01:04:47,306 INFO L125 PetriNetUnfolderBase]: For 8030/8476 co-relation queries the response was YES. [2025-03-15 01:04:47,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 866 events. 131/866 cut-off events. For 8030/8476 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4452 event pairs, 31 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 2712. Up to 207 conditions per place. [2025-03-15 01:04:47,313 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 32 selfloop transitions, 2 changer transitions 14/289 dead transitions. [2025-03-15 01:04:47,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 289 transitions, 1651 flow [2025-03-15 01:04:47,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 848 transitions. [2025-03-15 01:04:47,315 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8099331423113658 [2025-03-15 01:04:47,316 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -38 predicate places. [2025-03-15 01:04:47,316 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 289 transitions, 1651 flow [2025-03-15 01:04:47,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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:04:47,317 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:47,317 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] [2025-03-15 01:04:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:04:47,317 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1918471236, now seen corresponding path program 1 times [2025-03-15 01:04:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98669663] [2025-03-15 01:04:47,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98669663] [2025-03-15 01:04:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98669663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170572008] [2025-03-15 01:04:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:47,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:47,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:47,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:47,363 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 349 [2025-03-15 01:04:47,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 289 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 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:04:47,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:47,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 349 [2025-03-15 01:04:47,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:47,473 INFO L124 PetriNetUnfolderBase]: 112/770 cut-off events. [2025-03-15 01:04:47,474 INFO L125 PetriNetUnfolderBase]: For 8238/8802 co-relation queries the response was YES. [2025-03-15 01:04:47,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 770 events. 112/770 cut-off events. For 8238/8802 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3717 event pairs, 22 based on Foata normal form. 0/665 useless extension candidates. Maximal degree in co-relation 2519. Up to 176 conditions per place. [2025-03-15 01:04:47,483 INFO L140 encePairwiseOnDemand]: 345/349 looper letters, 34 selfloop transitions, 1 changer transitions 16/286 dead transitions. [2025-03-15 01:04:47,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 286 transitions, 1713 flow [2025-03-15 01:04:47,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:47,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-03-15 01:04:47,485 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8003820439350525 [2025-03-15 01:04:47,486 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -39 predicate places. [2025-03-15 01:04:47,486 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 286 transitions, 1713 flow [2025-03-15 01:04:47,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 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:04:47,487 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:47,487 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:04:47,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:04:47,487 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:47,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:47,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1060341913, now seen corresponding path program 1 times [2025-03-15 01:04:47,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:47,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422010739] [2025-03-15 01:04:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:47,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:47,574 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:04:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422010739] [2025-03-15 01:04:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422010739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749684989] [2025-03-15 01:04:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:47,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:47,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:47,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:47,577 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 349 [2025-03-15 01:04:47,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 286 transitions, 1713 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:04:47,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:47,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 349 [2025-03-15 01:04:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:47,804 INFO L124 PetriNetUnfolderBase]: 240/1050 cut-off events. [2025-03-15 01:04:47,805 INFO L125 PetriNetUnfolderBase]: For 24709/25015 co-relation queries the response was YES. [2025-03-15 01:04:47,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5669 conditions, 1050 events. 240/1050 cut-off events. For 24709/25015 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5911 event pairs, 42 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 5063. Up to 304 conditions per place. [2025-03-15 01:04:47,824 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 41 selfloop transitions, 2 changer transitions 16/294 dead transitions. [2025-03-15 01:04:47,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 2094 flow [2025-03-15 01:04:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:47,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 856 transitions. [2025-03-15 01:04:47,827 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8175740210124164 [2025-03-15 01:04:47,827 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -38 predicate places. [2025-03-15 01:04:47,828 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 294 transitions, 2094 flow [2025-03-15 01:04:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:04:47,828 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:47,828 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] [2025-03-15 01:04:47,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:04:47,828 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:47,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -175799012, now seen corresponding path program 1 times [2025-03-15 01:04:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783266684] [2025-03-15 01:04:47,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:47,893 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:04:47,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:47,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783266684] [2025-03-15 01:04:47,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783266684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:47,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940778555] [2025-03-15 01:04:47,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:47,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:47,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:47,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:47,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:47,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 349 [2025-03-15 01:04:47,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 294 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:04:47,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:47,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 349 [2025-03-15 01:04:47,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:48,100 INFO L124 PetriNetUnfolderBase]: 270/1146 cut-off events. [2025-03-15 01:04:48,101 INFO L125 PetriNetUnfolderBase]: For 32223/32872 co-relation queries the response was YES. [2025-03-15 01:04:48,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1146 events. 270/1146 cut-off events. For 32223/32872 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6882 event pairs, 52 based on Foata normal form. 7/1012 useless extension candidates. Maximal degree in co-relation 5955. Up to 334 conditions per place. [2025-03-15 01:04:48,117 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 51 selfloop transitions, 2 changer transitions 16/302 dead transitions. [2025-03-15 01:04:48,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 302 transitions, 2511 flow [2025-03-15 01:04:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:04:48,120 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8127984718242598 [2025-03-15 01:04:48,120 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -37 predicate places. [2025-03-15 01:04:48,120 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 302 transitions, 2511 flow [2025-03-15 01:04:48,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 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:04:48,121 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:48,121 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:48,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:04:48,121 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:48,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash 329838033, now seen corresponding path program 1 times [2025-03-15 01:04:48,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:48,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539070133] [2025-03-15 01:04:48,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:48,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:48,189 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:04:48,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:48,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539070133] [2025-03-15 01:04:48,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539070133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:48,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203813294] [2025-03-15 01:04:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:48,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:48,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:48,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:48,191 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 349 [2025-03-15 01:04:48,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 302 transitions, 2511 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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:04:48,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:48,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 349 [2025-03-15 01:04:48,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:48,499 INFO L124 PetriNetUnfolderBase]: 630/1672 cut-off events. [2025-03-15 01:04:48,499 INFO L125 PetriNetUnfolderBase]: For 89404/90303 co-relation queries the response was YES. [2025-03-15 01:04:48,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13840 conditions, 1672 events. 630/1672 cut-off events. For 89404/90303 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10390 event pairs, 91 based on Foata normal form. 10/1463 useless extension candidates. Maximal degree in co-relation 13001. Up to 687 conditions per place. [2025-03-15 01:04:48,520 INFO L140 encePairwiseOnDemand]: 344/349 looper letters, 65 selfloop transitions, 2 changer transitions 18/316 dead transitions. [2025-03-15 01:04:48,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 316 transitions, 3238 flow [2025-03-15 01:04:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:48,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-03-15 01:04:48,522 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8127984718242598 [2025-03-15 01:04:48,522 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -37 predicate places. [2025-03-15 01:04:48,522 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 316 transitions, 3238 flow [2025-03-15 01:04:48,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 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:04:48,523 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:48,523 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] [2025-03-15 01:04:48,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:04:48,523 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 115 more)] === [2025-03-15 01:04:48,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:48,524 INFO L85 PathProgramCache]: Analyzing trace with hash 434257172, now seen corresponding path program 1 times [2025-03-15 01:04:48,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:48,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803644438] [2025-03-15 01:04:48,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:48,577 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:04:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803644438] [2025-03-15 01:04:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803644438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506525392] [2025-03-15 01:04:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:48,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:48,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:48,579 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 349 [2025-03-15 01:04:48,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 316 transitions, 3238 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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:04:48,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:48,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 349 [2025-03-15 01:04:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:48,920 INFO L124 PetriNetUnfolderBase]: 701/1602 cut-off events. [2025-03-15 01:04:48,921 INFO L125 PetriNetUnfolderBase]: For 109599/110793 co-relation queries the response was YES. [2025-03-15 01:04:48,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16014 conditions, 1602 events. 701/1602 cut-off events. For 109599/110793 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9108 event pairs, 75 based on Foata normal form. 45/1443 useless extension candidates. Maximal degree in co-relation 15229. Up to 760 conditions per place. [2025-03-15 01:04:48,937 INFO L140 encePairwiseOnDemand]: 346/349 looper letters, 0 selfloop transitions, 0 changer transitions 331/331 dead transitions. [2025-03-15 01:04:48,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 331 transitions, 4031 flow [2025-03-15 01:04:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 845 transitions. [2025-03-15 01:04:48,940 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8070678127984718 [2025-03-15 01:04:48,941 INFO L298 CegarLoopForPetriNet]: 345 programPoint places, -36 predicate places. [2025-03-15 01:04:48,942 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 331 transitions, 4031 flow [2025-03-15 01:04:48,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 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:04:48,958 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-queue-add-3.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:04:49,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (117 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (116 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (115 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (114 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (113 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (112 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (111 of 119 remaining) [2025-03-15 01:04:49,009 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (110 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (109 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (108 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (107 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (106 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (105 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (104 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (103 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (102 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (101 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (100 of 119 remaining) [2025-03-15 01:04:49,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (99 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (98 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (96 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (95 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (93 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (92 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (91 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (90 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (89 of 119 remaining) [2025-03-15 01:04:49,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (88 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (87 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (86 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (85 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (84 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (83 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (82 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (80 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (79 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (77 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (76 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (75 of 119 remaining) [2025-03-15 01:04:49,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (74 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (73 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (72 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (71 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (70 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (69 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (68 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (67 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (66 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (65 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (64 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (63 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (61 of 119 remaining) [2025-03-15 01:04:49,013 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (60 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (59 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (58 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (55 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (54 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (53 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (52 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (47 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (46 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (45 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (44 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (43 of 119 remaining) [2025-03-15 01:04:49,014 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (42 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (41 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (40 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (39 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (38 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (37 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (36 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (35 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (31 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (29 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (28 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (27 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 119 remaining) [2025-03-15 01:04:49,015 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (18 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (17 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (16 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (15 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (13 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (12 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 119 remaining) [2025-03-15 01:04:49,016 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 119 remaining) [2025-03-15 01:04:49,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 119 remaining) [2025-03-15 01:04:49,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 119 remaining) [2025-03-15 01:04:49,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 119 remaining) [2025-03-15 01:04:49,017 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 119 remaining) [2025-03-15 01:04:49,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 119 remaining) [2025-03-15 01:04:49,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 119 remaining) [2025-03-15 01:04:49,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 119 remaining) [2025-03-15 01:04:49,018 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 119 remaining) [2025-03-15 01:04:49,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:04:49,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] [2025-03-15 01:04:49,024 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:04:49,024 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:04:49,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:04:49 BasicIcfg [2025-03-15 01:04:49,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:04:49,032 INFO L158 Benchmark]: Toolchain (without parser) took 6835.89ms. Allocated memory was 71.3MB in the beginning and 310.4MB in the end (delta: 239.1MB). Free memory was 44.5MB in the beginning and 87.9MB in the end (delta: -43.5MB). Peak memory consumption was 213.8MB. Max. memory is 8.0GB. [2025-03-15 01:04:49,032 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:49,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.02ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.0MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:04:49,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 27.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:49,033 INFO L158 Benchmark]: Boogie Preprocessor took 43.31ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 25.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:04:49,033 INFO L158 Benchmark]: RCFGBuilder took 1091.25ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 38.3MB in the end (delta: -13.0MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. [2025-03-15 01:04:49,033 INFO L158 Benchmark]: TraceAbstraction took 5481.76ms. Allocated memory was 88.1MB in the beginning and 310.4MB in the end (delta: 222.3MB). Free memory was 37.1MB in the beginning and 87.9MB in the end (delta: -50.8MB). Peak memory consumption was 187.9MB. Max. memory is 8.0GB. [2025-03-15 01:04:49,037 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.18ms. Allocated memory is still 71.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 182.02ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.0MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 27.9MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.31ms. Allocated memory is still 71.3MB. Free memory was 27.9MB in the beginning and 25.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1091.25ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 25.3MB in the beginning and 38.3MB in the end (delta: -13.0MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5481.76ms. Allocated memory was 88.1MB in the beginning and 310.4MB in the end (delta: 222.3MB). Free memory was 37.1MB in the beginning and 87.9MB in the end (delta: -50.8MB). Peak memory consumption was 187.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: 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: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: 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: 137]: 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: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: 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 7 procedures, 431 locations, 119 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: 5.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 123 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4031occurred in iteration=19, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1873 NumberOfCodeBlocks, 1873 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1854 ConstructedInterpolants, 0 QuantifiedInterpolants, 2005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 67 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:04:49,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...