/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:02:51,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:02:51,719 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:02:51,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:02:51,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:02:51,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:02:51,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:02:51,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:02:51,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:02:51,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:51,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:02:51,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:02:51,749 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:02:51,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:02:51,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:02:51,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:02:52,000 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:02:52,001 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:02:52,002 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-15 01:02:53,225 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87fb33070/c59b4b412aec4f5d8a81cdb31fd82cbc/FLAGa7a1ae1a5 [2025-03-15 01:02:53,411 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:02:53,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult3.wvr.c [2025-03-15 01:02:53,417 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87fb33070/c59b4b412aec4f5d8a81cdb31fd82cbc/FLAGa7a1ae1a5 [2025-03-15 01:02:53,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87fb33070/c59b4b412aec4f5d8a81cdb31fd82cbc [2025-03-15 01:02:53,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:02:53,436 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:02:53,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:53,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:02:53,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:02:53,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1d7563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53, skipping insertion in model container [2025-03-15 01:02:53,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:02:53,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:53,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:02:53,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:53,679 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:02:53,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53 WrapperNode [2025-03-15 01:02:53,680 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:53,681 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:53,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:02:53,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:02:53,685 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:02:53" (1/1) ... [2025-03-15 01:02:53,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,736 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 560 [2025-03-15 01:02:53,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:53,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:02:53,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:02:53,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:02:53,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:02:53,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:02:53,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:02:53,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:02:53,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (1/1) ... [2025-03-15 01:02:53,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:02:53,821 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:02:53,827 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:02:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:02:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:02:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:02:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:02:53,843 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:02:53,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:02:53,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 01:02:53,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:02:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:02:53,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:02:53,845 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:02:53,960 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:02:53,961 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:02:54,601 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:02:54,601 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:02:55,036 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:02:55,036 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:02:55,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:55 BoogieIcfgContainer [2025-03-15 01:02:55,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:02:55,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:02:55,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:02:55,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:02:55,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:02:53" (1/3) ... [2025-03-15 01:02:55,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f82ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:55, skipping insertion in model container [2025-03-15 01:02:55,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:53" (2/3) ... [2025-03-15 01:02:55,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f82ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:55, skipping insertion in model container [2025-03-15 01:02:55,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:55" (3/3) ... [2025-03-15 01:02:55,046 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult3.wvr.c [2025-03-15 01:02:55,071 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:02:55,073 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult3.wvr.c that has 5 procedures, 371 locations, 1 initial locations, 6 loop locations, and 89 error locations. [2025-03-15 01:02:55,073 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:02:55,178 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:02:55,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:02:55,220 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;@d14372d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:02:55,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 163 error locations. [2025-03-15 01:02:55,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:02:55,245 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-15 01:02:55,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:02:55,246 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:55,247 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:55,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:55,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash -56599048, now seen corresponding path program 1 times [2025-03-15 01:02:55,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564735621] [2025-03-15 01:02:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:55,415 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:02:55,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564735621] [2025-03-15 01:02:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564735621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:55,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884777719] [2025-03-15 01:02:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:55,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:55,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:55,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:55,452 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:55,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:55,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:55,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:55,958 INFO L124 PetriNetUnfolderBase]: 745/1672 cut-off events. [2025-03-15 01:02:55,958 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-15 01:02:55,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1672 events. 745/1672 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8757 event pairs, 485 based on Foata normal form. 7/1520 useless extension candidates. Maximal degree in co-relation 2496. Up to 1010 conditions per place. [2025-03-15 01:02:55,979 INFO L140 encePairwiseOnDemand]: 303/383 looper letters, 28 selfloop transitions, 2 changer transitions 14/295 dead transitions. [2025-03-15 01:02:55,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 674 flow [2025-03-15 01:02:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2025-03-15 01:02:55,992 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8093994778067886 [2025-03-15 01:02:55,994 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -80 predicate places. [2025-03-15 01:02:55,994 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 295 transitions, 674 flow [2025-03-15 01:02:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:55,995 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:55,995 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:55,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:02:55,995 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:55,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1754780935, now seen corresponding path program 1 times [2025-03-15 01:02:55,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:55,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040518357] [2025-03-15 01:02:55,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:55,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,028 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:02:56,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040518357] [2025-03-15 01:02:56,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040518357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603120264] [2025-03-15 01:02:56,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,031 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:56,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 295 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:56,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:56,371 INFO L124 PetriNetUnfolderBase]: 745/1671 cut-off events. [2025-03-15 01:02:56,371 INFO L125 PetriNetUnfolderBase]: For 424/642 co-relation queries the response was YES. [2025-03-15 01:02:56,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1671 events. 745/1671 cut-off events. For 424/642 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8721 event pairs, 485 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 3456. Up to 1010 conditions per place. [2025-03-15 01:02:56,383 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 28 selfloop transitions, 2 changer transitions 14/294 dead transitions. [2025-03-15 01:02:56,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 294 transitions, 732 flow [2025-03-15 01:02:56,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-15 01:02:56,385 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.742384682332463 [2025-03-15 01:02:56,386 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -79 predicate places. [2025-03-15 01:02:56,386 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 294 transitions, 732 flow [2025-03-15 01:02:56,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,386 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:56,386 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:56,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:02:56,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:56,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:56,387 INFO L85 PathProgramCache]: Analyzing trace with hash 483862056, now seen corresponding path program 1 times [2025-03-15 01:02:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:56,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732139461] [2025-03-15 01:02:56,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,452 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:02:56,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732139461] [2025-03-15 01:02:56,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732139461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149153082] [2025-03-15 01:02:56,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,454 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:56,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 294 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:56,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:56,764 INFO L124 PetriNetUnfolderBase]: 745/1670 cut-off events. [2025-03-15 01:02:56,765 INFO L125 PetriNetUnfolderBase]: For 784/1220 co-relation queries the response was YES. [2025-03-15 01:02:56,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4898 conditions, 1670 events. 745/1670 cut-off events. For 784/1220 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8689 event pairs, 485 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 4416. Up to 1010 conditions per place. [2025-03-15 01:02:56,777 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 28 selfloop transitions, 2 changer transitions 14/293 dead transitions. [2025-03-15 01:02:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 293 transitions, 790 flow [2025-03-15 01:02:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-15 01:02:56,780 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.742384682332463 [2025-03-15 01:02:56,780 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -78 predicate places. [2025-03-15 01:02:56,780 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 293 transitions, 790 flow [2025-03-15 01:02:56,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,781 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:56,781 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:02:56,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:02:56,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:56,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash 165454935, now seen corresponding path program 1 times [2025-03-15 01:02:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:56,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841847709] [2025-03-15 01:02:56,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:56,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:56,834 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:02:56,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:56,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841847709] [2025-03-15 01:02:56,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841847709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:56,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:56,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397767213] [2025-03-15 01:02:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:56,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:56,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:56,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:56,836 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:56,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 293 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:56,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:56,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:56,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:57,141 INFO L124 PetriNetUnfolderBase]: 745/1669 cut-off events. [2025-03-15 01:02:57,142 INFO L125 PetriNetUnfolderBase]: For 1294/1948 co-relation queries the response was YES. [2025-03-15 01:02:57,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5909 conditions, 1669 events. 745/1669 cut-off events. For 1294/1948 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8782 event pairs, 485 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 5376. Up to 1010 conditions per place. [2025-03-15 01:02:57,153 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 28 selfloop transitions, 2 changer transitions 14/292 dead transitions. [2025-03-15 01:02:57,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 292 transitions, 848 flow [2025-03-15 01:02:57,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-15 01:02:57,155 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.742384682332463 [2025-03-15 01:02:57,156 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -77 predicate places. [2025-03-15 01:02:57,156 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 292 transitions, 848 flow [2025-03-15 01:02:57,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,156 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:57,157 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:57,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:02:57,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:57,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:57,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1976827172, now seen corresponding path program 1 times [2025-03-15 01:02:57,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:57,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053113697] [2025-03-15 01:02:57,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:57,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:57,197 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:02:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053113697] [2025-03-15 01:02:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053113697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632557976] [2025-03-15 01:02:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:57,200 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:57,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 292 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:57,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:57,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:57,594 INFO L124 PetriNetUnfolderBase]: 745/1668 cut-off events. [2025-03-15 01:02:57,594 INFO L125 PetriNetUnfolderBase]: For 1954/2826 co-relation queries the response was YES. [2025-03-15 01:02:57,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6920 conditions, 1668 events. 745/1668 cut-off events. For 1954/2826 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8725 event pairs, 485 based on Foata normal form. 0/1513 useless extension candidates. Maximal degree in co-relation 6336. Up to 1010 conditions per place. [2025-03-15 01:02:57,618 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 28 selfloop transitions, 2 changer transitions 14/291 dead transitions. [2025-03-15 01:02:57,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 291 transitions, 906 flow [2025-03-15 01:02:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-15 01:02:57,621 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.742384682332463 [2025-03-15 01:02:57,622 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -76 predicate places. [2025-03-15 01:02:57,622 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 291 transitions, 906 flow [2025-03-15 01:02:57,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,623 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:57,623 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:57,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:02:57,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:57,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1188892056, now seen corresponding path program 1 times [2025-03-15 01:02:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60022572] [2025-03-15 01:02:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:57,673 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:02:57,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:57,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60022572] [2025-03-15 01:02:57,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60022572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:57,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:57,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:57,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722226101] [2025-03-15 01:02:57,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:57,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:57,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:57,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:57,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:57,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:02:57,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 291 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:57,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:57,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:02:57,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:58,126 INFO L124 PetriNetUnfolderBase]: 982/2294 cut-off events. [2025-03-15 01:02:58,127 INFO L125 PetriNetUnfolderBase]: For 4015/5105 co-relation queries the response was YES. [2025-03-15 01:02:58,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10524 conditions, 2294 events. 982/2294 cut-off events. For 4015/5105 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14008 event pairs, 307 based on Foata normal form. 0/2065 useless extension candidates. Maximal degree in co-relation 9752. Up to 1330 conditions per place. [2025-03-15 01:02:58,148 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 41 selfloop transitions, 2 changer transitions 14/307 dead transitions. [2025-03-15 01:02:58,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 307 transitions, 1207 flow [2025-03-15 01:02:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 878 transitions. [2025-03-15 01:02:58,151 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7641427328111401 [2025-03-15 01:02:58,151 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -75 predicate places. [2025-03-15 01:02:58,151 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 307 transitions, 1207 flow [2025-03-15 01:02:58,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,152 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:58,152 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:58,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:02:58,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:58,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1396053313, now seen corresponding path program 1 times [2025-03-15 01:02:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:58,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699004934] [2025-03-15 01:02:58,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:58,203 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:02:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699004934] [2025-03-15 01:02:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699004934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:58,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:58,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:58,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942910243] [2025-03-15 01:02:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:58,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:58,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:58,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:58,205 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-15 01:02:58,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 307 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:58,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-15 01:02:58,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:58,530 INFO L124 PetriNetUnfolderBase]: 982/2316 cut-off events. [2025-03-15 01:02:58,530 INFO L125 PetriNetUnfolderBase]: For 6227/7715 co-relation queries the response was YES. [2025-03-15 01:02:58,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11875 conditions, 2316 events. 982/2316 cut-off events. For 6227/7715 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14365 event pairs, 392 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 11051. Up to 1330 conditions per place. [2025-03-15 01:02:58,551 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 42 selfloop transitions, 2 changer transitions 14/306 dead transitions. [2025-03-15 01:02:58,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 306 transitions, 1293 flow [2025-03-15 01:02:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:02:58,554 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-15 01:02:58,555 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -74 predicate places. [2025-03-15 01:02:58,555 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 1293 flow [2025-03-15 01:02:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,556 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:58,556 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:58,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:02:58,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:58,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2124709405, now seen corresponding path program 1 times [2025-03-15 01:02:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530953021] [2025-03-15 01:02:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:58,610 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:02:58,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:58,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530953021] [2025-03-15 01:02:58,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530953021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:58,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:58,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:58,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161986618] [2025-03-15 01:02:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:58,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:58,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:58,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:58,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:58,612 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 383 [2025-03-15 01:02:58,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:58,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 383 [2025-03-15 01:02:58,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:58,916 INFO L124 PetriNetUnfolderBase]: 982/2315 cut-off events. [2025-03-15 01:02:58,916 INFO L125 PetriNetUnfolderBase]: For 8134/10002 co-relation queries the response was YES. [2025-03-15 01:02:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13206 conditions, 2315 events. 982/2315 cut-off events. For 8134/10002 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14390 event pairs, 392 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 12315. Up to 1330 conditions per place. [2025-03-15 01:02:58,935 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 45 selfloop transitions, 2 changer transitions 14/305 dead transitions. [2025-03-15 01:02:58,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 305 transitions, 1385 flow [2025-03-15 01:02:58,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 853 transitions. [2025-03-15 01:02:58,937 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.742384682332463 [2025-03-15 01:02:58,937 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -73 predicate places. [2025-03-15 01:02:58,937 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 305 transitions, 1385 flow [2025-03-15 01:02:58,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,938 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:58,938 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] [2025-03-15 01:02:58,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:02:58,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:58,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2130505378, now seen corresponding path program 1 times [2025-03-15 01:02:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:58,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884747407] [2025-03-15 01:02:58,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:58,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:58,974 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:02:58,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:58,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884747407] [2025-03-15 01:02:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884747407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:58,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553326610] [2025-03-15 01:02:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:58,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:58,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:58,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:58,976 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:02:58,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 305 transitions, 1385 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:58,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:58,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:02:58,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:59,423 INFO L124 PetriNetUnfolderBase]: 1232/2803 cut-off events. [2025-03-15 01:02:59,423 INFO L125 PetriNetUnfolderBase]: For 10394/12450 co-relation queries the response was YES. [2025-03-15 01:02:59,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18087 conditions, 2803 events. 1232/2803 cut-off events. For 10394/12450 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17775 event pairs, 221 based on Foata normal form. 0/2538 useless extension candidates. Maximal degree in co-relation 16896. Up to 1668 conditions per place. [2025-03-15 01:02:59,454 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 70 selfloop transitions, 3 changer transitions 14/334 dead transitions. [2025-03-15 01:02:59,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 334 transitions, 2091 flow [2025-03-15 01:02:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 877 transitions. [2025-03-15 01:02:59,456 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.763272410791993 [2025-03-15 01:02:59,458 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -72 predicate places. [2025-03-15 01:02:59,458 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 334 transitions, 2091 flow [2025-03-15 01:02:59,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,458 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:59,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:02:59,459 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:59,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:59,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1060860872, now seen corresponding path program 1 times [2025-03-15 01:02:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:59,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177308838] [2025-03-15 01:02:59,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:59,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:59,512 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:02:59,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:59,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177308838] [2025-03-15 01:02:59,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177308838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:59,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:59,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:59,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768121023] [2025-03-15 01:02:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:59,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:59,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:59,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:59,514 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-15 01:02:59,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 334 transitions, 2091 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:59,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-15 01:02:59,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:59,959 INFO L124 PetriNetUnfolderBase]: 1232/2897 cut-off events. [2025-03-15 01:02:59,960 INFO L125 PetriNetUnfolderBase]: For 15281/17945 co-relation queries the response was YES. [2025-03-15 01:02:59,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19848 conditions, 2897 events. 1232/2897 cut-off events. For 15281/17945 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19115 event pairs, 274 based on Foata normal form. 0/2617 useless extension candidates. Maximal degree in co-relation 18583. Up to 1668 conditions per place. [2025-03-15 01:02:59,988 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 72 selfloop transitions, 2 changer transitions 14/333 dead transitions. [2025-03-15 01:02:59,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 333 transitions, 2237 flow [2025-03-15 01:02:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:59,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:02:59,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-15 01:02:59,991 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -71 predicate places. [2025-03-15 01:02:59,991 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 333 transitions, 2237 flow [2025-03-15 01:02:59,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:59,991 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:59,991 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] [2025-03-15 01:02:59,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:02:59,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:02:59,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:59,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1738712163, now seen corresponding path program 1 times [2025-03-15 01:02:59,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:59,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250308191] [2025-03-15 01:02:59,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:59,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:00,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:00,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250308191] [2025-03-15 01:03:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250308191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:00,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536399237] [2025-03-15 01:03:00,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:00,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:00,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:00,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:00,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:00,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:03:00,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 333 transitions, 2237 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:00,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:03:00,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:00,395 INFO L124 PetriNetUnfolderBase]: 1232/2896 cut-off events. [2025-03-15 01:03:00,396 INFO L125 PetriNetUnfolderBase]: For 18547/21615 co-relation queries the response was YES. [2025-03-15 01:03:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21512 conditions, 2896 events. 1232/2896 cut-off events. For 18547/21615 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19045 event pairs, 274 based on Foata normal form. 0/2617 useless extension candidates. Maximal degree in co-relation 20167. Up to 1668 conditions per place. [2025-03-15 01:03:00,470 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 72 selfloop transitions, 1 changer transitions 14/332 dead transitions. [2025-03-15 01:03:00,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 332 transitions, 2379 flow [2025-03-15 01:03:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:00,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-15 01:03:00,472 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7493472584856397 [2025-03-15 01:03:00,473 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -70 predicate places. [2025-03-15 01:03:00,473 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 332 transitions, 2379 flow [2025-03-15 01:03:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:00,473 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] [2025-03-15 01:03:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:03:00,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:00,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:00,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1041958968, now seen corresponding path program 1 times [2025-03-15 01:03:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:00,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057817586] [2025-03-15 01:03:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:00,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:00,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057817586] [2025-03-15 01:03:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057817586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975573815] [2025-03-15 01:03:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:00,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:00,530 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-15 01:03:00,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 332 transitions, 2379 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:00,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-15 01:03:00,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:00,933 INFO L124 PetriNetUnfolderBase]: 1232/2895 cut-off events. [2025-03-15 01:03:00,933 INFO L125 PetriNetUnfolderBase]: For 22153/25625 co-relation queries the response was YES. [2025-03-15 01:03:00,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23178 conditions, 2895 events. 1232/2895 cut-off events. For 22153/25625 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19056 event pairs, 274 based on Foata normal form. 0/2617 useless extension candidates. Maximal degree in co-relation 21751. Up to 1668 conditions per place. [2025-03-15 01:03:00,961 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 72 selfloop transitions, 2 changer transitions 14/331 dead transitions. [2025-03-15 01:03:00,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 331 transitions, 2525 flow [2025-03-15 01:03:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:03:00,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-15 01:03:00,964 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -69 predicate places. [2025-03-15 01:03:00,964 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 331 transitions, 2525 flow [2025-03-15 01:03:00,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:00,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:00,965 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] [2025-03-15 01:03:00,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:03:00,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:00,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash -750922004, now seen corresponding path program 1 times [2025-03-15 01:03:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136253123] [2025-03-15 01:03:00,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136253123] [2025-03-15 01:03:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136253123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:01,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:01,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:03:01,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690088115] [2025-03-15 01:03:01,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:01,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:03:01,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:01,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:03:01,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:03:01,381 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 383 [2025-03-15 01:03:01,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 331 transitions, 2525 flow. Second operand has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:01,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:01,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 383 [2025-03-15 01:03:01,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:01,933 INFO L124 PetriNetUnfolderBase]: 1232/2798 cut-off events. [2025-03-15 01:03:01,933 INFO L125 PetriNetUnfolderBase]: For 21994/25540 co-relation queries the response was YES. [2025-03-15 01:03:01,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24779 conditions, 2798 events. 1232/2798 cut-off events. For 21994/25540 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17805 event pairs, 221 based on Foata normal form. 0/2538 useless extension candidates. Maximal degree in co-relation 23232. Up to 1688 conditions per place. [2025-03-15 01:03:01,973 INFO L140 encePairwiseOnDemand]: 371/383 looper letters, 95 selfloop transitions, 10 changer transitions 14/329 dead transitions. [2025-03-15 01:03:01,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 329 transitions, 2731 flow [2025-03-15 01:03:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:03:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:03:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1536 transitions. [2025-03-15 01:03:01,976 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6684073107049608 [2025-03-15 01:03:01,977 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -66 predicate places. [2025-03-15 01:03:01,977 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 329 transitions, 2731 flow [2025-03-15 01:03:01,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:01,978 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:01,978 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] [2025-03-15 01:03:01,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:03:01,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:01,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash -696640662, now seen corresponding path program 1 times [2025-03-15 01:03:01,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:01,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653446817] [2025-03-15 01:03:01,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:01,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653446817] [2025-03-15 01:03:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653446817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:02,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:02,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:02,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083954249] [2025-03-15 01:03:02,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:02,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:02,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:02,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:02,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:02,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:03:02,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 329 transitions, 2731 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:02,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:02,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:03:02,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:02,450 INFO L124 PetriNetUnfolderBase]: 1232/2797 cut-off events. [2025-03-15 01:03:02,450 INFO L125 PetriNetUnfolderBase]: For 25606/29530 co-relation queries the response was YES. [2025-03-15 01:03:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26443 conditions, 2797 events. 1232/2797 cut-off events. For 25606/29530 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17733 event pairs, 221 based on Foata normal form. 0/2538 useless extension candidates. Maximal degree in co-relation 24816. Up to 1688 conditions per place. [2025-03-15 01:03:02,480 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 72 selfloop transitions, 1 changer transitions 14/328 dead transitions. [2025-03-15 01:03:02,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 328 transitions, 2873 flow [2025-03-15 01:03:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-15 01:03:02,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7493472584856397 [2025-03-15 01:03:02,483 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -65 predicate places. [2025-03-15 01:03:02,483 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 328 transitions, 2873 flow [2025-03-15 01:03:02,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:02,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:02,483 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:02,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:03:02,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:02,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash -20630162, now seen corresponding path program 1 times [2025-03-15 01:03:02,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:02,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070530825] [2025-03-15 01:03:02,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:02,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:02,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:02,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070530825] [2025-03-15 01:03:02,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070530825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:02,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:02,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:02,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087786388] [2025-03-15 01:03:02,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:02,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:02,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:02,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:02,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:02,526 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 383 [2025-03-15 01:03:02,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 328 transitions, 2873 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:02,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:02,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 383 [2025-03-15 01:03:02,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:02,915 INFO L124 PetriNetUnfolderBase]: 1232/2796 cut-off events. [2025-03-15 01:03:02,915 INFO L125 PetriNetUnfolderBase]: For 29512/33814 co-relation queries the response was YES. [2025-03-15 01:03:02,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28109 conditions, 2796 events. 1232/2796 cut-off events. For 29512/33814 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17762 event pairs, 221 based on Foata normal form. 0/2538 useless extension candidates. Maximal degree in co-relation 26400. Up to 1688 conditions per place. [2025-03-15 01:03:02,949 INFO L140 encePairwiseOnDemand]: 380/383 looper letters, 72 selfloop transitions, 2 changer transitions 14/327 dead transitions. [2025-03-15 01:03:02,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 327 transitions, 3019 flow [2025-03-15 01:03:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:02,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2025-03-15 01:03:02,951 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7476066144473456 [2025-03-15 01:03:02,952 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -64 predicate places. [2025-03-15 01:03:02,952 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 327 transitions, 3019 flow [2025-03-15 01:03:02,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:02,953 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:02,953 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] [2025-03-15 01:03:02,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:03:02,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:02,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash 143826745, now seen corresponding path program 1 times [2025-03-15 01:03:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936194594] [2025-03-15 01:03:02,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:03,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:03:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:03,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936194594] [2025-03-15 01:03:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936194594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:03,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517969836] [2025-03-15 01:03:03,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:03,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:03,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:03,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:03,012 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:03:03,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 327 transitions, 3019 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:03,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:03,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:03:03,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:03,393 INFO L124 PetriNetUnfolderBase]: 1232/2795 cut-off events. [2025-03-15 01:03:03,394 INFO L125 PetriNetUnfolderBase]: For 33696/38376 co-relation queries the response was YES. [2025-03-15 01:03:03,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29773 conditions, 2795 events. 1232/2795 cut-off events. For 33696/38376 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17776 event pairs, 221 based on Foata normal form. 0/2538 useless extension candidates. Maximal degree in co-relation 27984. Up to 1688 conditions per place. [2025-03-15 01:03:03,430 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 72 selfloop transitions, 1 changer transitions 14/326 dead transitions. [2025-03-15 01:03:03,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 326 transitions, 3161 flow [2025-03-15 01:03:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-03-15 01:03:03,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7493472584856397 [2025-03-15 01:03:03,433 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -63 predicate places. [2025-03-15 01:03:03,433 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 326 transitions, 3161 flow [2025-03-15 01:03:03,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:03,434 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:03,434 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] [2025-03-15 01:03:03,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:03:03,434 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:03,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash 915556271, now seen corresponding path program 1 times [2025-03-15 01:03:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420141481] [2025-03-15 01:03:03,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:03,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420141481] [2025-03-15 01:03:03,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420141481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:03,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:03,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:03,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470908837] [2025-03-15 01:03:03,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:03,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:03,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:03,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:03,485 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 383 [2025-03-15 01:03:03,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 326 transitions, 3161 flow. Second operand has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:03,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 383 [2025-03-15 01:03:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:03,938 INFO L124 PetriNetUnfolderBase]: 1241/2944 cut-off events. [2025-03-15 01:03:03,939 INFO L125 PetriNetUnfolderBase]: For 41768/46558 co-relation queries the response was YES. [2025-03-15 01:03:03,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31833 conditions, 2944 events. 1241/2944 cut-off events. For 41768/46558 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19254 event pairs, 142 based on Foata normal form. 1/2665 useless extension candidates. Maximal degree in co-relation 29664. Up to 1702 conditions per place. [2025-03-15 01:03:03,975 INFO L140 encePairwiseOnDemand]: 377/383 looper letters, 76 selfloop transitions, 5 changer transitions 14/333 dead transitions. [2025-03-15 01:03:03,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 333 transitions, 3603 flow [2025-03-15 01:03:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-03-15 01:03:03,980 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7563098346388164 [2025-03-15 01:03:03,980 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -62 predicate places. [2025-03-15 01:03:03,980 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 333 transitions, 3603 flow [2025-03-15 01:03:03,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.3333333333333) internal successors, (838), 3 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:03,981 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:03,981 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:03,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:03:03,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 159 more)] === [2025-03-15 01:03:03,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:03,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1827154015, now seen corresponding path program 1 times [2025-03-15 01:03:03,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:03,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914505860] [2025-03-15 01:03:03,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:03:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914505860] [2025-03-15 01:03:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914505860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365899361] [2025-03-15 01:03:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:04,054 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 383 [2025-03-15 01:03:04,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 333 transitions, 3603 flow. Second operand has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:04,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:04,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 383 [2025-03-15 01:03:04,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:04,510 INFO L124 PetriNetUnfolderBase]: 1241/2855 cut-off events. [2025-03-15 01:03:04,510 INFO L125 PetriNetUnfolderBase]: For 46953/54427 co-relation queries the response was YES. [2025-03-15 01:03:04,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33428 conditions, 2855 events. 1241/2855 cut-off events. For 46953/54427 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 18085 event pairs, 185 based on Foata normal form. 0/2597 useless extension candidates. Maximal degree in co-relation 26256. Up to 1702 conditions per place. [2025-03-15 01:03:04,522 INFO L140 encePairwiseOnDemand]: 381/383 looper letters, 0 selfloop transitions, 0 changer transitions 332/332 dead transitions. [2025-03-15 01:03:04,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 332 transitions, 3759 flow [2025-03-15 01:03:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 868 transitions. [2025-03-15 01:03:04,524 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7554395126196692 [2025-03-15 01:03:04,524 INFO L298 CegarLoopForPetriNet]: 383 programPoint places, -61 predicate places. [2025-03-15 01:03:04,524 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 332 transitions, 3759 flow [2025-03-15 01:03:04,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 285.6666666666667) internal successors, (857), 3 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:04,535 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-buffer-mult3.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:03:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (162 of 163 remaining) [2025-03-15 01:03:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (161 of 163 remaining) [2025-03-15 01:03:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (160 of 163 remaining) [2025-03-15 01:03:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (159 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (158 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (157 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (156 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (155 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (154 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (153 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (152 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (151 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (150 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (148 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (147 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (146 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (145 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (144 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (143 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (142 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (141 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (140 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (139 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (137 of 163 remaining) [2025-03-15 01:03:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (136 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (135 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (134 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (133 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (132 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (131 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (130 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (129 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (128 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (127 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (126 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (124 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (123 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (122 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (121 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (120 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (119 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (118 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (117 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (116 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (115 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (114 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (113 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (112 of 163 remaining) [2025-03-15 01:03:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (111 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (110 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (109 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (108 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (107 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (106 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (105 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (104 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (103 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (102 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (99 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (98 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (97 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (96 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (95 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (94 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 163 remaining) [2025-03-15 01:03:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 163 remaining) [2025-03-15 01:03:04,576 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 163 remaining) [2025-03-15 01:03:04,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 163 remaining) [2025-03-15 01:03:04,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 163 remaining) [2025-03-15 01:03:04,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 163 remaining) [2025-03-15 01:03:04,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:03:04,581 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:04,586 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:03:04,586 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:03:04,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:03:04 BasicIcfg [2025-03-15 01:03:04,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:03:04,591 INFO L158 Benchmark]: Toolchain (without parser) took 11154.80ms. Allocated memory was 71.3MB in the beginning and 817.9MB in the end (delta: 746.6MB). Free memory was 44.1MB in the beginning and 609.7MB in the end (delta: -565.6MB). Peak memory consumption was 545.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:04,592 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 33.2MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:04,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 29.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:03:04,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.81ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 26.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:04,594 INFO L158 Benchmark]: Boogie Preprocessor took 49.36ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 23.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:04,594 INFO L158 Benchmark]: RCFGBuilder took 1245.96ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.5MB in the beginning and 21.8MB in the end (delta: 1.7MB). Peak memory consumption was 27.6MB. Max. memory is 8.0GB. [2025-03-15 01:03:04,594 INFO L158 Benchmark]: TraceAbstraction took 9549.96ms. Allocated memory was 88.1MB in the beginning and 817.9MB in the end (delta: 729.8MB). Free memory was 20.5MB in the beginning and 609.7MB in the end (delta: -589.2MB). Peak memory consumption was 505.0MB. Max. memory is 8.0GB. [2025-03-15 01:03:04,595 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.20ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 33.2MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.87ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 29.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.81ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 26.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.36ms. Allocated memory is still 71.3MB. Free memory was 26.4MB in the beginning and 23.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 1245.96ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 23.5MB in the beginning and 21.8MB in the end (delta: 1.7MB). Peak memory consumption was 27.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9549.96ms. Allocated memory was 88.1MB in the beginning and 817.9MB in the end (delta: 729.8MB). Free memory was 20.5MB in the beginning and 609.7MB in the end (delta: -589.2MB). Peak memory consumption was 505.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 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: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 479 locations, 163 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: 9.4s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 133 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 828 IncrementalHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 105 mSDtfsCounter, 828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3759occurred in iteration=18, InterpolantAutomatonStates: 57, 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, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1738 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 89 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:03:04,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...