/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-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:04:52,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:04:52,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:04:52,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:04:52,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:04:52,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:04:52,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:04:52,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:04:52,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:04:52,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:04:52,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:04:52,582 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:04:52,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:52,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:04:52,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:04:52,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:04:52,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2025-03-15 01:04:52,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:04:52,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:04:52,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:04:52,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:04:52,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:04:52,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2025-03-15 01:04:54,021 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9d6c980/6b8ffd3b8f394cddbd6774e6d523aa03/FLAG7cc9efeca [2025-03-15 01:04:54,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:04:54,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2025-03-15 01:04:54,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9d6c980/6b8ffd3b8f394cddbd6774e6d523aa03/FLAG7cc9efeca [2025-03-15 01:04:54,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9d6c980/6b8ffd3b8f394cddbd6774e6d523aa03 [2025-03-15 01:04:54,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:04:54,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:04:54,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:54,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:04:54,610 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:04:54,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130c93dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54, skipping insertion in model container [2025-03-15 01:04:54,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:04:54,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:54,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:04:54,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:04:54,779 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:04:54,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54 WrapperNode [2025-03-15 01:04:54,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:04:54,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:54,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:04:54,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:04:54,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,820 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 217 [2025-03-15 01:04:54,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:04:54,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:04:54,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:04:54,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:04:54,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,833 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,833 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:04:54,853 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:04:54,853 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:04:54,853 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:04:54,854 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (1/1) ... [2025-03-15 01:04:54,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:04:54,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:04:54,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:04:54,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:04:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:04:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:04:54,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:04:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:04:54,905 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:04:54,983 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:04:54,984 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:04:55,287 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:04:55,287 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:04:55,520 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:04:55,521 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 01:04:55,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:55 BoogieIcfgContainer [2025-03-15 01:04:55,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:04:55,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:04:55,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:04:55,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:04:55,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:04:54" (1/3) ... [2025-03-15 01:04:55,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca9534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:55, skipping insertion in model container [2025-03-15 01:04:55,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:04:54" (2/3) ... [2025-03-15 01:04:55,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca9534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:04:55, skipping insertion in model container [2025-03-15 01:04:55,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:04:55" (3/3) ... [2025-03-15 01:04:55,531 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2025-03-15 01:04:55,544 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:04:55,546 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-queue.wvr.c that has 3 procedures, 173 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-03-15 01:04:55,547 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:04:55,618 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:04:55,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:04:55,663 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;@2a63b0f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:04:55,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-03-15 01:04:55,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:04:55,684 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2025-03-15 01:04:55,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:04:55,686 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:55,687 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:55,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -64576486, now seen corresponding path program 1 times [2025-03-15 01:04:55,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:55,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33658167] [2025-03-15 01:04:55,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:55,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:55,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33658167] [2025-03-15 01:04:55,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33658167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:55,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:55,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:55,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575622820] [2025-03-15 01:04:55,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:55,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:55,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:55,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:55,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:55,850 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 180 [2025-03-15 01:04:55,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 180 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:55,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:55,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 180 [2025-03-15 01:04:55,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:55,942 INFO L124 PetriNetUnfolderBase]: 10/180 cut-off events. [2025-03-15 01:04:55,942 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-15 01:04:55,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 180 events. 10/180 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 185 event pairs, 0 based on Foata normal form. 13/176 useless extension candidates. Maximal degree in co-relation 129. Up to 23 conditions per place. [2025-03-15 01:04:55,947 INFO L140 encePairwiseOnDemand]: 152/180 looper letters, 11 selfloop transitions, 2 changer transitions 11/146 dead transitions. [2025-03-15 01:04:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 146 transitions, 332 flow [2025-03-15 01:04:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-03-15 01:04:55,957 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8462962962962963 [2025-03-15 01:04:55,959 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -27 predicate places. [2025-03-15 01:04:55,959 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 146 transitions, 332 flow [2025-03-15 01:04:55,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:55,959 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:55,959 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] [2025-03-15 01:04:55,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:04:55,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 416653474, now seen corresponding path program 1 times [2025-03-15 01:04:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479756890] [2025-03-15 01:04:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479756890] [2025-03-15 01:04:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479756890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:55,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208939101] [2025-03-15 01:04:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:55,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:55,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:55,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:55,994 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 180 [2025-03-15 01:04:55,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 146 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:55,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:55,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 180 [2025-03-15 01:04:55,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,051 INFO L124 PetriNetUnfolderBase]: 10/179 cut-off events. [2025-03-15 01:04:56,051 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-15 01:04:56,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 179 events. 10/179 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 138. Up to 23 conditions per place. [2025-03-15 01:04:56,054 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 12 selfloop transitions, 2 changer transitions 11/145 dead transitions. [2025-03-15 01:04:56,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 145 transitions, 358 flow [2025-03-15 01:04:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2025-03-15 01:04:56,056 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-03-15 01:04:56,057 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -26 predicate places. [2025-03-15 01:04:56,057 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 145 transitions, 358 flow [2025-03-15 01:04:56,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,057 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,057 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] [2025-03-15 01:04:56,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:04:56,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash -513225719, now seen corresponding path program 1 times [2025-03-15 01:04:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040652517] [2025-03-15 01:04:56,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:56,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040652517] [2025-03-15 01:04:56,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040652517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:56,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:56,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715793461] [2025-03-15 01:04:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:56,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:56,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:56,101 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 180 [2025-03-15 01:04:56,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 145 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:56,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 180 [2025-03-15 01:04:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,172 INFO L124 PetriNetUnfolderBase]: 10/178 cut-off events. [2025-03-15 01:04:56,172 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-15 01:04:56,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 178 events. 10/178 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 195 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 147. Up to 23 conditions per place. [2025-03-15 01:04:56,174 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 12 selfloop transitions, 2 changer transitions 11/144 dead transitions. [2025-03-15 01:04:56,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 144 transitions, 384 flow [2025-03-15 01:04:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2025-03-15 01:04:56,176 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-03-15 01:04:56,176 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -25 predicate places. [2025-03-15 01:04:56,177 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 384 flow [2025-03-15 01:04:56,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,177 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,177 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:04:56,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash 700256128, now seen corresponding path program 1 times [2025-03-15 01:04:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114357713] [2025-03-15 01:04:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114357713] [2025-03-15 01:04:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114357713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533194401] [2025-03-15 01:04:56,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:56,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:56,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:56,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:56,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:56,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2025-03-15 01:04:56,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:56,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2025-03-15 01:04:56,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,288 INFO L124 PetriNetUnfolderBase]: 11/199 cut-off events. [2025-03-15 01:04:56,288 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2025-03-15 01:04:56,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 199 events. 11/199 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 263 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 151. Up to 29 conditions per place. [2025-03-15 01:04:56,290 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 12 selfloop transitions, 2 changer transitions 11/147 dead transitions. [2025-03-15 01:04:56,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 446 flow [2025-03-15 01:04:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2025-03-15 01:04:56,293 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2025-03-15 01:04:56,294 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -24 predicate places. [2025-03-15 01:04:56,294 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 147 transitions, 446 flow [2025-03-15 01:04:56,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,294 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,294 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:56,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:04:56,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -553265260, now seen corresponding path program 1 times [2025-03-15 01:04:56,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513735022] [2025-03-15 01:04:56,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:56,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:56,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513735022] [2025-03-15 01:04:56,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513735022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383645725] [2025-03-15 01:04:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:56,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:56,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:56,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:56,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:56,344 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 180 [2025-03-15 01:04:56,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 147 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:56,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 180 [2025-03-15 01:04:56,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,393 INFO L124 PetriNetUnfolderBase]: 11/198 cut-off events. [2025-03-15 01:04:56,393 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2025-03-15 01:04:56,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 198 events. 11/198 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 262 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 157. Up to 29 conditions per place. [2025-03-15 01:04:56,395 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 13 selfloop transitions, 2 changer transitions 11/146 dead transitions. [2025-03-15 01:04:56,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 146 transitions, 474 flow [2025-03-15 01:04:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-15 01:04:56,398 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2025-03-15 01:04:56,399 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -23 predicate places. [2025-03-15 01:04:56,399 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 474 flow [2025-03-15 01:04:56,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,399 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,399 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] [2025-03-15 01:04:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:04:56,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1759705218, now seen corresponding path program 1 times [2025-03-15 01:04:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907232536] [2025-03-15 01:04:56,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:56,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907232536] [2025-03-15 01:04:56,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907232536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700861532] [2025-03-15 01:04:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:56,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:56,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:56,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:56,434 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2025-03-15 01:04:56,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:56,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2025-03-15 01:04:56,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,475 INFO L124 PetriNetUnfolderBase]: 11/197 cut-off events. [2025-03-15 01:04:56,475 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-03-15 01:04:56,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 197 events. 11/197 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 262 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 161. Up to 29 conditions per place. [2025-03-15 01:04:56,476 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 13 selfloop transitions, 1 changer transitions 11/145 dead transitions. [2025-03-15 01:04:56,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 145 transitions, 498 flow [2025-03-15 01:04:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2025-03-15 01:04:56,478 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-03-15 01:04:56,478 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -22 predicate places. [2025-03-15 01:04:56,478 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 145 transitions, 498 flow [2025-03-15 01:04:56,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,479 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,479 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:56,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:04:56,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1924894254, now seen corresponding path program 1 times [2025-03-15 01:04:56,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114504046] [2025-03-15 01:04:56,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:56,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:56,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:56,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114504046] [2025-03-15 01:04:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114504046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:56,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:56,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:56,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60979466] [2025-03-15 01:04:56,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:56,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:56,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:56,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:56,557 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 180 [2025-03-15 01:04:56,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 145 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:56,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 180 [2025-03-15 01:04:56,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:56,600 INFO L124 PetriNetUnfolderBase]: 11/196 cut-off events. [2025-03-15 01:04:56,600 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-03-15 01:04:56,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 196 events. 11/196 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 255 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 168. Up to 29 conditions per place. [2025-03-15 01:04:56,603 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 13 selfloop transitions, 2 changer transitions 11/144 dead transitions. [2025-03-15 01:04:56,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 144 transitions, 526 flow [2025-03-15 01:04:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2025-03-15 01:04:56,605 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2025-03-15 01:04:56,605 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -21 predicate places. [2025-03-15 01:04:56,605 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 144 transitions, 526 flow [2025-03-15 01:04:56,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:56,606 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:56,606 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:04:56,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash 2144641730, now seen corresponding path program 1 times [2025-03-15 01:04:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907024896] [2025-03-15 01:04:56,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:57,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:57,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:57,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907024896] [2025-03-15 01:04:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907024896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:57,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:04:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468001047] [2025-03-15 01:04:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:57,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:04:57,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:57,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:04:57,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:04:57,068 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 180 [2025-03-15 01:04:57,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 144 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:57,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:57,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 180 [2025-03-15 01:04:57,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:57,158 INFO L124 PetriNetUnfolderBase]: 11/195 cut-off events. [2025-03-15 01:04:57,158 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-03-15 01:04:57,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 195 events. 11/195 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 253 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 186. Up to 33 conditions per place. [2025-03-15 01:04:57,159 INFO L140 encePairwiseOnDemand]: 174/180 looper letters, 23 selfloop transitions, 5 changer transitions 11/143 dead transitions. [2025-03-15 01:04:57,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 143 transitions, 580 flow [2025-03-15 01:04:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:04:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:04:57,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 805 transitions. [2025-03-15 01:04:57,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7453703703703703 [2025-03-15 01:04:57,162 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2025-03-15 01:04:57,162 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 143 transitions, 580 flow [2025-03-15 01:04:57,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:57,163 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:04:57,163 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:57,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:04:57,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-03-15 01:04:57,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:04:57,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1598240503, now seen corresponding path program 1 times [2025-03-15 01:04:57,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:04:57,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362782533] [2025-03-15 01:04:57,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:04:57,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:04:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:04:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:04:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:04:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362782533] [2025-03-15 01:04:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362782533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:04:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:04:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:04:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048169418] [2025-03-15 01:04:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:04:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:04:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:04:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:04:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:04:57,234 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2025-03-15 01:04:57,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 143 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:57,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:04:57,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2025-03-15 01:04:57,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:04:57,270 INFO L124 PetriNetUnfolderBase]: 11/193 cut-off events. [2025-03-15 01:04:57,270 INFO L125 PetriNetUnfolderBase]: For 489/489 co-relation queries the response was YES. [2025-03-15 01:04:57,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 193 events. 11/193 cut-off events. For 489/489 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 247 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 196. Up to 33 conditions per place. [2025-03-15 01:04:57,272 INFO L140 encePairwiseOnDemand]: 178/180 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2025-03-15 01:04:57,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 142 transitions, 604 flow [2025-03-15 01:04:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:04:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:04:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2025-03-15 01:04:57,273 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-03-15 01:04:57,274 INFO L298 CegarLoopForPetriNet]: 179 programPoint places, -16 predicate places. [2025-03-15 01:04:57,274 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 142 transitions, 604 flow [2025-03-15 01:04:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:04:57,282 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-simple-queue.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:04:57,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-03-15 01:04:57,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (17 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-03-15 01:04:57,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-03-15 01:04:57,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-03-15 01:04:57,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:04:57,313 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:04:57,319 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:04:57,320 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:04:57,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:04:57 BasicIcfg [2025-03-15 01:04:57,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:04:57,327 INFO L158 Benchmark]: Toolchain (without parser) took 2720.57ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 44.3MB in the beginning and 22.5MB in the end (delta: 21.8MB). Peak memory consumption was 61.3MB. Max. memory is 8.0GB. [2025-03-15 01:04:57,327 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:57,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.82ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:04:57,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.66ms. Allocated memory is still 71.3MB. Free memory was 31.9MB in the beginning and 30.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:04:57,327 INFO L158 Benchmark]: Boogie Preprocessor took 32.17ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 28.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:04:57,327 INFO L158 Benchmark]: RCFGBuilder took 667.90ms. Allocated memory is still 71.3MB. Free memory was 28.4MB in the beginning and 25.7MB in the end (delta: 2.7MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2025-03-15 01:04:57,329 INFO L158 Benchmark]: TraceAbstraction took 1801.31ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 24.9MB in the beginning and 22.5MB in the end (delta: 2.4MB). Peak memory consumption was 40.4MB. Max. memory is 8.0GB. [2025-03-15 01:04:57,331 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.82ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.9MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.66ms. Allocated memory is still 71.3MB. Free memory was 31.9MB in the beginning and 30.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.17ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 28.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 667.90ms. Allocated memory is still 71.3MB. Free memory was 28.4MB in the beginning and 25.7MB in the end (delta: 2.7MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1801.31ms. Allocated memory was 71.3MB in the beginning and 109.1MB in the end (delta: 37.7MB). Free memory was 24.9MB in the beginning and 22.5MB in the end (delta: 2.4MB). Peak memory consumption was 40.4MB. 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 214 locations, 49 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: 1.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 52 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=604occurred in iteration=9, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 461 NumberOfCodeBlocks, 461 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 28 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:04:57,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...