/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-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:03:00,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:03:00,449 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:03:00,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:03:00,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:03:00,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:03:00,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:03:00,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:03:00,478 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:03:00,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:03:00,479 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:03:00,479 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:00,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:03:00,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:03:00,480 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:03:00,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:03:00,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:03:00,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:03:00,822 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:03:00,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:03:00,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2025-03-15 01:03:02,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf19c48b/7878e89033cb405ea045968d8f57d907/FLAG2cfd81c3b [2025-03-15 01:03:02,266 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:03:02,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2025-03-15 01:03:02,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf19c48b/7878e89033cb405ea045968d8f57d907/FLAG2cfd81c3b [2025-03-15 01:03:02,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf19c48b/7878e89033cb405ea045968d8f57d907 [2025-03-15 01:03:02,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:03:02,300 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:03:02,301 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:02,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:03:02,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:03:02,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64869c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02, skipping insertion in model container [2025-03-15 01:03:02,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:03:02,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:02,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:03:02,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:02,572 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:03:02,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02 WrapperNode [2025-03-15 01:03:02,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:02,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:02,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:03:02,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:03:02,578 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:03:02" (1/1) ... [2025-03-15 01:03:02,592 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:03:02" (1/1) ... [2025-03-15 01:03:02,634 INFO L138 Inliner]: procedures = 26, calls = 64, calls flagged for inlining = 23, calls inlined = 29, statements flattened = 627 [2025-03-15 01:03:02,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:02,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:03:02,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:03:02,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:03:02,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,676 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:03:02,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:03:02,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:03:02,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:03:02,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (1/1) ... [2025-03-15 01:03:02,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:03:02,725 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:03:02,729 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:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:03:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:03:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:03:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:03:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:03:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:03:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:03:02,752 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:03:02,867 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:03:02,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:03:03,611 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:03:03,611 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:03:04,141 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:03:04,142 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:03:04,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:04 BoogieIcfgContainer [2025-03-15 01:03:04,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:03:04,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:03:04,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:03:04,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:03:04,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:03:02" (1/3) ... [2025-03-15 01:03:04,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f7535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:04, skipping insertion in model container [2025-03-15 01:03:04,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:02" (2/3) ... [2025-03-15 01:03:04,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f7535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:04, skipping insertion in model container [2025-03-15 01:03:04,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:04" (3/3) ... [2025-03-15 01:03:04,151 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2025-03-15 01:03:04,165 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:03:04,169 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series2.wvr.c that has 5 procedures, 415 locations, 1 initial locations, 7 loop locations, and 99 error locations. [2025-03-15 01:03:04,169 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:03:04,297 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:03:04,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:03:04,354 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;@5e812306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:03:04,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 182 error locations. [2025-03-15 01:03:04,380 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:03:04,380 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-15 01:03:04,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:03:04,382 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:04,382 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:04,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:04,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:04,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1746606322, now seen corresponding path program 1 times [2025-03-15 01:03:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58920400] [2025-03-15 01:03:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:04,540 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:03:04,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58920400] [2025-03-15 01:03:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58920400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:04,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357701246] [2025-03-15 01:03:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:04,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:04,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:04,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:04,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 429 [2025-03-15 01:03:04,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 429 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 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:03:04,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:04,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 429 [2025-03-15 01:03:04,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:04,982 INFO L124 PetriNetUnfolderBase]: 451/1194 cut-off events. [2025-03-15 01:03:04,983 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2025-03-15 01:03:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 1194 events. 451/1194 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5127 event pairs, 272 based on Foata normal form. 9/1075 useless extension candidates. Maximal degree in co-relation 1525. Up to 618 conditions per place. [2025-03-15 01:03:04,999 INFO L140 encePairwiseOnDemand]: 338/429 looper letters, 29 selfloop transitions, 2 changer transitions 16/330 dead transitions. [2025-03-15 01:03:05,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 330 transitions, 746 flow [2025-03-15 01:03:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1044 transitions. [2025-03-15 01:03:05,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8111888111888111 [2025-03-15 01:03:05,019 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -89 predicate places. [2025-03-15 01:03:05,020 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 330 transitions, 746 flow [2025-03-15 01:03:05,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 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:03:05,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:05,022 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] [2025-03-15 01:03:05,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:03:05,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:05,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1049207225, now seen corresponding path program 1 times [2025-03-15 01:03:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:05,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300395185] [2025-03-15 01:03:05,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:05,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:05,076 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:03:05,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:05,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300395185] [2025-03-15 01:03:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300395185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023826185] [2025-03-15 01:03:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:05,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:05,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:05,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:05,081 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 429 [2025-03-15 01:03:05,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 330 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:05,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:05,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 429 [2025-03-15 01:03:05,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:05,360 INFO L124 PetriNetUnfolderBase]: 451/1193 cut-off events. [2025-03-15 01:03:05,360 INFO L125 PetriNetUnfolderBase]: For 330/480 co-relation queries the response was YES. [2025-03-15 01:03:05,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 1193 events. 451/1193 cut-off events. For 330/480 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5152 event pairs, 272 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2092. Up to 618 conditions per place. [2025-03-15 01:03:05,372 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 26 selfloop transitions, 2 changer transitions 16/329 dead transitions. [2025-03-15 01:03:05,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 329 transitions, 800 flow [2025-03-15 01:03:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 01:03:05,375 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2025-03-15 01:03:05,375 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -88 predicate places. [2025-03-15 01:03:05,375 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 329 transitions, 800 flow [2025-03-15 01:03:05,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:05,376 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:05,376 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] [2025-03-15 01:03:05,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:03:05,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:05,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash -92311464, now seen corresponding path program 1 times [2025-03-15 01:03:05,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:05,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888705239] [2025-03-15 01:03:05,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:05,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:05,420 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:03:05,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:05,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888705239] [2025-03-15 01:03:05,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888705239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:05,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:05,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:05,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156318685] [2025-03-15 01:03:05,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:05,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:05,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:05,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:05,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:05,422 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 429 [2025-03-15 01:03:05,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 329 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:05,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:05,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 429 [2025-03-15 01:03:05,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:05,764 INFO L124 PetriNetUnfolderBase]: 451/1192 cut-off events. [2025-03-15 01:03:05,764 INFO L125 PetriNetUnfolderBase]: For 618/918 co-relation queries the response was YES. [2025-03-15 01:03:05,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 1192 events. 451/1192 cut-off events. For 618/918 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5144 event pairs, 272 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 2659. Up to 618 conditions per place. [2025-03-15 01:03:05,771 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 26 selfloop transitions, 2 changer transitions 16/328 dead transitions. [2025-03-15 01:03:05,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 328 transitions, 854 flow [2025-03-15 01:03:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:05,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 01:03:05,775 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2025-03-15 01:03:05,775 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -87 predicate places. [2025-03-15 01:03:05,775 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 328 transitions, 854 flow [2025-03-15 01:03:05,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:05,776 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:05,776 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] [2025-03-15 01:03:05,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:03:05,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:05,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:05,779 INFO L85 PathProgramCache]: Analyzing trace with hash -750825977, now seen corresponding path program 1 times [2025-03-15 01:03:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92399483] [2025-03-15 01:03:05,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:05,854 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:03:05,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:05,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92399483] [2025-03-15 01:03:05,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92399483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:05,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:05,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:05,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700108126] [2025-03-15 01:03:05,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:05,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:05,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:05,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:05,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:05,856 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 429 [2025-03-15 01:03:05,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 328 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:05,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:05,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 429 [2025-03-15 01:03:05,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:06,099 INFO L124 PetriNetUnfolderBase]: 451/1191 cut-off events. [2025-03-15 01:03:06,100 INFO L125 PetriNetUnfolderBase]: For 1022/1472 co-relation queries the response was YES. [2025-03-15 01:03:06,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 1191 events. 451/1191 cut-off events. For 1022/1472 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5141 event pairs, 272 based on Foata normal form. 0/1066 useless extension candidates. Maximal degree in co-relation 3226. Up to 618 conditions per place. [2025-03-15 01:03:06,107 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 26 selfloop transitions, 2 changer transitions 16/327 dead transitions. [2025-03-15 01:03:06,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 327 transitions, 908 flow [2025-03-15 01:03:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 01:03:06,110 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2025-03-15 01:03:06,110 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -86 predicate places. [2025-03-15 01:03:06,110 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 327 transitions, 908 flow [2025-03-15 01:03:06,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:06,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:06,111 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:06,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:03:06,111 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:06,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1797173904, now seen corresponding path program 1 times [2025-03-15 01:03:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:06,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526129435] [2025-03-15 01:03:06,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:06,163 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:03:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526129435] [2025-03-15 01:03:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526129435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098750938] [2025-03-15 01:03:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:06,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:06,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:06,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:06,165 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 429 [2025-03-15 01:03:06,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 327 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:06,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:06,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 429 [2025-03-15 01:03:06,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:06,466 INFO L124 PetriNetUnfolderBase]: 595/1586 cut-off events. [2025-03-15 01:03:06,467 INFO L125 PetriNetUnfolderBase]: For 2261/2917 co-relation queries the response was YES. [2025-03-15 01:03:06,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 1586 events. 595/1586 cut-off events. For 2261/2917 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8294 event pairs, 228 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 5128. Up to 814 conditions per place. [2025-03-15 01:03:06,479 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 37 selfloop transitions, 2 changer transitions 16/341 dead transitions. [2025-03-15 01:03:06,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 341 transitions, 1147 flow [2025-03-15 01:03:06,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-15 01:03:06,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7653457653457654 [2025-03-15 01:03:06,482 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -85 predicate places. [2025-03-15 01:03:06,483 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 341 transitions, 1147 flow [2025-03-15 01:03:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:06,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:06,483 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] [2025-03-15 01:03:06,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:03:06,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:06,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:06,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2075094392, now seen corresponding path program 1 times [2025-03-15 01:03:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:06,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735492031] [2025-03-15 01:03:06,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:06,519 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:03:06,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:06,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735492031] [2025-03-15 01:03:06,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735492031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:06,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:06,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114171499] [2025-03-15 01:03:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:06,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:06,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:06,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:06,521 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-03-15 01:03:06,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 341 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:06,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:06,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-03-15 01:03:06,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:06,835 INFO L124 PetriNetUnfolderBase]: 595/1572 cut-off events. [2025-03-15 01:03:06,835 INFO L125 PetriNetUnfolderBase]: For 2963/3713 co-relation queries the response was YES. [2025-03-15 01:03:06,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 1572 events. 595/1572 cut-off events. For 2963/3713 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 8020 event pairs, 171 based on Foata normal form. 0/1404 useless extension candidates. Maximal degree in co-relation 5871. Up to 814 conditions per place. [2025-03-15 01:03:06,849 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 38 selfloop transitions, 2 changer transitions 16/340 dead transitions. [2025-03-15 01:03:06,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 340 transitions, 1225 flow [2025-03-15 01:03:06,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:06,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 01:03:06,852 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-03-15 01:03:06,854 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -84 predicate places. [2025-03-15 01:03:06,854 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 340 transitions, 1225 flow [2025-03-15 01:03:06,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:06,855 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:06,855 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] [2025-03-15 01:03:06,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:03:06,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:06,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1823238209, now seen corresponding path program 1 times [2025-03-15 01:03:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999357853] [2025-03-15 01:03:06,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:06,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999357853] [2025-03-15 01:03:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999357853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:06,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110743011] [2025-03-15 01:03:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:06,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:06,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:06,895 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 429 [2025-03-15 01:03:06,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 340 transitions, 1225 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:06,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:06,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 429 [2025-03-15 01:03:06,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:07,226 INFO L124 PetriNetUnfolderBase]: 595/1584 cut-off events. [2025-03-15 01:03:07,226 INFO L125 PetriNetUnfolderBase]: For 4374/5448 co-relation queries the response was YES. [2025-03-15 01:03:07,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 1584 events. 595/1584 cut-off events. For 4374/5448 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8329 event pairs, 228 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 6640. Up to 814 conditions per place. [2025-03-15 01:03:07,239 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 41 selfloop transitions, 2 changer transitions 16/339 dead transitions. [2025-03-15 01:03:07,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 339 transitions, 1309 flow [2025-03-15 01:03:07,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-15 01:03:07,241 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2025-03-15 01:03:07,242 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -83 predicate places. [2025-03-15 01:03:07,242 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 339 transitions, 1309 flow [2025-03-15 01:03:07,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:03:07,242 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:07,242 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:07,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:03:07,242 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:07,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:07,243 INFO L85 PathProgramCache]: Analyzing trace with hash 272772034, now seen corresponding path program 1 times [2025-03-15 01:03:07,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:07,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 01:03:07,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:07,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:07,282 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:03:07,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:07,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 01:03:07,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425770293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:07,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:07,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147007735] [2025-03-15 01:03:07,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:07,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:07,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:07,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:07,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:07,284 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 429 [2025-03-15 01:03:07,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 339 transitions, 1309 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:07,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:07,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 429 [2025-03-15 01:03:07,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:07,628 INFO L124 PetriNetUnfolderBase]: 749/1947 cut-off events. [2025-03-15 01:03:07,629 INFO L125 PetriNetUnfolderBase]: For 6652/8008 co-relation queries the response was YES. [2025-03-15 01:03:07,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 1947 events. 749/1947 cut-off events. For 6652/8008 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10990 event pairs, 156 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 9372. Up to 1024 conditions per place. [2025-03-15 01:03:07,648 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 62 selfloop transitions, 3 changer transitions 16/364 dead transitions. [2025-03-15 01:03:07,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 364 transitions, 1875 flow [2025-03-15 01:03:07,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2025-03-15 01:03:07,651 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7645687645687645 [2025-03-15 01:03:07,653 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -82 predicate places. [2025-03-15 01:03:07,654 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 364 transitions, 1875 flow [2025-03-15 01:03:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:07,654 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:07,654 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:07,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:03:07,655 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:07,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:07,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1953853022, now seen corresponding path program 1 times [2025-03-15 01:03:07,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:07,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413764580] [2025-03-15 01:03:07,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:07,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:07,704 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:03:07,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:07,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413764580] [2025-03-15 01:03:07,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413764580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:07,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:07,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:07,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166075823] [2025-03-15 01:03:07,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:07,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:07,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:07,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:07,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:07,706 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-03-15 01:03:07,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 364 transitions, 1875 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:07,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:07,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-03-15 01:03:07,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:08,030 INFO L124 PetriNetUnfolderBase]: 749/1946 cut-off events. [2025-03-15 01:03:08,031 INFO L125 PetriNetUnfolderBase]: For 8434/10048 co-relation queries the response was YES. [2025-03-15 01:03:08,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11319 conditions, 1946 events. 749/1946 cut-off events. For 8434/10048 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10946 event pairs, 156 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 10332. Up to 1024 conditions per place. [2025-03-15 01:03:08,055 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 64 selfloop transitions, 2 changer transitions 16/363 dead transitions. [2025-03-15 01:03:08,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 363 transitions, 2005 flow [2025-03-15 01:03:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:08,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 01:03:08,057 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-03-15 01:03:08,058 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -81 predicate places. [2025-03-15 01:03:08,058 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 363 transitions, 2005 flow [2025-03-15 01:03:08,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:08,058 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:08,058 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] [2025-03-15 01:03:08,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:03:08,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:08,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1836510315, now seen corresponding path program 1 times [2025-03-15 01:03:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262280770] [2025-03-15 01:03:08,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:08,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:08,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262280770] [2025-03-15 01:03:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262280770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:08,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281593960] [2025-03-15 01:03:08,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:08,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:08,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:08,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:08,093 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 429 [2025-03-15 01:03:08,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 363 transitions, 2005 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:08,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:08,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 429 [2025-03-15 01:03:08,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:08,371 INFO L124 PetriNetUnfolderBase]: 749/1892 cut-off events. [2025-03-15 01:03:08,371 INFO L125 PetriNetUnfolderBase]: For 9226/11012 co-relation queries the response was YES. [2025-03-15 01:03:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 1892 events. 749/1892 cut-off events. For 9226/11012 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10270 event pairs, 121 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 11239. Up to 1024 conditions per place. [2025-03-15 01:03:08,390 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 64 selfloop transitions, 1 changer transitions 16/362 dead transitions. [2025-03-15 01:03:08,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 362 transitions, 2131 flow [2025-03-15 01:03:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:08,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-15 01:03:08,392 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7536907536907537 [2025-03-15 01:03:08,392 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -80 predicate places. [2025-03-15 01:03:08,392 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 362 transitions, 2131 flow [2025-03-15 01:03:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:08,393 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:08,393 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:08,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:03:08,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:08,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:08,394 INFO L85 PathProgramCache]: Analyzing trace with hash 897716444, now seen corresponding path program 1 times [2025-03-15 01:03:08,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124264825] [2025-03-15 01:03:08,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:08,884 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:03:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124264825] [2025-03-15 01:03:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124264825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:03:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575377302] [2025-03-15 01:03:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:03:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:08,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:03:08,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:03:08,890 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 429 [2025-03-15 01:03:08,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 362 transitions, 2131 flow. Second operand has 6 states, 6 states have (on average 265.8333333333333) internal successors, (1595), 6 states have internal predecessors, (1595), 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:03:08,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:08,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 429 [2025-03-15 01:03:08,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:09,365 INFO L124 PetriNetUnfolderBase]: 749/1942 cut-off events. [2025-03-15 01:03:09,365 INFO L125 PetriNetUnfolderBase]: For 12674/14844 co-relation queries the response was YES. [2025-03-15 01:03:09,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 1942 events. 749/1942 cut-off events. For 12674/14844 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10897 event pairs, 156 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 12252. Up to 1054 conditions per place. [2025-03-15 01:03:09,382 INFO L140 encePairwiseOnDemand]: 411/429 looper letters, 100 selfloop transitions, 15 changer transitions 16/359 dead transitions. [2025-03-15 01:03:09,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 359 transitions, 2355 flow [2025-03-15 01:03:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:03:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:03:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1661 transitions. [2025-03-15 01:03:09,386 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6452991452991453 [2025-03-15 01:03:09,387 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -78 predicate places. [2025-03-15 01:03:09,387 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 359 transitions, 2355 flow [2025-03-15 01:03:09,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 265.8333333333333) internal successors, (1595), 6 states have internal predecessors, (1595), 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:03:09,388 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:09,388 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:09,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:03:09,388 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:09,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1796726052, now seen corresponding path program 1 times [2025-03-15 01:03:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:09,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220574101] [2025-03-15 01:03:09,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:09,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:09,425 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:03:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220574101] [2025-03-15 01:03:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220574101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831083357] [2025-03-15 01:03:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:09,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:09,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:09,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:09,427 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-03-15 01:03:09,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 359 transitions, 2355 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:09,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:09,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-03-15 01:03:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:09,729 INFO L124 PetriNetUnfolderBase]: 749/1941 cut-off events. [2025-03-15 01:03:09,729 INFO L125 PetriNetUnfolderBase]: For 15144/17592 co-relation queries the response was YES. [2025-03-15 01:03:09,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14421 conditions, 1941 events. 749/1941 cut-off events. For 15144/17592 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10894 event pairs, 156 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 13212. Up to 1054 conditions per place. [2025-03-15 01:03:09,744 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 64 selfloop transitions, 2 changer transitions 16/358 dead transitions. [2025-03-15 01:03:09,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 358 transitions, 2485 flow [2025-03-15 01:03:09,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 01:03:09,746 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-03-15 01:03:09,747 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -77 predicate places. [2025-03-15 01:03:09,747 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 358 transitions, 2485 flow [2025-03-15 01:03:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:09,747 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:09,747 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:09,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:03:09,748 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:09,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash -803443091, now seen corresponding path program 1 times [2025-03-15 01:03:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:09,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759192029] [2025-03-15 01:03:09,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:09,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:09,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759192029] [2025-03-15 01:03:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759192029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:09,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753791441] [2025-03-15 01:03:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:09,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:09,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:09,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:09,778 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 429 [2025-03-15 01:03:09,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 358 transitions, 2485 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:09,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:09,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 429 [2025-03-15 01:03:09,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:10,060 INFO L124 PetriNetUnfolderBase]: 749/1887 cut-off events. [2025-03-15 01:03:10,060 INFO L125 PetriNetUnfolderBase]: For 15765/18355 co-relation queries the response was YES. [2025-03-15 01:03:10,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15385 conditions, 1887 events. 749/1887 cut-off events. For 15765/18355 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10238 event pairs, 121 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 14119. Up to 1054 conditions per place. [2025-03-15 01:03:10,083 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 64 selfloop transitions, 1 changer transitions 16/357 dead transitions. [2025-03-15 01:03:10,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 357 transitions, 2611 flow [2025-03-15 01:03:10,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-15 01:03:10,085 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7536907536907537 [2025-03-15 01:03:10,086 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -76 predicate places. [2025-03-15 01:03:10,086 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 357 transitions, 2611 flow [2025-03-15 01:03:10,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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:03:10,086 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:10,086 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:03:10,087 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash 803785191, now seen corresponding path program 1 times [2025-03-15 01:03:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988501922] [2025-03-15 01:03:10,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:10,129 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:03:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988501922] [2025-03-15 01:03:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988501922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263777364] [2025-03-15 01:03:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:10,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:10,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:10,132 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-03-15 01:03:10,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 357 transitions, 2611 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:10,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:10,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-03-15 01:03:10,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:10,446 INFO L124 PetriNetUnfolderBase]: 749/1939 cut-off events. [2025-03-15 01:03:10,446 INFO L125 PetriNetUnfolderBase]: For 20766/23770 co-relation queries the response was YES. [2025-03-15 01:03:10,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 1939 events. 749/1939 cut-off events. For 20766/23770 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10871 event pairs, 156 based on Foata normal form. 0/1748 useless extension candidates. Maximal degree in co-relation 15132. Up to 1054 conditions per place. [2025-03-15 01:03:10,466 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 64 selfloop transitions, 2 changer transitions 16/356 dead transitions. [2025-03-15 01:03:10,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 356 transitions, 2741 flow [2025-03-15 01:03:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 01:03:10,468 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-03-15 01:03:10,469 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -75 predicate places. [2025-03-15 01:03:10,469 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 356 transitions, 2741 flow [2025-03-15 01:03:10,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:10,469 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:10,469 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:10,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:03:10,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:10,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 489257700, now seen corresponding path program 1 times [2025-03-15 01:03:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828363373] [2025-03-15 01:03:10,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:10,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:10,517 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:03:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828363373] [2025-03-15 01:03:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828363373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038812959] [2025-03-15 01:03:10,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:10,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:10,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:10,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:10,519 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 429 [2025-03-15 01:03:10,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 356 transitions, 2741 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:03:10,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:10,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 429 [2025-03-15 01:03:10,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:10,835 INFO L124 PetriNetUnfolderBase]: 749/1884 cut-off events. [2025-03-15 01:03:10,836 INFO L125 PetriNetUnfolderBase]: For 21154/24280 co-relation queries the response was YES. [2025-03-15 01:03:10,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17421 conditions, 1884 events. 749/1884 cut-off events. For 21154/24280 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10171 event pairs, 121 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 16039. Up to 1054 conditions per place. [2025-03-15 01:03:10,857 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 66 selfloop transitions, 1 changer transitions 16/354 dead transitions. [2025-03-15 01:03:10,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 354 transitions, 2867 flow [2025-03-15 01:03:10,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-15 01:03:10,859 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.749028749028749 [2025-03-15 01:03:10,860 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -75 predicate places. [2025-03-15 01:03:10,860 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 354 transitions, 2867 flow [2025-03-15 01:03:10,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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:03:10,860 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:10,860 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:10,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:03:10,861 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:10,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:10,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1452778784, now seen corresponding path program 1 times [2025-03-15 01:03:10,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:10,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283121652] [2025-03-15 01:03:10,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:10,902 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:03:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283121652] [2025-03-15 01:03:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283121652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:10,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:10,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309079642] [2025-03-15 01:03:10,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:10,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:10,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:10,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:10,904 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 429 [2025-03-15 01:03:10,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 354 transitions, 2867 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:10,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:10,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 429 [2025-03-15 01:03:10,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:11,234 INFO L124 PetriNetUnfolderBase]: 749/1883 cut-off events. [2025-03-15 01:03:11,235 INFO L125 PetriNetUnfolderBase]: For 24160/27554 co-relation queries the response was YES. [2025-03-15 01:03:11,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18440 conditions, 1883 events. 749/1883 cut-off events. For 24160/27554 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10206 event pairs, 121 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 16999. Up to 1054 conditions per place. [2025-03-15 01:03:11,256 INFO L140 encePairwiseOnDemand]: 426/429 looper letters, 64 selfloop transitions, 2 changer transitions 16/353 dead transitions. [2025-03-15 01:03:11,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 353 transitions, 2997 flow [2025-03-15 01:03:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-15 01:03:11,258 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2025-03-15 01:03:11,258 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -74 predicate places. [2025-03-15 01:03:11,258 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 353 transitions, 2997 flow [2025-03-15 01:03:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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:03:11,259 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:11,259 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:11,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:03:11,259 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 178 more)] === [2025-03-15 01:03:11,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1495518458, now seen corresponding path program 1 times [2025-03-15 01:03:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723904395] [2025-03-15 01:03:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:11,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:11,347 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:03:11,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:11,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723904395] [2025-03-15 01:03:11,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723904395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:11,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708046460] [2025-03-15 01:03:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:11,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:11,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:11,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:11,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 429 [2025-03-15 01:03:11,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 353 transitions, 2997 flow. Second operand has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:03:11,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:11,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 429 [2025-03-15 01:03:11,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:11,739 INFO L124 PetriNetUnfolderBase]: 749/1879 cut-off events. [2025-03-15 01:03:11,739 INFO L125 PetriNetUnfolderBase]: For 27362/31024 co-relation queries the response was YES. [2025-03-15 01:03:11,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 1879 events. 749/1879 cut-off events. For 27362/31024 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10188 event pairs, 121 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 17959. Up to 1054 conditions per place. [2025-03-15 01:03:11,754 INFO L140 encePairwiseOnDemand]: 427/429 looper letters, 0 selfloop transitions, 0 changer transitions 352/352 dead transitions. [2025-03-15 01:03:11,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 352 transitions, 3121 flow [2025-03-15 01:03:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 977 transitions. [2025-03-15 01:03:11,757 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7591297591297591 [2025-03-15 01:03:11,757 INFO L298 CegarLoopForPetriNet]: 427 programPoint places, -73 predicate places. [2025-03-15 01:03:11,757 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 352 transitions, 3121 flow [2025-03-15 01:03:11,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.6666666666667) internal successors, (968), 3 states have internal predecessors, (968), 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:03:11,773 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-series2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:03:11,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (181 of 182 remaining) [2025-03-15 01:03:11,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (180 of 182 remaining) [2025-03-15 01:03:11,814 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (179 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (178 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (177 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (176 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (175 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (174 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (173 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (172 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (171 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (170 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (169 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (168 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (167 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (166 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (165 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (164 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (163 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (162 of 182 remaining) [2025-03-15 01:03:11,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (161 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (160 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (159 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (158 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (157 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (156 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (155 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (154 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (153 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (152 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (151 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (150 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (149 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (148 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (147 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (146 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (145 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (144 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (143 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (142 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (141 of 182 remaining) [2025-03-15 01:03:11,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (140 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (139 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (138 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (137 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (136 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (135 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (134 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (133 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (132 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (131 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (130 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (129 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (128 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (127 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (126 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (125 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (124 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (123 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (122 of 182 remaining) [2025-03-15 01:03:11,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (121 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (120 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (119 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (118 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (117 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (116 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (115 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (114 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (113 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (112 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (111 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (110 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (109 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (108 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (107 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (104 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (103 of 182 remaining) [2025-03-15 01:03:11,818 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (98 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (97 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (96 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (95 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (94 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (93 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (92 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (91 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (90 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (89 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (88 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (87 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (86 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (85 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (84 of 182 remaining) [2025-03-15 01:03:11,819 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (83 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (82 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (81 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (80 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (79 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 182 remaining) [2025-03-15 01:03:11,820 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (61 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (60 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (59 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (58 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (55 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (54 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (53 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (52 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (51 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (49 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (48 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (47 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (46 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (45 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (44 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (43 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (42 of 182 remaining) [2025-03-15 01:03:11,821 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (41 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (40 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 182 remaining) [2025-03-15 01:03:11,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 182 remaining) [2025-03-15 01:03:11,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 182 remaining) [2025-03-15 01:03:11,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:03:11,824 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:11,828 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:03:11,829 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:03:11,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:03:11 BasicIcfg [2025-03-15 01:03:11,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:03:11,834 INFO L158 Benchmark]: Toolchain (without parser) took 9534.88ms. Allocated memory was 71.3MB in the beginning and 755.0MB in the end (delta: 683.7MB). Free memory was 44.4MB in the beginning and 400.3MB in the end (delta: -355.8MB). Peak memory consumption was 325.0MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: CDTParser took 1.34ms. Allocated memory is still 71.3MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.84ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 29.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.37ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 25.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: Boogie Preprocessor took 59.65ms. Allocated memory is still 71.3MB. Free memory was 25.9MB in the beginning and 22.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: RCFGBuilder took 1446.58ms. Allocated memory was 71.3MB in the beginning and 155.2MB in the end (delta: 83.9MB). Free memory was 22.5MB in the beginning and 86.3MB in the end (delta: -63.8MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,835 INFO L158 Benchmark]: TraceAbstraction took 7688.32ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 85.7MB in the beginning and 400.3MB in the end (delta: -314.6MB). Peak memory consumption was 280.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:11,836 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.34ms. Allocated memory is still 71.3MB. Free memory is still 37.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.84ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 29.9MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.37ms. Allocated memory is still 71.3MB. Free memory was 29.9MB in the beginning and 25.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.65ms. Allocated memory is still 71.3MB. Free memory was 25.9MB in the beginning and 22.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1446.58ms. Allocated memory was 71.3MB in the beginning and 155.2MB in the end (delta: 83.9MB). Free memory was 22.5MB in the beginning and 86.3MB in the end (delta: -63.8MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7688.32ms. Allocated memory was 155.2MB in the beginning and 755.0MB in the end (delta: 599.8MB). Free memory was 85.7MB in the beginning and 400.3MB in the end (delta: -314.6MB). Peak memory consumption was 280.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 530 locations, 182 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: 7.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 111 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 747 IncrementalHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 117 mSDtfsCounter, 747 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3121occurred in iteration=17, InterpolantAutomatonStates: 54, 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, 1.0s InterpolantComputationTime, 1646 NumberOfCodeBlocks, 1646 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1629 ConstructedInterpolants, 0 QuantifiedInterpolants, 1776 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 99 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:03:11,855 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...