/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-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:04:59,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:04:59,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:04:59,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:04:59,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:04:59,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:04:59,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:04:59,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:04:59,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:04:59,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:04:59,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:04:59,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:04:59,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:04:59,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:59,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:04:59,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:04:59,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:04:59,674 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:04:59,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:04:59,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 01:04:59,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:04:59,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:04:59,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:04:59,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:04:59,923 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:04:59,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2025-03-15 01:05:01,097 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e92b187d/b27d1d9f78284508b8d4d09e7c46471b/FLAG4f752d7de [2025-03-15 01:05:01,319 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:05:01,319 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2025-03-15 01:05:01,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e92b187d/b27d1d9f78284508b8d4d09e7c46471b/FLAG4f752d7de [2025-03-15 01:05:01,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e92b187d/b27d1d9f78284508b8d4d09e7c46471b [2025-03-15 01:05:01,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:05:01,686 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:05:01,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:05:01,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:05:01,689 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:05:01,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e0f6f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01, skipping insertion in model container [2025-03-15 01:05:01,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:05:01,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:05:01,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:05:01,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:05:01,881 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:05:01,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01 WrapperNode [2025-03-15 01:05:01,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:05:01,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:05:01,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:05:01,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:05:01,887 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:05:01" (1/1) ... [2025-03-15 01:05:01,893 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:05:01" (1/1) ... [2025-03-15 01:05:01,927 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 402 [2025-03-15 01:05:01,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:05:01,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:05:01,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:05:01,928 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:05:01,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:05:01,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:05:01,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:05:01,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:05:01,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (1/1) ... [2025-03-15 01:05:01,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:05:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:05:01,989 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:05:01,991 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:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:05:02,007 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:05:02,007 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:05:02,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:05:02,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:05:02,008 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:05:02,081 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:05:02,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:05:02,601 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:05:02,601 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:05:02,893 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:05:02,893 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:05:02,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:05:02 BoogieIcfgContainer [2025-03-15 01:05:02,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:05:02,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:05:02,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:05:02,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:05:02,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:05:01" (1/3) ... [2025-03-15 01:05:02,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d1c3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:05:02, skipping insertion in model container [2025-03-15 01:05:02,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:05:01" (2/3) ... [2025-03-15 01:05:02,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d1c3db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:05:02, skipping insertion in model container [2025-03-15 01:05:02,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:05:02" (3/3) ... [2025-03-15 01:05:02,902 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-15 01:05:02,916 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:05:02,918 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 314 locations, 1 initial locations, 4 loop locations, and 65 error locations. [2025-03-15 01:05:02,918 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:05:02,997 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:05:03,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:05:03,050 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;@6c9499be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:05:03,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2025-03-15 01:05:03,073 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:05:03,073 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-15 01:05:03,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:05:03,075 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,075 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] [2025-03-15 01:05:03,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -273408375, now seen corresponding path program 1 times [2025-03-15 01:05:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37371285] [2025-03-15 01:05:03,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,238 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:05:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37371285] [2025-03-15 01:05:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37371285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627391722] [2025-03-15 01:05:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,268 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 324 [2025-03-15 01:05:03,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 324 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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:05:03,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 324 [2025-03-15 01:05:03,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,434 INFO L124 PetriNetUnfolderBase]: 51/493 cut-off events. [2025-03-15 01:05:03,434 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-15 01:05:03,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 493 events. 51/493 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1637 event pairs, 35 based on Foata normal form. 28/435 useless extension candidates. Maximal degree in co-relation 347. Up to 100 conditions per place. [2025-03-15 01:05:03,440 INFO L140 encePairwiseOnDemand]: 273/324 looper letters, 17 selfloop transitions, 2 changer transitions 13/267 dead transitions. [2025-03-15 01:05:03,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 267 transitions, 584 flow [2025-03-15 01:05:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2025-03-15 01:05:03,453 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8569958847736625 [2025-03-15 01:05:03,457 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -48 predicate places. [2025-03-15 01:05:03,457 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 267 transitions, 584 flow [2025-03-15 01:05:03,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 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:05:03,457 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,458 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] [2025-03-15 01:05:03,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:05:03,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:03,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,459 INFO L85 PathProgramCache]: Analyzing trace with hash 460612242, now seen corresponding path program 1 times [2025-03-15 01:05:03,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010078105] [2025-03-15 01:05:03,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,494 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:05:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010078105] [2025-03-15 01:05:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010078105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924252128] [2025-03-15 01:05:03,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,497 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-15 01:05:03,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 267 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-15 01:05:03,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,583 INFO L124 PetriNetUnfolderBase]: 51/492 cut-off events. [2025-03-15 01:05:03,584 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-15 01:05:03,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 492 events. 51/492 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1635 event pairs, 35 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 379. Up to 100 conditions per place. [2025-03-15 01:05:03,586 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 14 selfloop transitions, 2 changer transitions 13/266 dead transitions. [2025-03-15 01:05:03,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 266 transitions, 614 flow [2025-03-15 01:05:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:03,588 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:03,588 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -47 predicate places. [2025-03-15 01:05:03,588 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 266 transitions, 614 flow [2025-03-15 01:05:03,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,589 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,589 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] [2025-03-15 01:05:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:05:03,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1433426722, now seen corresponding path program 1 times [2025-03-15 01:05:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637601612] [2025-03-15 01:05:03,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,650 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:05:03,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637601612] [2025-03-15 01:05:03,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637601612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433055004] [2025-03-15 01:05:03,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,653 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-15 01:05:03,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 266 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-15 01:05:03,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,730 INFO L124 PetriNetUnfolderBase]: 51/491 cut-off events. [2025-03-15 01:05:03,730 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-03-15 01:05:03,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 491 events. 51/491 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1635 event pairs, 35 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 411. Up to 100 conditions per place. [2025-03-15 01:05:03,733 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 14 selfloop transitions, 2 changer transitions 13/265 dead transitions. [2025-03-15 01:05:03,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 265 transitions, 644 flow [2025-03-15 01:05:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:03,735 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:03,735 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -46 predicate places. [2025-03-15 01:05:03,735 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 265 transitions, 644 flow [2025-03-15 01:05:03,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,736 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,736 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] [2025-03-15 01:05:03,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:05:03,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:03,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash -221902772, now seen corresponding path program 1 times [2025-03-15 01:05:03,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686079250] [2025-03-15 01:05:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,806 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:05:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686079250] [2025-03-15 01:05:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686079250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464062373] [2025-03-15 01:05:03,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,811 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-15 01:05:03,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 265 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-15 01:05:03,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:03,904 INFO L124 PetriNetUnfolderBase]: 51/490 cut-off events. [2025-03-15 01:05:03,904 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2025-03-15 01:05:03,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 490 events. 51/490 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1629 event pairs, 35 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 443. Up to 100 conditions per place. [2025-03-15 01:05:03,908 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 14 selfloop transitions, 2 changer transitions 13/264 dead transitions. [2025-03-15 01:05:03,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 264 transitions, 674 flow [2025-03-15 01:05:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:03,910 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:03,912 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -45 predicate places. [2025-03-15 01:05:03,912 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 264 transitions, 674 flow [2025-03-15 01:05:03,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:03,913 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:03,913 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:05:03,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:05:03,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:03,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1764283819, now seen corresponding path program 1 times [2025-03-15 01:05:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119972289] [2025-03-15 01:05:03,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:03,955 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:05:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119972289] [2025-03-15 01:05:03,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119972289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:03,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:03,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:03,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146351516] [2025-03-15 01:05:03,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:03,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:03,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:03,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:03,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:03,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 324 [2025-03-15 01:05:03,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 264 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:03,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:03,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 324 [2025-03-15 01:05:03,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,083 INFO L124 PetriNetUnfolderBase]: 85/630 cut-off events. [2025-03-15 01:05:04,083 INFO L125 PetriNetUnfolderBase]: For 655/655 co-relation queries the response was YES. [2025-03-15 01:05:04,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 630 events. 85/630 cut-off events. For 655/655 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2541 event pairs, 47 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 757. Up to 170 conditions per place. [2025-03-15 01:05:04,088 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 17 selfloop transitions, 2 changer transitions 13/270 dead transitions. [2025-03-15 01:05:04,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 270 transitions, 787 flow [2025-03-15 01:05:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 806 transitions. [2025-03-15 01:05:04,090 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8292181069958847 [2025-03-15 01:05:04,091 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -44 predicate places. [2025-03-15 01:05:04,091 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 270 transitions, 787 flow [2025-03-15 01:05:04,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:04,091 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,092 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:05:04,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:05:04,092 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1442178002, now seen corresponding path program 1 times [2025-03-15 01:05:04,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120396509] [2025-03-15 01:05:04,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,130 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:05:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120396509] [2025-03-15 01:05:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120396509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755785462] [2025-03-15 01:05:04,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,133 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-15 01:05:04,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 270 transitions, 787 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:04,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-15 01:05:04,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,225 INFO L124 PetriNetUnfolderBase]: 85/629 cut-off events. [2025-03-15 01:05:04,226 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2025-03-15 01:05:04,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 629 events. 85/629 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2553 event pairs, 47 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 817. Up to 170 conditions per place. [2025-03-15 01:05:04,230 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 18 selfloop transitions, 2 changer transitions 13/269 dead transitions. [2025-03-15 01:05:04,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 269 transitions, 825 flow [2025-03-15 01:05:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2025-03-15 01:05:04,231 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8199588477366255 [2025-03-15 01:05:04,233 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -43 predicate places. [2025-03-15 01:05:04,233 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 825 flow [2025-03-15 01:05:04,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:04,234 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,234 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:05:04,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:05:04,234 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -871994941, now seen corresponding path program 1 times [2025-03-15 01:05:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431253203] [2025-03-15 01:05:04,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,281 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:05:04,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431253203] [2025-03-15 01:05:04,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431253203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081594821] [2025-03-15 01:05:04,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,283 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 324 [2025-03-15 01:05:04,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 825 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:04,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 324 [2025-03-15 01:05:04,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,376 INFO L124 PetriNetUnfolderBase]: 85/628 cut-off events. [2025-03-15 01:05:04,376 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2025-03-15 01:05:04,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 628 events. 85/628 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2551 event pairs, 47 based on Foata normal form. 0/518 useless extension candidates. Maximal degree in co-relation 877. Up to 170 conditions per place. [2025-03-15 01:05:04,381 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 21 selfloop transitions, 2 changer transitions 13/268 dead transitions. [2025-03-15 01:05:04,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 869 flow [2025-03-15 01:05:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:04,384 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:04,385 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -42 predicate places. [2025-03-15 01:05:04,385 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 268 transitions, 869 flow [2025-03-15 01:05:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:05:04,385 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,385 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:05:04,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:05:04,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 764786027, now seen corresponding path program 1 times [2025-03-15 01:05:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726028765] [2025-03-15 01:05:04,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,426 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:05:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726028765] [2025-03-15 01:05:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726028765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081902302] [2025-03-15 01:05:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,428 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 324 [2025-03-15 01:05:04,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 268 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:04,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 324 [2025-03-15 01:05:04,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,544 INFO L124 PetriNetUnfolderBase]: 133/871 cut-off events. [2025-03-15 01:05:04,544 INFO L125 PetriNetUnfolderBase]: For 2583/2597 co-relation queries the response was YES. [2025-03-15 01:05:04,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 871 events. 133/871 cut-off events. For 2583/2597 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4173 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1592. Up to 269 conditions per place. [2025-03-15 01:05:04,549 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 28 selfloop transitions, 3 changer transitions 13/279 dead transitions. [2025-03-15 01:05:04,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 279 transitions, 1131 flow [2025-03-15 01:05:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 805 transitions. [2025-03-15 01:05:04,551 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8281893004115226 [2025-03-15 01:05:04,551 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -41 predicate places. [2025-03-15 01:05:04,551 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 1131 flow [2025-03-15 01:05:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:04,552 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,552 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:05:04,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:05:04,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1505564131, now seen corresponding path program 1 times [2025-03-15 01:05:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590479383] [2025-03-15 01:05:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,604 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:05:04,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590479383] [2025-03-15 01:05:04,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590479383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412239523] [2025-03-15 01:05:04,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,606 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-15 01:05:04,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:04,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-15 01:05:04,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,738 INFO L124 PetriNetUnfolderBase]: 133/870 cut-off events. [2025-03-15 01:05:04,739 INFO L125 PetriNetUnfolderBase]: For 3244/3260 co-relation queries the response was YES. [2025-03-15 01:05:04,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 870 events. 133/870 cut-off events. For 3244/3260 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4188 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1700. Up to 269 conditions per place. [2025-03-15 01:05:04,744 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 13/278 dead transitions. [2025-03-15 01:05:04,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 1193 flow [2025-03-15 01:05:04,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2025-03-15 01:05:04,746 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8199588477366255 [2025-03-15 01:05:04,747 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -40 predicate places. [2025-03-15 01:05:04,747 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 1193 flow [2025-03-15 01:05:04,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:04,747 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,748 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] [2025-03-15 01:05:04,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:05:04,748 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -81226562, now seen corresponding path program 1 times [2025-03-15 01:05:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366517816] [2025-03-15 01:05:04,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,807 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:05:04,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366517816] [2025-03-15 01:05:04,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366517816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004271106] [2025-03-15 01:05:04,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,810 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 324 [2025-03-15 01:05:04,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:04,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 324 [2025-03-15 01:05:04,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:04,916 INFO L124 PetriNetUnfolderBase]: 133/869 cut-off events. [2025-03-15 01:05:04,916 INFO L125 PetriNetUnfolderBase]: For 3977/3997 co-relation queries the response was YES. [2025-03-15 01:05:04,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2392 conditions, 869 events. 133/869 cut-off events. For 3977/3997 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4176 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1808. Up to 269 conditions per place. [2025-03-15 01:05:04,922 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 30 selfloop transitions, 1 changer transitions 13/277 dead transitions. [2025-03-15 01:05:04,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 277 transitions, 1251 flow [2025-03-15 01:05:04,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-03-15 01:05:04,924 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8220164609053497 [2025-03-15 01:05:04,924 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -39 predicate places. [2025-03-15 01:05:04,924 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 277 transitions, 1251 flow [2025-03-15 01:05:04,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:04,925 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:04,925 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] [2025-03-15 01:05:04,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:05:04,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:04,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 757546078, now seen corresponding path program 1 times [2025-03-15 01:05:04,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:04,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741413256] [2025-03-15 01:05:04,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:04,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:04,979 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:05:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741413256] [2025-03-15 01:05:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741413256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:04,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126113984] [2025-03-15 01:05:04,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:04,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:04,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:04,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:04,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:04,982 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-15 01:05:04,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 277 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:04,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:04,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-15 01:05:04,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:05,115 INFO L124 PetriNetUnfolderBase]: 133/868 cut-off events. [2025-03-15 01:05:05,116 INFO L125 PetriNetUnfolderBase]: For 4793/4817 co-relation queries the response was YES. [2025-03-15 01:05:05,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 868 events. 133/868 cut-off events. For 4793/4817 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4182 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1916. Up to 269 conditions per place. [2025-03-15 01:05:05,121 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 13/276 dead transitions. [2025-03-15 01:05:05,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 1313 flow [2025-03-15 01:05:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2025-03-15 01:05:05,123 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8199588477366255 [2025-03-15 01:05:05,123 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -38 predicate places. [2025-03-15 01:05:05,123 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 1313 flow [2025-03-15 01:05:05,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:05,124 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:05,124 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] [2025-03-15 01:05:05,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:05:05,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:05,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash -216235236, now seen corresponding path program 1 times [2025-03-15 01:05:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:05,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306201229] [2025-03-15 01:05:05,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:05,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:05,578 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:05:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:05,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306201229] [2025-03-15 01:05:05,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306201229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:05,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:05:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661325807] [2025-03-15 01:05:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:05,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:05:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:05,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:05:05,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:05:05,580 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 324 [2025-03-15 01:05:05,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 1313 flow. Second operand has 6 states, 6 states have (on average 231.83333333333334) internal successors, (1391), 6 states have internal predecessors, (1391), 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:05:05,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:05,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 324 [2025-03-15 01:05:05,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:05,791 INFO L124 PetriNetUnfolderBase]: 133/866 cut-off events. [2025-03-15 01:05:05,791 INFO L125 PetriNetUnfolderBase]: For 5679/5707 co-relation queries the response was YES. [2025-03-15 01:05:05,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 866 events. 133/866 cut-off events. For 5679/5707 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4159 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 2024. Up to 269 conditions per place. [2025-03-15 01:05:05,797 INFO L140 encePairwiseOnDemand]: 312/324 looper letters, 53 selfloop transitions, 10 changer transitions 13/274 dead transitions. [2025-03-15 01:05:05,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 274 transitions, 1435 flow [2025-03-15 01:05:05,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:05:05,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:05:05,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-15 01:05:05,800 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7335390946502057 [2025-03-15 01:05:05,800 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -35 predicate places. [2025-03-15 01:05:05,800 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 274 transitions, 1435 flow [2025-03-15 01:05:05,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.83333333333334) internal successors, (1391), 6 states have internal predecessors, (1391), 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:05:05,801 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:05,801 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:05:05,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:05:05,801 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1764499135, now seen corresponding path program 1 times [2025-03-15 01:05:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:05,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021554753] [2025-03-15 01:05:05,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:05,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:05,832 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:05:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021554753] [2025-03-15 01:05:05,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021554753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:05,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042424037] [2025-03-15 01:05:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:05,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:05,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:05,834 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 324 [2025-03-15 01:05:05,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 274 transitions, 1435 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:05,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:05,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 324 [2025-03-15 01:05:05,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:05,957 INFO L124 PetriNetUnfolderBase]: 133/865 cut-off events. [2025-03-15 01:05:05,957 INFO L125 PetriNetUnfolderBase]: For 6643/6675 co-relation queries the response was YES. [2025-03-15 01:05:05,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 865 events. 133/865 cut-off events. For 6643/6675 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4197 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 2132. Up to 269 conditions per place. [2025-03-15 01:05:05,963 INFO L140 encePairwiseOnDemand]: 322/324 looper letters, 30 selfloop transitions, 1 changer transitions 13/273 dead transitions. [2025-03-15 01:05:05,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 273 transitions, 1493 flow [2025-03-15 01:05:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 799 transitions. [2025-03-15 01:05:05,965 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8220164609053497 [2025-03-15 01:05:05,965 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -34 predicate places. [2025-03-15 01:05:05,965 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 273 transitions, 1493 flow [2025-03-15 01:05:05,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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:05:05,966 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:05,966 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] [2025-03-15 01:05:05,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:05:05,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:05,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:05,967 INFO L85 PathProgramCache]: Analyzing trace with hash -571081491, now seen corresponding path program 1 times [2025-03-15 01:05:05,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:05,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693934179] [2025-03-15 01:05:05,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:05,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:05:06,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693934179] [2025-03-15 01:05:06,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693934179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632648349] [2025-03-15 01:05:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,011 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 324 [2025-03-15 01:05:06,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 273 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:06,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 324 [2025-03-15 01:05:06,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:06,152 INFO L124 PetriNetUnfolderBase]: 133/864 cut-off events. [2025-03-15 01:05:06,152 INFO L125 PetriNetUnfolderBase]: For 7691/7727 co-relation queries the response was YES. [2025-03-15 01:05:06,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 864 events. 133/864 cut-off events. For 7691/7727 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4188 event pairs, 72 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 2240. Up to 269 conditions per place. [2025-03-15 01:05:06,159 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 30 selfloop transitions, 2 changer transitions 13/272 dead transitions. [2025-03-15 01:05:06,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 272 transitions, 1555 flow [2025-03-15 01:05:06,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:06,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2025-03-15 01:05:06,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8199588477366255 [2025-03-15 01:05:06,161 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -33 predicate places. [2025-03-15 01:05:06,161 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 272 transitions, 1555 flow [2025-03-15 01:05:06,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:05:06,162 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:06,162 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] [2025-03-15 01:05:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:05:06,162 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash -173908509, now seen corresponding path program 1 times [2025-03-15 01:05:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799865817] [2025-03-15 01:05:06,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,219 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:05:06,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799865817] [2025-03-15 01:05:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799865817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339221220] [2025-03-15 01:05:06,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,221 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 324 [2025-03-15 01:05:06,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 272 transitions, 1555 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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:05:06,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 324 [2025-03-15 01:05:06,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:06,352 INFO L124 PetriNetUnfolderBase]: 178/889 cut-off events. [2025-03-15 01:05:06,352 INFO L125 PetriNetUnfolderBase]: For 15104/15120 co-relation queries the response was YES. [2025-03-15 01:05:06,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 889 events. 178/889 cut-off events. For 15104/15120 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4283 event pairs, 66 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 2960. Up to 323 conditions per place. [2025-03-15 01:05:06,358 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 39 selfloop transitions, 7 changer transitions 13/279 dead transitions. [2025-03-15 01:05:06,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 279 transitions, 1947 flow [2025-03-15 01:05:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:06,360 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:06,361 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -34 predicate places. [2025-03-15 01:05:06,361 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 279 transitions, 1947 flow [2025-03-15 01:05:06,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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:05:06,362 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:06,362 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] [2025-03-15 01:05:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:05:06,362 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 377692453, now seen corresponding path program 1 times [2025-03-15 01:05:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972787243] [2025-03-15 01:05:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,410 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:05:06,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972787243] [2025-03-15 01:05:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972787243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274635505] [2025-03-15 01:05:06,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,412 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 324 [2025-03-15 01:05:06,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 279 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:05:06,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 324 [2025-03-15 01:05:06,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:06,518 INFO L124 PetriNetUnfolderBase]: 136/860 cut-off events. [2025-03-15 01:05:06,518 INFO L125 PetriNetUnfolderBase]: For 13457/13510 co-relation queries the response was YES. [2025-03-15 01:05:06,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 860 events. 136/860 cut-off events. For 13457/13510 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4155 event pairs, 47 based on Foata normal form. 1/757 useless extension candidates. Maximal degree in co-relation 2747. Up to 242 conditions per place. [2025-03-15 01:05:06,524 INFO L140 encePairwiseOnDemand]: 320/324 looper letters, 44 selfloop transitions, 2 changer transitions 13/280 dead transitions. [2025-03-15 01:05:06,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 280 transitions, 2074 flow [2025-03-15 01:05:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions. [2025-03-15 01:05:06,526 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8189300411522634 [2025-03-15 01:05:06,526 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -34 predicate places. [2025-03-15 01:05:06,526 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 280 transitions, 2074 flow [2025-03-15 01:05:06,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:05:06,527 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:06,527 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] [2025-03-15 01:05:06,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:05:06,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:06,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:06,528 INFO L85 PathProgramCache]: Analyzing trace with hash 479515492, now seen corresponding path program 1 times [2025-03-15 01:05:06,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:06,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915645760] [2025-03-15 01:05:06,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,573 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:05:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915645760] [2025-03-15 01:05:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915645760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871727076] [2025-03-15 01:05:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,575 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 324 [2025-03-15 01:05:06,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 280 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:05:06,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 324 [2025-03-15 01:05:06,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:06,711 INFO L124 PetriNetUnfolderBase]: 190/934 cut-off events. [2025-03-15 01:05:06,711 INFO L125 PetriNetUnfolderBase]: For 27486/27686 co-relation queries the response was YES. [2025-03-15 01:05:06,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4967 conditions, 934 events. 190/934 cut-off events. For 27486/27686 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4747 event pairs, 48 based on Foata normal form. 5/850 useless extension candidates. Maximal degree in co-relation 3913. Up to 300 conditions per place. [2025-03-15 01:05:06,718 INFO L140 encePairwiseOnDemand]: 317/324 looper letters, 42 selfloop transitions, 11 changer transitions 20/289 dead transitions. [2025-03-15 01:05:06,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 289 transitions, 2606 flow [2025-03-15 01:05:06,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2025-03-15 01:05:06,719 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8137860082304527 [2025-03-15 01:05:06,720 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -35 predicate places. [2025-03-15 01:05:06,720 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 289 transitions, 2606 flow [2025-03-15 01:05:06,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:05:06,720 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:06,720 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] [2025-03-15 01:05:06,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:05:06,720 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:06,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1671051701, now seen corresponding path program 1 times [2025-03-15 01:05:06,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:06,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120995153] [2025-03-15 01:05:06,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:06,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,770 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:05:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120995153] [2025-03-15 01:05:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120995153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167302449] [2025-03-15 01:05:06,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,771 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 324 [2025-03-15 01:05:06,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 289 transitions, 2606 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:05:06,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 324 [2025-03-15 01:05:06,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:06,902 INFO L124 PetriNetUnfolderBase]: 195/866 cut-off events. [2025-03-15 01:05:06,903 INFO L125 PetriNetUnfolderBase]: For 32886/33228 co-relation queries the response was YES. [2025-03-15 01:05:06,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 866 events. 195/866 cut-off events. For 32886/33228 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4080 event pairs, 36 based on Foata normal form. 1/794 useless extension candidates. Maximal degree in co-relation 3829. Up to 295 conditions per place. [2025-03-15 01:05:06,908 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 57 selfloop transitions, 2 changer transitions 20/293 dead transitions. [2025-03-15 01:05:06,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 293 transitions, 2915 flow [2025-03-15 01:05:06,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-15 01:05:06,910 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8065843621399177 [2025-03-15 01:05:06,911 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -34 predicate places. [2025-03-15 01:05:06,911 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 293 transitions, 2915 flow [2025-03-15 01:05:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:05:06,911 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:05:06,911 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:05:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:05:06,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2025-03-15 01:05:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:05:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 659554166, now seen corresponding path program 1 times [2025-03-15 01:05:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:05:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830890636] [2025-03-15 01:05:06,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:05:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:05:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:05:06,956 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:05:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:05:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830890636] [2025-03-15 01:05:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830890636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:05:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:05:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:05:06,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91752923] [2025-03-15 01:05:06,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:05:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:05:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:05:06,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:05:06,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:05:06,958 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 324 [2025-03-15 01:05:06,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 293 transitions, 2915 flow. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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:05:06,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:05:06,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 324 [2025-03-15 01:05:06,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:05:07,097 INFO L124 PetriNetUnfolderBase]: 201/914 cut-off events. [2025-03-15 01:05:07,098 INFO L125 PetriNetUnfolderBase]: For 36485/36887 co-relation queries the response was YES. [2025-03-15 01:05:07,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 914 events. 201/914 cut-off events. For 36485/36887 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4493 event pairs, 44 based on Foata normal form. 2/850 useless extension candidates. Maximal degree in co-relation 4558. Up to 310 conditions per place. [2025-03-15 01:05:07,104 INFO L140 encePairwiseOnDemand]: 321/324 looper letters, 0 selfloop transitions, 0 changer transitions 298/298 dead transitions. [2025-03-15 01:05:07,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 298 transitions, 3287 flow [2025-03-15 01:05:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:05:07,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:05:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-03-15 01:05:07,106 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8065843621399177 [2025-03-15 01:05:07,106 INFO L298 CegarLoopForPetriNet]: 320 programPoint places, -33 predicate places. [2025-03-15 01:05:07,106 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 298 transitions, 3287 flow [2025-03-15 01:05:07,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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:05:07,116 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-two-queue.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2025-03-15 01:05:07,151 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2025-03-15 01:05:07,152 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2025-03-15 01:05:07,153 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (57 of 115 remaining) [2025-03-15 01:05:07,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (56 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (55 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2025-03-15 01:05:07,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2025-03-15 01:05:07,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2025-03-15 01:05:07,157 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2025-03-15 01:05:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:05:07,157 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:05:07,161 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:05:07,161 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:05:07,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:05:07 BasicIcfg [2025-03-15 01:05:07,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:05:07,173 INFO L158 Benchmark]: Toolchain (without parser) took 5487.58ms. Allocated memory was 71.3MB in the beginning and 335.5MB in the end (delta: 264.2MB). Free memory was 45.0MB in the beginning and 278.2MB in the end (delta: -233.2MB). Peak memory consumption was 181.5MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,174 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 32.9MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:05:07,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.30ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 31.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.02ms. Allocated memory is still 71.3MB. Free memory was 31.8MB in the beginning and 29.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,174 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 26.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,174 INFO L158 Benchmark]: RCFGBuilder took 926.96ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.7MB in the beginning and 40.1MB in the end (delta: -13.4MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,175 INFO L158 Benchmark]: TraceAbstraction took 4276.82ms. Allocated memory was 88.1MB in the beginning and 335.5MB in the end (delta: 247.5MB). Free memory was 39.2MB in the beginning and 278.2MB in the end (delta: -238.9MB). Peak memory consumption was 157.3MB. Max. memory is 8.0GB. [2025-03-15 01:05:07,176 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 32.9MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.30ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 31.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.02ms. Allocated memory is still 71.3MB. Free memory was 31.8MB in the beginning and 29.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 26.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 926.96ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.7MB in the beginning and 40.1MB in the end (delta: -13.4MB). Peak memory consumption was 20.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4276.82ms. Allocated memory was 88.1MB in the beginning and 335.5MB in the end (delta: 247.5MB). Free memory was 39.2MB in the beginning and 278.2MB in the end (delta: -238.9MB). Peak memory consumption was 157.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 404 locations, 115 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: 4.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 73 mSDsluCounter, 130 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 497 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 130 mSDtfsCounter, 497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3287occurred in iteration=19, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:05:07,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...