/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-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:04:38,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:04:38,398 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:38,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:04:38,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:04:38,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:04:38,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:04:38,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:04:38,433 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:04:38,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:04:38,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:04:38,435 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:04:38,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:04:38,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:04:38,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:04:38,436 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:38,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:04:38,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:04:38,437 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:38,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:04:38,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:04:38,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:04:38,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:04:38,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:04:38,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2025-03-15 01:04:39,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e4a9f62/a905fe383a8f4e5f8d9ecf3a146f2366/FLAG506e61c4c [2025-03-15 01:04:40,103 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:04:40,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2025-03-15 01:04:40,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e4a9f62/a905fe383a8f4e5f8d9ecf3a146f2366/FLAG506e61c4c [2025-03-15 01:04:40,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8e4a9f62/a905fe383a8f4e5f8d9ecf3a146f2366 [2025-03-15 01:04:40,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:04:40,487 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:04:40,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:40,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:04:40,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:04:40,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:40" (1/1) ... [2025-03-15 01:04:40,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b3c9a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:40, skipping insertion in model container [2025-03-15 01:04:40,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:40" (1/1) ... [2025-03-15 01:04:40,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:04:40,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:40,645 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:04:40,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:40,683 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:04:40,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:40 WrapperNode [2025-03-15 01:04:40,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:40,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:40,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:04:40,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:04:40,690 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:40" (1/1) ... [2025-03-15 01:04:40,698 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:40" (1/1) ... [2025-03-15 01:04:40,721 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 272 [2025-03-15 01:04:40,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:40,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:04:40,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:04:40,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:04:40,727 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:40" (1/1) ... [2025-03-15 01:04:40,727 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:40" (1/1) ... [2025-03-15 01:04:40,733 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:40" (1/1) ... [2025-03-15 01:04:40,733 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:40" (1/1) ... [2025-03-15 01:04:40,739 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:40" (1/1) ... [2025-03-15 01:04:40,741 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:40" (1/1) ... [2025-03-15 01:04:40,743 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:40" (1/1) ... [2025-03-15 01:04:40,744 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:40" (1/1) ... [2025-03-15 01:04:40,745 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:40" (1/1) ... [2025-03-15 01:04:40,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:04:40,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:04:40,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:04:40,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:04:40,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:40" (1/1) ... [2025-03-15 01:04:40,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:04:40,776 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:40,780 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:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:04:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:04:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:04:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:04:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:04:40,798 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:40,872 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:04:40,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:04:41,221 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:04:41,221 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:04:41,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:04:41,448 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:04:41,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:41 BoogieIcfgContainer [2025-03-15 01:04:41,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:04:41,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:04:41,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:04:41,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:04:41,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:04:40" (1/3) ... [2025-03-15 01:04:41,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651638be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:41, skipping insertion in model container [2025-03-15 01:04:41,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:40" (2/3) ... [2025-03-15 01:04:41,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651638be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:41, skipping insertion in model container [2025-03-15 01:04:41,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:41" (3/3) ... [2025-03-15 01:04:41,463 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2025-03-15 01:04:41,475 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:04:41,477 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-2.wvr.c that has 3 procedures, 208 locations, 1 initial locations, 3 loop locations, and 40 error locations. [2025-03-15 01:04:41,478 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:04:41,533 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:04:41,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:04:41,578 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;@2f0742b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:04:41,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-03-15 01:04:41,600 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:04:41,600 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 01:04:41,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:04:41,602 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:41,603 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] [2025-03-15 01:04:41,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2012404597, now seen corresponding path program 1 times [2025-03-15 01:04:41,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:41,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741203436] [2025-03-15 01:04:41,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:41,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:41,731 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:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741203436] [2025-03-15 01:04:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741203436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368456249] [2025-03-15 01:04:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:41,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:41,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:41,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:41,759 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 216 [2025-03-15 01:04:41,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 216 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:41,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:41,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 216 [2025-03-15 01:04:41,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:41,876 INFO L124 PetriNetUnfolderBase]: 16/214 cut-off events. [2025-03-15 01:04:41,876 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-15 01:04:41,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 214 events. 16/214 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 333 event pairs, 11 based on Foata normal form. 5/192 useless extension candidates. Maximal degree in co-relation 155. Up to 44 conditions per place. [2025-03-15 01:04:41,883 INFO L140 encePairwiseOnDemand]: 180/216 looper letters, 18 selfloop transitions, 2 changer transitions 12/174 dead transitions. [2025-03-15 01:04:41,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 174 transitions, 402 flow [2025-03-15 01:04:41,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2025-03-15 01:04:41,896 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8256172839506173 [2025-03-15 01:04:41,898 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -34 predicate places. [2025-03-15 01:04:41,899 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 174 transitions, 402 flow [2025-03-15 01:04:41,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:41,899 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:41,899 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] [2025-03-15 01:04:41,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:04:41,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:41,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:41,901 INFO L85 PathProgramCache]: Analyzing trace with hash -624926579, now seen corresponding path program 1 times [2025-03-15 01:04:41,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:41,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910447705] [2025-03-15 01:04:41,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:41,951 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:41,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:41,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910447705] [2025-03-15 01:04:41,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910447705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:41,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:41,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:41,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992918272] [2025-03-15 01:04:41,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:41,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:41,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:41,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:41,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216 [2025-03-15 01:04:41,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 174 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:41,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:41,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216 [2025-03-15 01:04:41,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,019 INFO L124 PetriNetUnfolderBase]: 16/213 cut-off events. [2025-03-15 01:04:42,019 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-15 01:04:42,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 213 events. 16/213 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 334 event pairs, 11 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 165. Up to 44 conditions per place. [2025-03-15 01:04:42,022 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 13 selfloop transitions, 2 changer transitions 12/173 dead transitions. [2025-03-15 01:04:42,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 173 transitions, 430 flow [2025-03-15 01:04:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-15 01:04:42,025 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7932098765432098 [2025-03-15 01:04:42,025 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -33 predicate places. [2025-03-15 01:04:42,025 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 173 transitions, 430 flow [2025-03-15 01:04:42,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42,026 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,026 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] [2025-03-15 01:04:42,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:04:42,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2138095345, now seen corresponding path program 1 times [2025-03-15 01:04:42,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25770425] [2025-03-15 01:04:42,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:42,066 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:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:42,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25770425] [2025-03-15 01:04:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25770425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856758698] [2025-03-15 01:04:42,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:42,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:42,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:42,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:42,068 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216 [2025-03-15 01:04:42,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 173 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:42,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216 [2025-03-15 01:04:42,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,140 INFO L124 PetriNetUnfolderBase]: 16/212 cut-off events. [2025-03-15 01:04:42,140 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-15 01:04:42,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 212 events. 16/212 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 338 event pairs, 11 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 175. Up to 44 conditions per place. [2025-03-15 01:04:42,142 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 13 selfloop transitions, 2 changer transitions 12/172 dead transitions. [2025-03-15 01:04:42,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 172 transitions, 458 flow [2025-03-15 01:04:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-15 01:04:42,145 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7932098765432098 [2025-03-15 01:04:42,145 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -32 predicate places. [2025-03-15 01:04:42,145 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 172 transitions, 458 flow [2025-03-15 01:04:42,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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:42,146 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,146 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:04:42,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash -881300387, now seen corresponding path program 1 times [2025-03-15 01:04:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567931988] [2025-03-15 01:04:42,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:42,194 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:42,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:42,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567931988] [2025-03-15 01:04:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567931988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621751216] [2025-03-15 01:04:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:42,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:42,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:42,200 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 216 [2025-03-15 01:04:42,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 172 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:42,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:42,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 216 [2025-03-15 01:04:42,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,254 INFO L124 PetriNetUnfolderBase]: 22/252 cut-off events. [2025-03-15 01:04:42,254 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-03-15 01:04:42,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 252 events. 22/252 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs, 8 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 223. Up to 51 conditions per place. [2025-03-15 01:04:42,256 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 13 selfloop transitions, 2 changer transitions 12/175 dead transitions. [2025-03-15 01:04:42,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 175 transitions, 519 flow [2025-03-15 01:04:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2025-03-15 01:04:42,259 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8117283950617284 [2025-03-15 01:04:42,260 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -31 predicate places. [2025-03-15 01:04:42,260 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 175 transitions, 519 flow [2025-03-15 01:04:42,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:42,260 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,260 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] [2025-03-15 01:04:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:04:42,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1207774989, now seen corresponding path program 1 times [2025-03-15 01:04:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703100324] [2025-03-15 01:04:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:42,294 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:42,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:42,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703100324] [2025-03-15 01:04:42,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703100324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:42,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:42,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:42,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508473413] [2025-03-15 01:04:42,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:42,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:42,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:42,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:42,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:42,296 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-03-15 01:04:42,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 175 transitions, 519 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:42,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-03-15 01:04:42,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,358 INFO L124 PetriNetUnfolderBase]: 22/251 cut-off events. [2025-03-15 01:04:42,359 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2025-03-15 01:04:42,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 251 events. 22/251 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 439 event pairs, 8 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 247. Up to 51 conditions per place. [2025-03-15 01:04:42,360 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 14 selfloop transitions, 2 changer transitions 12/174 dead transitions. [2025-03-15 01:04:42,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 174 transitions, 549 flow [2025-03-15 01:04:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-03-15 01:04:42,362 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-03-15 01:04:42,362 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -30 predicate places. [2025-03-15 01:04:42,363 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 174 transitions, 549 flow [2025-03-15 01:04:42,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42,363 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,363 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] [2025-03-15 01:04:42,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:04:42,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1884554306, now seen corresponding path program 1 times [2025-03-15 01:04:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480613023] [2025-03-15 01:04:42,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:42,411 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:42,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480613023] [2025-03-15 01:04:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480613023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:42,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:42,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466513553] [2025-03-15 01:04:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:42,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:42,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:42,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:42,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:42,413 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 216 [2025-03-15 01:04:42,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 174 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:42,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:42,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 216 [2025-03-15 01:04:42,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,454 INFO L124 PetriNetUnfolderBase]: 22/250 cut-off events. [2025-03-15 01:04:42,454 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2025-03-15 01:04:42,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 250 events. 22/250 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs, 8 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 271. Up to 51 conditions per place. [2025-03-15 01:04:42,455 INFO L140 encePairwiseOnDemand]: 214/216 looper letters, 14 selfloop transitions, 1 changer transitions 12/173 dead transitions. [2025-03-15 01:04:42,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 173 transitions, 575 flow [2025-03-15 01:04:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-03-15 01:04:42,457 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2025-03-15 01:04:42,459 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -29 predicate places. [2025-03-15 01:04:42,459 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 173 transitions, 575 flow [2025-03-15 01:04:42,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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:42,459 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,459 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] [2025-03-15 01:04:42,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:04:42,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,460 INFO L85 PathProgramCache]: Analyzing trace with hash -864894326, now seen corresponding path program 1 times [2025-03-15 01:04:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247119744] [2025-03-15 01:04:42,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:42,541 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:42,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:42,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247119744] [2025-03-15 01:04:42,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247119744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:42,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:42,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829204772] [2025-03-15 01:04:42,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:42,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:42,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:42,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:42,543 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-03-15 01:04:42,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 173 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:42,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-03-15 01:04:42,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:42,587 INFO L124 PetriNetUnfolderBase]: 22/249 cut-off events. [2025-03-15 01:04:42,587 INFO L125 PetriNetUnfolderBase]: For 495/495 co-relation queries the response was YES. [2025-03-15 01:04:42,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 249 events. 22/249 cut-off events. For 495/495 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 437 event pairs, 8 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 295. Up to 51 conditions per place. [2025-03-15 01:04:42,589 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 14 selfloop transitions, 2 changer transitions 12/172 dead transitions. [2025-03-15 01:04:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 172 transitions, 605 flow [2025-03-15 01:04:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-03-15 01:04:42,590 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-03-15 01:04:42,591 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -28 predicate places. [2025-03-15 01:04:42,592 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 172 transitions, 605 flow [2025-03-15 01:04:42,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:42,592 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:42,592 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] [2025-03-15 01:04:42,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:04:42,593 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:42,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:42,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1000211288, now seen corresponding path program 1 times [2025-03-15 01:04:42,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:42,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597406750] [2025-03-15 01:04:42,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:42,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:43,068 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,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:43,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597406750] [2025-03-15 01:04:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597406750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:43,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:43,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:04:43,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696786849] [2025-03-15 01:04:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:43,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:04:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:43,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:04:43,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:04:43,070 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 216 [2025-03-15 01:04:43,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 172 transitions, 605 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 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,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:43,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 216 [2025-03-15 01:04:43,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:43,149 INFO L124 PetriNetUnfolderBase]: 22/248 cut-off events. [2025-03-15 01:04:43,149 INFO L125 PetriNetUnfolderBase]: For 636/636 co-relation queries the response was YES. [2025-03-15 01:04:43,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 248 events. 22/248 cut-off events. For 636/636 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 434 event pairs, 8 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 319. Up to 51 conditions per place. [2025-03-15 01:04:43,151 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 24 selfloop transitions, 5 changer transitions 12/171 dead transitions. [2025-03-15 01:04:43,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 171 transitions, 661 flow [2025-03-15 01:04:43,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:04:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:04:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2025-03-15 01:04:43,152 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7469135802469136 [2025-03-15 01:04:43,155 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -24 predicate places. [2025-03-15 01:04:43,155 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 171 transitions, 661 flow [2025-03-15 01:04:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 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,156 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:43,156 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] [2025-03-15 01:04:43,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:04:43,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:43,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:43,156 INFO L85 PathProgramCache]: Analyzing trace with hash -92688201, now seen corresponding path program 1 times [2025-03-15 01:04:43,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:43,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394405227] [2025-03-15 01:04:43,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:43,199 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,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394405227] [2025-03-15 01:04:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394405227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:43,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:43,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721221128] [2025-03-15 01:04:43,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:43,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:43,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:43,201 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 216 [2025-03-15 01:04:43,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 171 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:43,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 216 [2025-03-15 01:04:43,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:43,253 INFO L124 PetriNetUnfolderBase]: 19/240 cut-off events. [2025-03-15 01:04:43,253 INFO L125 PetriNetUnfolderBase]: For 834/846 co-relation queries the response was YES. [2025-03-15 01:04:43,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 240 events. 19/240 cut-off events. For 834/846 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 397 event pairs, 6 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 313. Up to 43 conditions per place. [2025-03-15 01:04:43,255 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 16 selfloop transitions, 1 changer transitions 14/168 dead transitions. [2025-03-15 01:04:43,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 168 transitions, 687 flow [2025-03-15 01:04:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2025-03-15 01:04:43,257 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7870370370370371 [2025-03-15 01:04:43,257 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -25 predicate places. [2025-03-15 01:04:43,258 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 168 transitions, 687 flow [2025-03-15 01:04:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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,258 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:43,258 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] [2025-03-15 01:04:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:04:43,258 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1549887833, now seen corresponding path program 1 times [2025-03-15 01:04:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538290765] [2025-03-15 01:04:43,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:43,311 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,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:43,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538290765] [2025-03-15 01:04:43,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538290765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:43,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564181046] [2025-03-15 01:04:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:43,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:43,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:43,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:43,317 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 216 [2025-03-15 01:04:43,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 168 transitions, 687 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:43,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 216 [2025-03-15 01:04:43,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:43,389 INFO L124 PetriNetUnfolderBase]: 34/250 cut-off events. [2025-03-15 01:04:43,390 INFO L125 PetriNetUnfolderBase]: For 2181/2233 co-relation queries the response was YES. [2025-03-15 01:04:43,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 250 events. 34/250 cut-off events. For 2181/2233 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 513 event pairs, 6 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 473. Up to 58 conditions per place. [2025-03-15 01:04:43,392 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 16 selfloop transitions, 2 changer transitions 16/169 dead transitions. [2025-03-15 01:04:43,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 169 transitions, 788 flow [2025-03-15 01:04:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-03-15 01:04:43,394 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-03-15 01:04:43,394 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -25 predicate places. [2025-03-15 01:04:43,394 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 169 transitions, 788 flow [2025-03-15 01:04:43,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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,395 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:43,395 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:43,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:04:43,395 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-03-15 01:04:43,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 305591708, now seen corresponding path program 1 times [2025-03-15 01:04:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604925523] [2025-03-15 01:04:43,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:43,441 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,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604925523] [2025-03-15 01:04:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604925523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:43,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:43,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:43,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137095717] [2025-03-15 01:04:43,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:43,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:43,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:43,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:43,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 216 [2025-03-15 01:04:43,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 169 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:43,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 216 [2025-03-15 01:04:43,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:43,500 INFO L124 PetriNetUnfolderBase]: 37/249 cut-off events. [2025-03-15 01:04:43,500 INFO L125 PetriNetUnfolderBase]: For 2727/2802 co-relation queries the response was YES. [2025-03-15 01:04:43,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 249 events. 37/249 cut-off events. For 2727/2802 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 523 event pairs, 6 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 559. Up to 61 conditions per place. [2025-03-15 01:04:43,501 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 0 selfloop transitions, 0 changer transitions 171/171 dead transitions. [2025-03-15 01:04:43,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 171 transitions, 903 flow [2025-03-15 01:04:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:43,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-03-15 01:04:43,503 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7932098765432098 [2025-03-15 01:04:43,503 INFO L298 CegarLoopForPetriNet]: 214 programPoint places, -24 predicate places. [2025-03-15 01:04:43,503 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 171 transitions, 903 flow [2025-03-15 01:04:43,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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,512 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-queue-add-2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-03-15 01:04:43,545 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-03-15 01:04:43,546 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-03-15 01:04:43,547 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-03-15 01:04:43,548 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-03-15 01:04:43,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-03-15 01:04:43,549 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-03-15 01:04:43,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-03-15 01:04:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:04:43,550 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:43,557 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:04:43,558 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:04:43,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:04:43 BasicIcfg [2025-03-15 01:04:43,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:04:43,563 INFO L158 Benchmark]: Toolchain (without parser) took 3075.98ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 44.1MB in the beginning and 92.3MB in the end (delta: -48.3MB). Peak memory consumption was 65.8MB. Max. memory is 8.0GB. [2025-03-15 01:04:43,563 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:43,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.13ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 31.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 01:04:43,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.50ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 29.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:04:43,564 INFO L158 Benchmark]: Boogie Preprocessor took 24.56ms. Allocated memory is still 71.3MB. Free memory was 29.1MB in the beginning and 27.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:43,564 INFO L158 Benchmark]: RCFGBuilder took 701.49ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 15.3MB in the end (delta: 11.9MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2025-03-15 01:04:43,564 INFO L158 Benchmark]: TraceAbstraction took 2106.36ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 42.0MB in the beginning and 92.3MB in the end (delta: -50.4MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-03-15 01:04:43,565 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.23ms. Allocated memory is still 71.3MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.13ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 31.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.50ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 29.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.56ms. Allocated memory is still 71.3MB. Free memory was 29.1MB in the beginning and 27.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 701.49ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 15.3MB in the end (delta: 11.9MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2106.36ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 42.0MB in the beginning and 92.3MB in the end (delta: -50.4MB). Peak memory consumption was 61.6MB. 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 267 locations, 71 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: 2.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 72 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=11, InterpolantAutomatonStates: 36, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:04:43,578 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...