/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 -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:35:26,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:35:26,555 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-14 22:35:26,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:35:26,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:35:26,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:35:26,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:35:26,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:35:26,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:35:26,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:35:26,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:35:26,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:35:26,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:35:26,612 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 [2025-03-14 22:35:26,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:35:26,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:35:26,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:35:26,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:35:26,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:35:26,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2025-03-14 22:35:27,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd22913c/c303c91db07443b5ba3fc384d6689339/FLAG663256474 [2025-03-14 22:35:28,108 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:35:28,108 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c [2025-03-14 22:35:28,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd22913c/c303c91db07443b5ba3fc384d6689339/FLAG663256474 [2025-03-14 22:35:28,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fd22913c/c303c91db07443b5ba3fc384d6689339 [2025-03-14 22:35:28,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:35:28,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:35:28,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:35:28,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:35:28,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:35:28,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6396d982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28, skipping insertion in model container [2025-03-14 22:35:28,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:35:28,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-03-14 22:35:28,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:35:28,647 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:35:28,659 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-2.wvr.c[2556,2569] [2025-03-14 22:35:28,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:35:28,669 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:35:28,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28 WrapperNode [2025-03-14 22:35:28,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:35:28,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:35:28,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:35:28,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:35:28,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,703 INFO L138 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-14 22:35:28,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:35:28,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:35:28,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:35:28,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:35:28,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:35:28,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:35:28,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:35:28,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:35:28,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (1/1) ... [2025-03-14 22:35:28,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:35:28,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:35:28,759 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-14 22:35:28,761 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-14 22:35:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:35:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:35:28,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:35:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:35:28,779 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:35:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:35:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:35:28,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:35:28,780 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 22:35:28,852 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:35:28,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:35:29,068 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:35:29,068 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:35:29,083 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:35:29,084 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:35:29,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:35:29 BoogieIcfgContainer [2025-03-14 22:35:29,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:35:29,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:35:29,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:35:29,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:35:29,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:35:28" (1/3) ... [2025-03-14 22:35:29,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a218a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:35:29, skipping insertion in model container [2025-03-14 22:35:29,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:35:28" (2/3) ... [2025-03-14 22:35:29,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a218a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:35:29, skipping insertion in model container [2025-03-14 22:35:29,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:35:29" (3/3) ... [2025-03-14 22:35:29,093 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-2.wvr.c [2025-03-14 22:35:29,104 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:35:29,106 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-2.wvr.c that has 3 procedures, 140 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 22:35:29,106 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:35:29,176 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:35:29,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:35:29,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;@2f1a7860, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:35:29,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:35:29,277 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:35:29,277 INFO L124 PetriNetUnfolderBase]: 8/139 cut-off events. [2025-03-14 22:35:29,279 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:35:29,279 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:29,279 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] [2025-03-14 22:35:29,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:29,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash 417108414, now seen corresponding path program 1 times [2025-03-14 22:35:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:29,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893231402] [2025-03-14 22:35:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:35:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:35:30,064 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-14 22:35:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:30,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893231402] [2025-03-14 22:35:30,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893231402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:35:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396432382] [2025-03-14 22:35:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:30,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:35:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:35:30,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:35:30,099 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 147 [2025-03-14 22:35:30,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 147 transitions, 308 flow. Second operand has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 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-14 22:35:30,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:30,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 147 [2025-03-14 22:35:30,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:30,458 INFO L124 PetriNetUnfolderBase]: 17/279 cut-off events. [2025-03-14 22:35:30,458 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-14 22:35:30,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 279 events. 17/279 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 768 event pairs, 6 based on Foata normal form. 24/284 useless extension candidates. Maximal degree in co-relation 214. Up to 23 conditions per place. [2025-03-14 22:35:30,474 INFO L140 encePairwiseOnDemand]: 124/147 looper letters, 40 selfloop transitions, 13 changer transitions 13/170 dead transitions. [2025-03-14 22:35:30,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 170 transitions, 505 flow [2025-03-14 22:35:30,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:35:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:35:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1845 transitions. [2025-03-14 22:35:30,489 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7844387755102041 [2025-03-14 22:35:30,494 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 8 predicate places. [2025-03-14 22:35:30,494 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 170 transitions, 505 flow [2025-03-14 22:35:30,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 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-14 22:35:30,495 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:30,495 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] [2025-03-14 22:35:30,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:35:30,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:30,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:30,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1362564338, now seen corresponding path program 2 times [2025-03-14 22:35:30,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:30,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659185464] [2025-03-14 22:35:30,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:35:30,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:30,518 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:35:30,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:30,623 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-14 22:35:30,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:30,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659185464] [2025-03-14 22:35:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659185464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:30,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:35:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039464481] [2025-03-14 22:35:30,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:30,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:35:30,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:30,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:35:30,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:35:30,626 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2025-03-14 22:35:30,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 170 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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-14 22:35:30,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:30,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2025-03-14 22:35:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:30,944 INFO L124 PetriNetUnfolderBase]: 236/1198 cut-off events. [2025-03-14 22:35:30,944 INFO L125 PetriNetUnfolderBase]: For 310/322 co-relation queries the response was YES. [2025-03-14 22:35:30,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 1198 events. 236/1198 cut-off events. For 310/322 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7853 event pairs, 37 based on Foata normal form. 10/1101 useless extension candidates. Maximal degree in co-relation 1605. Up to 205 conditions per place. [2025-03-14 22:35:30,949 INFO L140 encePairwiseOnDemand]: 134/147 looper letters, 70 selfloop transitions, 36 changer transitions 17/246 dead transitions. [2025-03-14 22:35:30,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 246 transitions, 966 flow [2025-03-14 22:35:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:35:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:35:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1224 transitions. [2025-03-14 22:35:30,952 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8326530612244898 [2025-03-14 22:35:30,952 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 17 predicate places. [2025-03-14 22:35:30,952 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 246 transitions, 966 flow [2025-03-14 22:35:30,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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-14 22:35:30,953 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:30,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] [2025-03-14 22:35:30,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:35:30,953 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:30,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1482586462, now seen corresponding path program 3 times [2025-03-14 22:35:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:30,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178648763] [2025-03-14 22:35:30,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:35:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:30,983 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:35:30,983 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:31,081 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-14 22:35:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:31,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178648763] [2025-03-14 22:35:31,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178648763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:31,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:31,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:35:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653594025] [2025-03-14 22:35:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:31,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:35:31,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:31,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:35:31,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:35:31,083 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2025-03-14 22:35:31,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 246 transitions, 966 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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-14 22:35:31,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:31,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2025-03-14 22:35:31,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:31,315 INFO L124 PetriNetUnfolderBase]: 310/1518 cut-off events. [2025-03-14 22:35:31,315 INFO L125 PetriNetUnfolderBase]: For 739/744 co-relation queries the response was YES. [2025-03-14 22:35:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 1518 events. 310/1518 cut-off events. For 739/744 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11130 event pairs, 21 based on Foata normal form. 5/1401 useless extension candidates. Maximal degree in co-relation 2467. Up to 259 conditions per place. [2025-03-14 22:35:31,325 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 71 selfloop transitions, 8 changer transitions 31/282 dead transitions. [2025-03-14 22:35:31,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 282 transitions, 1296 flow [2025-03-14 22:35:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:35:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:35:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1092 transitions. [2025-03-14 22:35:31,328 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-03-14 22:35:31,328 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 25 predicate places. [2025-03-14 22:35:31,328 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 282 transitions, 1296 flow [2025-03-14 22:35:31,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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-14 22:35:31,329 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:31,329 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] [2025-03-14 22:35:31,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:35:31,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:31,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:31,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1197446814, now seen corresponding path program 4 times [2025-03-14 22:35:31,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:31,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884890768] [2025-03-14 22:35:31,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:35:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:31,351 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:35:31,351 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:31,633 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-14 22:35:31,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:31,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884890768] [2025-03-14 22:35:31,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884890768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:31,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:31,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:35:31,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872922094] [2025-03-14 22:35:31,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:31,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:35:31,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:31,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:35:31,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:35:31,636 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 147 [2025-03-14 22:35:31,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 282 transitions, 1296 flow. Second operand has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 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-14 22:35:31,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:31,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 147 [2025-03-14 22:35:31,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:31,965 INFO L124 PetriNetUnfolderBase]: 310/1513 cut-off events. [2025-03-14 22:35:31,965 INFO L125 PetriNetUnfolderBase]: For 1234/1278 co-relation queries the response was YES. [2025-03-14 22:35:31,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 1513 events. 310/1513 cut-off events. For 1234/1278 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 11150 event pairs, 21 based on Foata normal form. 26/1419 useless extension candidates. Maximal degree in co-relation 2700. Up to 259 conditions per place. [2025-03-14 22:35:31,973 INFO L140 encePairwiseOnDemand]: 131/147 looper letters, 50 selfloop transitions, 15 changer transitions 52/290 dead transitions. [2025-03-14 22:35:31,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 290 transitions, 1599 flow [2025-03-14 22:35:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:35:31,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:35:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1826 transitions. [2025-03-14 22:35:31,976 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7763605442176871 [2025-03-14 22:35:31,977 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 40 predicate places. [2025-03-14 22:35:31,977 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 290 transitions, 1599 flow [2025-03-14 22:35:31,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 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-14 22:35:31,978 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:31,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, 1] [2025-03-14 22:35:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:35:31,978 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -429877788, now seen corresponding path program 5 times [2025-03-14 22:35:31,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:31,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705859631] [2025-03-14 22:35:31,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:35:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:31,991 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:35:31,991 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:32,059 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-14 22:35:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705859631] [2025-03-14 22:35:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705859631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:35:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488055806] [2025-03-14 22:35:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:32,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:35:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:32,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:35:32,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:35:32,061 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2025-03-14 22:35:32,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 290 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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-14 22:35:32,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:32,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2025-03-14 22:35:32,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:32,459 INFO L124 PetriNetUnfolderBase]: 418/2218 cut-off events. [2025-03-14 22:35:32,460 INFO L125 PetriNetUnfolderBase]: For 2508/2704 co-relation queries the response was YES. [2025-03-14 22:35:32,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5430 conditions, 2218 events. 418/2218 cut-off events. For 2508/2704 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 19053 event pairs, 15 based on Foata normal form. 76/2134 useless extension candidates. Maximal degree in co-relation 4562. Up to 387 conditions per place. [2025-03-14 22:35:32,469 INFO L140 encePairwiseOnDemand]: 134/147 looper letters, 121 selfloop transitions, 70 changer transitions 84/408 dead transitions. [2025-03-14 22:35:32,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 408 transitions, 2873 flow [2025-03-14 22:35:32,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:35:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:35:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2025-03-14 22:35:32,472 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8319727891156462 [2025-03-14 22:35:32,472 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 49 predicate places. [2025-03-14 22:35:32,472 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 408 transitions, 2873 flow [2025-03-14 22:35:32,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 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-14 22:35:32,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:32,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, 1, 1, 1, 1, 1] [2025-03-14 22:35:32,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:35:32,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:32,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash -914866028, now seen corresponding path program 6 times [2025-03-14 22:35:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:32,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972908513] [2025-03-14 22:35:32,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:35:32,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:32,498 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:35:32,498 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:35:32,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:32,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972908513] [2025-03-14 22:35:32,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972908513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:32,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:32,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:35:32,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813588693] [2025-03-14 22:35:32,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:32,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:35:32,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:32,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:35:32,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:35:32,580 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2025-03-14 22:35:32,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 408 transitions, 2873 flow. Second operand has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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-14 22:35:32,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:32,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2025-03-14 22:35:32,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:32,947 INFO L124 PetriNetUnfolderBase]: 532/2702 cut-off events. [2025-03-14 22:35:32,947 INFO L125 PetriNetUnfolderBase]: For 5572/5692 co-relation queries the response was YES. [2025-03-14 22:35:32,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 2702 events. 532/2702 cut-off events. For 5572/5692 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 24949 event pairs, 39 based on Foata normal form. 27/2514 useless extension candidates. Maximal degree in co-relation 6224. Up to 719 conditions per place. [2025-03-14 22:35:32,961 INFO L140 encePairwiseOnDemand]: 140/147 looper letters, 97 selfloop transitions, 8 changer transitions 99/444 dead transitions. [2025-03-14 22:35:32,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 444 transitions, 3475 flow [2025-03-14 22:35:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:35:32,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:35:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1094 transitions. [2025-03-14 22:35:32,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8269085411942555 [2025-03-14 22:35:32,966 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 57 predicate places. [2025-03-14 22:35:32,966 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 444 transitions, 3475 flow [2025-03-14 22:35:32,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 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-14 22:35:32,966 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:32,966 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:35:32,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:35:32,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:32,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1378230094, now seen corresponding path program 7 times [2025-03-14 22:35:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:32,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738264113] [2025-03-14 22:35:32,968 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:35:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:35:33,335 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-14 22:35:33,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:33,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738264113] [2025-03-14 22:35:33,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738264113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:33,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:33,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:35:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975010081] [2025-03-14 22:35:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:33,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:35:33,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:33,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:35:33,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:35:33,338 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 147 [2025-03-14 22:35:33,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 444 transitions, 3475 flow. Second operand has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:33,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:33,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 147 [2025-03-14 22:35:33,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:34,115 INFO L124 PetriNetUnfolderBase]: 1086/4255 cut-off events. [2025-03-14 22:35:34,116 INFO L125 PetriNetUnfolderBase]: For 9895/10479 co-relation queries the response was YES. [2025-03-14 22:35:34,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14287 conditions, 4255 events. 1086/4255 cut-off events. For 9895/10479 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 41027 event pairs, 163 based on Foata normal form. 60/3943 useless extension candidates. Maximal degree in co-relation 12444. Up to 1774 conditions per place. [2025-03-14 22:35:34,134 INFO L140 encePairwiseOnDemand]: 129/147 looper letters, 258 selfloop transitions, 38 changer transitions 233/639 dead transitions. [2025-03-14 22:35:34,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 639 transitions, 5932 flow [2025-03-14 22:35:34,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:35:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:35:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1827 transitions. [2025-03-14 22:35:34,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6541353383458647 [2025-03-14 22:35:34,139 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 75 predicate places. [2025-03-14 22:35:34,139 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 639 transitions, 5932 flow [2025-03-14 22:35:34,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:34,139 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:34,140 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] [2025-03-14 22:35:34,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 22:35:34,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:34,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:34,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1135475880, now seen corresponding path program 8 times [2025-03-14 22:35:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:34,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095193399] [2025-03-14 22:35:34,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:35:34,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:34,160 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:35:34,160 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:34,390 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-14 22:35:34,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:34,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095193399] [2025-03-14 22:35:34,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095193399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:34,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:34,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:35:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264731353] [2025-03-14 22:35:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:35:34,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:34,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:35:34,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:35:34,392 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 147 [2025-03-14 22:35:34,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 639 transitions, 5932 flow. Second operand has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:34,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:34,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 147 [2025-03-14 22:35:34,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:35,573 INFO L124 PetriNetUnfolderBase]: 1639/6751 cut-off events. [2025-03-14 22:35:35,573 INFO L125 PetriNetUnfolderBase]: For 19964/22826 co-relation queries the response was YES. [2025-03-14 22:35:35,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26217 conditions, 6751 events. 1639/6751 cut-off events. For 19964/22826 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 74250 event pairs, 247 based on Foata normal form. 257/6403 useless extension candidates. Maximal degree in co-relation 23027. Up to 3006 conditions per place. [2025-03-14 22:35:35,605 INFO L140 encePairwiseOnDemand]: 129/147 looper letters, 364 selfloop transitions, 50 changer transitions 452/970 dead transitions. [2025-03-14 22:35:35,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 970 transitions, 10833 flow [2025-03-14 22:35:35,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-14 22:35:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-14 22:35:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2134 transitions. [2025-03-14 22:35:35,609 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6598639455782312 [2025-03-14 22:35:35,609 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 96 predicate places. [2025-03-14 22:35:35,609 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 970 transitions, 10833 flow [2025-03-14 22:35:35,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:35,610 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:35,610 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] [2025-03-14 22:35:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:35:35,610 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash -612396960, now seen corresponding path program 9 times [2025-03-14 22:35:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249363737] [2025-03-14 22:35:35,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:35:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:35,624 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:35:35,624 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:35,851 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-14 22:35:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249363737] [2025-03-14 22:35:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249363737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:35:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145869747] [2025-03-14 22:35:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:35,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:35:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:35,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:35:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:35:35,852 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 147 [2025-03-14 22:35:35,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 970 transitions, 10833 flow. Second operand has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:35,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:35,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 147 [2025-03-14 22:35:35,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:36,965 INFO L124 PetriNetUnfolderBase]: 1694/7075 cut-off events. [2025-03-14 22:35:36,965 INFO L125 PetriNetUnfolderBase]: For 26505/30608 co-relation queries the response was YES. [2025-03-14 22:35:36,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31361 conditions, 7075 events. 1694/7075 cut-off events. For 26505/30608 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 78964 event pairs, 266 based on Foata normal form. 207/6648 useless extension candidates. Maximal degree in co-relation 27683. Up to 3274 conditions per place. [2025-03-14 22:35:36,998 INFO L140 encePairwiseOnDemand]: 130/147 looper letters, 380 selfloop transitions, 29 changer transitions 504/1017 dead transitions. [2025-03-14 22:35:36,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1017 transitions, 13113 flow [2025-03-14 22:35:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:35:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:35:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1714 transitions. [2025-03-14 22:35:37,046 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6477702191987906 [2025-03-14 22:35:37,047 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 113 predicate places. [2025-03-14 22:35:37,047 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 1017 transitions, 13113 flow [2025-03-14 22:35:37,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.66666666666667) internal successors, (1100), 12 states have internal predecessors, (1100), 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-14 22:35:37,047 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:37,047 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] [2025-03-14 22:35:37,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:35:37,048 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:37,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:37,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1384640453, now seen corresponding path program 1 times [2025-03-14 22:35:37,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:37,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906074406] [2025-03-14 22:35:37,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:35:37,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:35:37,156 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-14 22:35:37,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:37,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906074406] [2025-03-14 22:35:37,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906074406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:37,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:37,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:35:37,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581109563] [2025-03-14 22:35:37,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:37,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:35:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:37,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:35:37,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:35:37,158 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 147 [2025-03-14 22:35:37,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 1017 transitions, 13113 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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-14 22:35:37,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:37,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 147 [2025-03-14 22:35:37,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:38,057 INFO L124 PetriNetUnfolderBase]: 1383/6062 cut-off events. [2025-03-14 22:35:38,057 INFO L125 PetriNetUnfolderBase]: For 29031/32187 co-relation queries the response was YES. [2025-03-14 22:35:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28196 conditions, 6062 events. 1383/6062 cut-off events. For 29031/32187 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 66024 event pairs, 226 based on Foata normal form. 33/5553 useless extension candidates. Maximal degree in co-relation 24670. Up to 2688 conditions per place. [2025-03-14 22:35:38,081 INFO L140 encePairwiseOnDemand]: 135/147 looper letters, 217 selfloop transitions, 36 changer transitions 483/917 dead transitions. [2025-03-14 22:35:38,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 917 transitions, 12737 flow [2025-03-14 22:35:38,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:35:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:35:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 875 transitions. [2025-03-14 22:35:38,084 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7440476190476191 [2025-03-14 22:35:38,084 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 119 predicate places. [2025-03-14 22:35:38,084 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 917 transitions, 12737 flow [2025-03-14 22:35:38,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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-14 22:35:38,084 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:38,084 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] [2025-03-14 22:35:38,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:35:38,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:38,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:38,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1491726965, now seen corresponding path program 1 times [2025-03-14 22:35:38,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:38,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248038581] [2025-03-14 22:35:38,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:35:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:35:38,241 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-14 22:35:38,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:38,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248038581] [2025-03-14 22:35:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248038581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:38,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:35:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619432612] [2025-03-14 22:35:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:38,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:35:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:38,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:35:38,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:35:38,243 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 147 [2025-03-14 22:35:38,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 917 transitions, 12737 flow. Second operand has 12 states, 12 states have (on average 91.75) internal successors, (1101), 12 states have internal predecessors, (1101), 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-14 22:35:38,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:38,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 147 [2025-03-14 22:35:38,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:39,323 INFO L124 PetriNetUnfolderBase]: 1325/5866 cut-off events. [2025-03-14 22:35:39,323 INFO L125 PetriNetUnfolderBase]: For 33350/38197 co-relation queries the response was YES. [2025-03-14 22:35:39,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30480 conditions, 5866 events. 1325/5866 cut-off events. For 33350/38197 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 63883 event pairs, 174 based on Foata normal form. 179/5527 useless extension candidates. Maximal degree in co-relation 26663. Up to 2572 conditions per place. [2025-03-14 22:35:39,350 INFO L140 encePairwiseOnDemand]: 130/147 looper letters, 243 selfloop transitions, 33 changer transitions 598/967 dead transitions. [2025-03-14 22:35:39,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 967 transitions, 15154 flow [2025-03-14 22:35:39,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:35:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:35:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1917 transitions. [2025-03-14 22:35:39,352 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6520408163265307 [2025-03-14 22:35:39,352 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 138 predicate places. [2025-03-14 22:35:39,352 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 967 transitions, 15154 flow [2025-03-14 22:35:39,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.75) internal successors, (1101), 12 states have internal predecessors, (1101), 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-14 22:35:39,353 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:39,353 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] [2025-03-14 22:35:39,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 22:35:39,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:39,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1659780853, now seen corresponding path program 2 times [2025-03-14 22:35:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236898254] [2025-03-14 22:35:39,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:35:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:39,363 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:35:39,364 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:39,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-14 22:35:39,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:39,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236898254] [2025-03-14 22:35:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236898254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:39,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 22:35:39,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260493425] [2025-03-14 22:35:39,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:39,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 22:35:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:39,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 22:35:39,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 22:35:39,434 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 147 [2025-03-14 22:35:39,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 967 transitions, 15154 flow. Second operand has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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-14 22:35:39,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:39,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 147 [2025-03-14 22:35:39,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:39,935 INFO L124 PetriNetUnfolderBase]: 804/3561 cut-off events. [2025-03-14 22:35:39,935 INFO L125 PetriNetUnfolderBase]: For 30263/32177 co-relation queries the response was YES. [2025-03-14 22:35:39,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 3561 events. 804/3561 cut-off events. For 30263/32177 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 33887 event pairs, 101 based on Foata normal form. 31/3320 useless extension candidates. Maximal degree in co-relation 15952. Up to 1440 conditions per place. [2025-03-14 22:35:39,952 INFO L140 encePairwiseOnDemand]: 135/147 looper letters, 75 selfloop transitions, 10 changer transitions 517/737 dead transitions. [2025-03-14 22:35:39,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 737 transitions, 12125 flow [2025-03-14 22:35:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 22:35:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 22:35:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 873 transitions. [2025-03-14 22:35:39,954 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7423469387755102 [2025-03-14 22:35:39,954 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 142 predicate places. [2025-03-14 22:35:39,954 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 737 transitions, 12125 flow [2025-03-14 22:35:39,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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-14 22:35:39,954 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:35:39,954 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] [2025-03-14 22:35:39,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 22:35:39,955 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:35:39,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:35:39,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1063687941, now seen corresponding path program 2 times [2025-03-14 22:35:39,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:35:39,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176392259] [2025-03-14 22:35:39,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:35:39,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:35:39,966 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:35:39,966 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:35:40,119 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-14 22:35:40,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:35:40,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176392259] [2025-03-14 22:35:40,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176392259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:35:40,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:35:40,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:35:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596970999] [2025-03-14 22:35:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:35:40,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:35:40,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:35:40,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:35:40,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:35:40,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 147 [2025-03-14 22:35:40,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 737 transitions, 12125 flow. Second operand has 12 states, 12 states have (on average 91.75) internal successors, (1101), 12 states have internal predecessors, (1101), 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-14 22:35:40,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:35:40,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 147 [2025-03-14 22:35:40,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:35:41,070 INFO L124 PetriNetUnfolderBase]: 977/3800 cut-off events. [2025-03-14 22:35:41,070 INFO L125 PetriNetUnfolderBase]: For 31973/32986 co-relation queries the response was YES. [2025-03-14 22:35:41,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23123 conditions, 3800 events. 977/3800 cut-off events. For 31973/32986 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 35834 event pairs, 148 based on Foata normal form. 16/3531 useless extension candidates. Maximal degree in co-relation 20609. Up to 1553 conditions per place. [2025-03-14 22:35:41,091 INFO L140 encePairwiseOnDemand]: 128/147 looper letters, 0 selfloop transitions, 0 changer transitions 766/766 dead transitions. [2025-03-14 22:35:41,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 766 transitions, 12749 flow [2025-03-14 22:35:41,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:35:41,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:35:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1818 transitions. [2025-03-14 22:35:41,094 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6509129967776585 [2025-03-14 22:35:41,095 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 151 predicate places. [2025-03-14 22:35:41,095 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 766 transitions, 12749 flow [2025-03-14 22:35:41,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.75) internal successors, (1101), 12 states have internal predecessors, (1101), 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-14 22:35:41,102 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-bakery-2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-14 22:35:41,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:35:41,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:35:41,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:35:41,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 22:35:41,150 INFO L422 BasicCegarLoop]: Path program histogram: [9, 2, 2] [2025-03-14 22:35:41,152 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:35:41,153 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:35:41,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:35:41 BasicIcfg [2025-03-14 22:35:41,157 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:35:41,158 INFO L158 Benchmark]: Toolchain (without parser) took 12636.26ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 44.2MB in the beginning and 601.0MB in the end (delta: -556.8MB). Peak memory consumption was 474.3MB. Max. memory is 8.0GB. [2025-03-14 22:35:41,158 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:35:41,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.25ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 32.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:35:41,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.85ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 30.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:35:41,158 INFO L158 Benchmark]: Boogie Preprocessor took 21.36ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 29.9MB in the end (delta: 855.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:35:41,159 INFO L158 Benchmark]: RCFGBuilder took 358.78ms. Allocated memory is still 71.3MB. Free memory was 29.7MB in the beginning and 41.3MB in the end (delta: -11.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2025-03-14 22:35:41,160 INFO L158 Benchmark]: TraceAbstraction took 12070.72ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 40.4MB in the beginning and 601.0MB in the end (delta: -560.6MB). Peak memory consumption was 471.2MB. Max. memory is 8.0GB. [2025-03-14 22:35:41,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 147.25ms. Allocated memory is still 71.3MB. Free memory was 44.0MB in the beginning and 32.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.85ms. Allocated memory is still 71.3MB. Free memory was 32.3MB in the beginning and 30.7MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.36ms. Allocated memory is still 71.3MB. Free memory was 30.7MB in the beginning and 29.9MB in the end (delta: 855.8kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 358.78ms. Allocated memory is still 71.3MB. Free memory was 29.7MB in the beginning and 41.3MB in the end (delta: -11.5MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12070.72ms. Allocated memory was 71.3MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 40.4MB in the beginning and 601.0MB in the end (delta: -560.6MB). Peak memory consumption was 471.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 98]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 202 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1085 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1085 mSDsluCounter, 2211 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1682 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3310 IncrementalHoareTripleChecker+Invalid, 3421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 529 mSDtfsCounter, 3310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15154occurred in iteration=11, InterpolantAutomatonStates: 184, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1616 NumberOfCodeBlocks, 1616 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1603 ConstructedInterpolants, 0 QuantifiedInterpolants, 3596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 22:35:41,174 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...