/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/chl-file-item-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:11:15,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:11:15,187 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:11:15,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:11:15,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:11:15,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:11:15,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:11:15,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:11:15,212 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:11:15,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:11:15,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:11:15,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:11:15,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:11:15,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:11:15,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:11:15,214 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:11:15,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:11:15,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:11:15,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:11:15,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:11:15,214 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:11:15,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:11:15,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:11:15,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:11:15,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:11:15,507 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:11:15,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2025-03-14 22:11:16,649 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f235168/4074b0c2119241caaccd770d9191cd7a/FLAGe27d7fc11 [2025-03-14 22:11:16,808 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:11:16,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2025-03-14 22:11:16,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f235168/4074b0c2119241caaccd770d9191cd7a/FLAGe27d7fc11 [2025-03-14 22:11:17,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f235168/4074b0c2119241caaccd770d9191cd7a [2025-03-14 22:11:17,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:11:17,228 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:11:17,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:11:17,234 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:11:17,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:11:17,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f8bc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17, skipping insertion in model container [2025-03-14 22:11:17,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:11:17,378 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/chl-file-item-symm.wvr.c[2521,2534] [2025-03-14 22:11:17,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:11:17,394 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:11:17,413 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/chl-file-item-symm.wvr.c[2521,2534] [2025-03-14 22:11:17,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:11:17,427 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:11:17,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17 WrapperNode [2025-03-14 22:11:17,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:11:17,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:11:17,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:11:17,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:11:17,433 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:11:17" (1/1) ... [2025-03-14 22:11:17,438 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:11:17" (1/1) ... [2025-03-14 22:11:17,456 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 141 [2025-03-14 22:11:17,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:11:17,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:11:17,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:11:17,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:11:17,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:11:17,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:11:17,485 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:11:17,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:11:17,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (1/1) ... [2025-03-14 22:11:17,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:11:17,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:11:17,513 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:11:17,514 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:11:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:11:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:11:17,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:11:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:11:17,532 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:11:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:11:17,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:11:17,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:11:17,533 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:11:17,589 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:11:17,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:11:17,872 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:11:17,872 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:11:17,883 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:11:17,883 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:11:17,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:11:17 BoogieIcfgContainer [2025-03-14 22:11:17,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:11:17,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:11:17,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:11:17,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:11:17,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:11:17" (1/3) ... [2025-03-14 22:11:17,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4830f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:11:17, skipping insertion in model container [2025-03-14 22:11:17,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:11:17" (2/3) ... [2025-03-14 22:11:17,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4830f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:11:17, skipping insertion in model container [2025-03-14 22:11:17,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:11:17" (3/3) ... [2025-03-14 22:11:17,894 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2025-03-14 22:11:17,906 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:11:17,907 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-symm.wvr.c that has 3 procedures, 176 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-14 22:11:17,908 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:11:17,977 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:11:18,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:11:18,027 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;@337f3914, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:11:18,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:11:18,105 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:11:18,106 INFO L124 PetriNetUnfolderBase]: 15/182 cut-off events. [2025-03-14 22:11:18,108 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:11:18,108 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:18,108 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] [2025-03-14 22:11:18,109 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:11:18,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1984296199, now seen corresponding path program 1 times [2025-03-14 22:11:18,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:18,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264356293] [2025-03-14 22:11:18,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:11:18,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:11:19,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264356293] [2025-03-14 22:11:19,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264356293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:19,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:19,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996893046] [2025-03-14 22:11:19,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:19,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:19,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:19,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:19,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:19,043 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:19,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 190 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:19,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:19,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:19,736 INFO L124 PetriNetUnfolderBase]: 160/1026 cut-off events. [2025-03-14 22:11:19,737 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-14 22:11:19,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 1026 events. 160/1026 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7138 event pairs, 48 based on Foata normal form. 50/966 useless extension candidates. Maximal degree in co-relation 1104. Up to 145 conditions per place. [2025-03-14 22:11:19,754 INFO L140 encePairwiseOnDemand]: 165/190 looper letters, 117 selfloop transitions, 5 changer transitions 44/295 dead transitions. [2025-03-14 22:11:19,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 295 transitions, 973 flow [2025-03-14 22:11:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:19,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2901 transitions. [2025-03-14 22:11:19,777 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.763421052631579 [2025-03-14 22:11:19,780 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 12 predicate places. [2025-03-14 22:11:19,780 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 295 transitions, 973 flow [2025-03-14 22:11:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:19,781 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:19,781 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:19,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:11:19,782 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:11:19,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash -933281797, now seen corresponding path program 2 times [2025-03-14 22:11:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040881881] [2025-03-14 22:11:19,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:19,821 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:19,821 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:20,148 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:11:20,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:20,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040881881] [2025-03-14 22:11:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040881881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:20,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679445146] [2025-03-14 22:11:20,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:20,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:20,154 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:20,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 295 transitions, 973 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:20,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:20,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:20,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:20,747 INFO L124 PetriNetUnfolderBase]: 212/1358 cut-off events. [2025-03-14 22:11:20,747 INFO L125 PetriNetUnfolderBase]: For 363/521 co-relation queries the response was YES. [2025-03-14 22:11:20,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1358 events. 212/1358 cut-off events. For 363/521 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 10439 event pairs, 42 based on Foata normal form. 23/1265 useless extension candidates. Maximal degree in co-relation 1748. Up to 271 conditions per place. [2025-03-14 22:11:20,755 INFO L140 encePairwiseOnDemand]: 173/190 looper letters, 244 selfloop transitions, 20 changer transitions 89/482 dead transitions. [2025-03-14 22:11:20,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 482 transitions, 2478 flow [2025-03-14 22:11:20,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2869 transitions. [2025-03-14 22:11:20,762 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.755 [2025-03-14 22:11:20,763 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 31 predicate places. [2025-03-14 22:11:20,763 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 482 transitions, 2478 flow [2025-03-14 22:11:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:20,764 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:20,764 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] [2025-03-14 22:11:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:11:20,765 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:11:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash -223672023, now seen corresponding path program 3 times [2025-03-14 22:11:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961323135] [2025-03-14 22:11:20,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:20,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:20,790 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:20,793 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:21,070 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:11:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961323135] [2025-03-14 22:11:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961323135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618536554] [2025-03-14 22:11:21,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:21,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:21,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:21,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:21,072 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:21,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 482 transitions, 2478 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:21,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:21,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:21,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:21,521 INFO L124 PetriNetUnfolderBase]: 223/1484 cut-off events. [2025-03-14 22:11:21,521 INFO L125 PetriNetUnfolderBase]: For 777/1284 co-relation queries the response was YES. [2025-03-14 22:11:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3721 conditions, 1484 events. 223/1484 cut-off events. For 777/1284 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11905 event pairs, 42 based on Foata normal form. 40/1403 useless extension candidates. Maximal degree in co-relation 2259. Up to 287 conditions per place. [2025-03-14 22:11:21,528 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 277 selfloop transitions, 22 changer transitions 126/554 dead transitions. [2025-03-14 22:11:21,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 554 transitions, 3787 flow [2025-03-14 22:11:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:11:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:11:21,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2724 transitions. [2025-03-14 22:11:21,533 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7545706371191135 [2025-03-14 22:11:21,533 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 49 predicate places. [2025-03-14 22:11:21,534 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 554 transitions, 3787 flow [2025-03-14 22:11:21,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:21,534 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:21,534 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] [2025-03-14 22:11:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 22:11:21,535 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:11:21,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash -363707811, now seen corresponding path program 4 times [2025-03-14 22:11:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753588839] [2025-03-14 22:11:21,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:21,550 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:21,551 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:21,769 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:11:21,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:21,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753588839] [2025-03-14 22:11:21,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753588839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:21,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973949349] [2025-03-14 22:11:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:21,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:21,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:21,772 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:21,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 554 transitions, 3787 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:21,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:21,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:21,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:22,210 INFO L124 PetriNetUnfolderBase]: 224/1530 cut-off events. [2025-03-14 22:11:22,211 INFO L125 PetriNetUnfolderBase]: For 1322/2067 co-relation queries the response was YES. [2025-03-14 22:11:22,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4589 conditions, 1530 events. 224/1530 cut-off events. For 1322/2067 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 12449 event pairs, 42 based on Foata normal form. 32/1439 useless extension candidates. Maximal degree in co-relation 2672. Up to 340 conditions per place. [2025-03-14 22:11:22,217 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 271 selfloop transitions, 23 changer transitions 156/579 dead transitions. [2025-03-14 22:11:22,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 579 transitions, 4896 flow [2025-03-14 22:11:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2428 transitions. [2025-03-14 22:11:22,221 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7517027863777089 [2025-03-14 22:11:22,222 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 65 predicate places. [2025-03-14 22:11:22,222 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 579 transitions, 4896 flow [2025-03-14 22:11:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:22,223 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:22,223 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] [2025-03-14 22:11:22,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:11:22,223 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:11:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1381819083, now seen corresponding path program 5 times [2025-03-14 22:11:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619694725] [2025-03-14 22:11:22,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:22,244 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:22,244 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:22,495 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:11:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:22,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619694725] [2025-03-14 22:11:22,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619694725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:22,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:22,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:22,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563310223] [2025-03-14 22:11:22,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:22,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:22,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:22,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:22,497 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:22,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 579 transitions, 4896 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:22,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:22,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:22,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:22,915 INFO L124 PetriNetUnfolderBase]: 224/1508 cut-off events. [2025-03-14 22:11:22,915 INFO L125 PetriNetUnfolderBase]: For 2006/3166 co-relation queries the response was YES. [2025-03-14 22:11:22,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1508 events. 224/1508 cut-off events. For 2006/3166 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 12233 event pairs, 39 based on Foata normal form. 29/1414 useless extension candidates. Maximal degree in co-relation 3442. Up to 343 conditions per place. [2025-03-14 22:11:22,924 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 248 selfloop transitions, 15 changer transitions 184/576 dead transitions. [2025-03-14 22:11:22,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 576 transitions, 5760 flow [2025-03-14 22:11:22,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2290 transitions. [2025-03-14 22:11:22,928 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7532894736842105 [2025-03-14 22:11:22,929 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 80 predicate places. [2025-03-14 22:11:22,929 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 576 transitions, 5760 flow [2025-03-14 22:11:22,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:22,929 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:22,930 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] [2025-03-14 22:11:22,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:11:22,930 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:11:22,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 153184731, now seen corresponding path program 6 times [2025-03-14 22:11:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616204266] [2025-03-14 22:11:22,930 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:11:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:22,946 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:11:22,947 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:23,116 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:11:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616204266] [2025-03-14 22:11:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616204266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292837714] [2025-03-14 22:11:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:23,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:23,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:23,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:23,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:23,118 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:23,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 576 transitions, 5760 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:23,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:23,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:23,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:23,619 INFO L124 PetriNetUnfolderBase]: 237/1662 cut-off events. [2025-03-14 22:11:23,619 INFO L125 PetriNetUnfolderBase]: For 3281/4934 co-relation queries the response was YES. [2025-03-14 22:11:23,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6949 conditions, 1662 events. 237/1662 cut-off events. For 3281/4934 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14106 event pairs, 31 based on Foata normal form. 36/1586 useless extension candidates. Maximal degree in co-relation 3780. Up to 405 conditions per place. [2025-03-14 22:11:23,627 INFO L140 encePairwiseOnDemand]: 170/190 looper letters, 328 selfloop transitions, 21 changer transitions 224/702 dead transitions. [2025-03-14 22:11:23,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 702 transitions, 8463 flow [2025-03-14 22:11:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2880 transitions. [2025-03-14 22:11:23,632 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7578947368421053 [2025-03-14 22:11:23,633 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 99 predicate places. [2025-03-14 22:11:23,633 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 702 transitions, 8463 flow [2025-03-14 22:11:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:23,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:23,636 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] [2025-03-14 22:11:23,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:11:23,636 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:11:23,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash -13636651, now seen corresponding path program 7 times [2025-03-14 22:11:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48063718] [2025-03-14 22:11:23,637 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:11:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:23,829 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:11:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48063718] [2025-03-14 22:11:23,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48063718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:23,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:23,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467560839] [2025-03-14 22:11:23,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:23,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:23,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:23,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:23,831 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:23,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 702 transitions, 8463 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:23,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:23,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:23,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:24,351 INFO L124 PetriNetUnfolderBase]: 250/1812 cut-off events. [2025-03-14 22:11:24,351 INFO L125 PetriNetUnfolderBase]: For 4451/6121 co-relation queries the response was YES. [2025-03-14 22:11:24,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8544 conditions, 1812 events. 250/1812 cut-off events. For 4451/6121 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16014 event pairs, 31 based on Foata normal form. 65/1757 useless extension candidates. Maximal degree in co-relation 4521. Up to 477 conditions per place. [2025-03-14 22:11:24,360 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 355 selfloop transitions, 16 changer transitions 259/759 dead transitions. [2025-03-14 22:11:24,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 759 transitions, 10536 flow [2025-03-14 22:11:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2880 transitions. [2025-03-14 22:11:24,366 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7578947368421053 [2025-03-14 22:11:24,367 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 118 predicate places. [2025-03-14 22:11:24,367 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 759 transitions, 10536 flow [2025-03-14 22:11:24,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:24,368 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:24,368 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] [2025-03-14 22:11:24,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 22:11:24,368 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:11:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1646176999, now seen corresponding path program 8 times [2025-03-14 22:11:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:24,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359849027] [2025-03-14 22:11:24,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:24,380 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:24,380 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:24,531 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:11:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359849027] [2025-03-14 22:11:24,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359849027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:24,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:24,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733512511] [2025-03-14 22:11:24,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:24,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:24,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:24,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:24,533 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:24,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 759 transitions, 10536 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:24,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:24,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:24,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:25,032 INFO L124 PetriNetUnfolderBase]: 261/1934 cut-off events. [2025-03-14 22:11:25,032 INFO L125 PetriNetUnfolderBase]: For 5427/7566 co-relation queries the response was YES. [2025-03-14 22:11:25,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9902 conditions, 1934 events. 261/1934 cut-off events. For 5427/7566 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17389 event pairs, 28 based on Foata normal form. 49/1850 useless extension candidates. Maximal degree in co-relation 6083. Up to 502 conditions per place. [2025-03-14 22:11:25,046 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 358 selfloop transitions, 19 changer transitions 288/794 dead transitions. [2025-03-14 22:11:25,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 794 transitions, 12435 flow [2025-03-14 22:11:25,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:25,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2586 transitions. [2025-03-14 22:11:25,049 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.756140350877193 [2025-03-14 22:11:25,052 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 135 predicate places. [2025-03-14 22:11:25,052 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 794 transitions, 12435 flow [2025-03-14 22:11:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:25,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:25,052 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] [2025-03-14 22:11:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:11:25,053 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:11:25,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 252352979, now seen corresponding path program 9 times [2025-03-14 22:11:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289064919] [2025-03-14 22:11:25,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:25,069 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:25,069 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:25,209 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:11:25,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:25,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289064919] [2025-03-14 22:11:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289064919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:25,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425569027] [2025-03-14 22:11:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:25,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:25,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:25,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:25,211 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:25,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 794 transitions, 12435 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:25,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:25,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:25,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:25,744 INFO L124 PetriNetUnfolderBase]: 258/1906 cut-off events. [2025-03-14 22:11:25,744 INFO L125 PetriNetUnfolderBase]: For 7194/9109 co-relation queries the response was YES. [2025-03-14 22:11:25,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11148 conditions, 1906 events. 258/1906 cut-off events. For 7194/9109 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17055 event pairs, 31 based on Foata normal form. 32/1814 useless extension candidates. Maximal degree in co-relation 5663. Up to 530 conditions per place. [2025-03-14 22:11:25,760 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 356 selfloop transitions, 20 changer transitions 318/823 dead transitions. [2025-03-14 22:11:25,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 823 transitions, 14360 flow [2025-03-14 22:11:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2586 transitions. [2025-03-14 22:11:25,764 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.756140350877193 [2025-03-14 22:11:25,764 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 152 predicate places. [2025-03-14 22:11:25,764 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 823 transitions, 14360 flow [2025-03-14 22:11:25,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:25,765 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:25,766 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] [2025-03-14 22:11:25,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:11:25,766 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:11:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:25,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1507596953, now seen corresponding path program 10 times [2025-03-14 22:11:25,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:25,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924794992] [2025-03-14 22:11:25,766 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:25,775 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:25,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:25,929 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:11:25,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924794992] [2025-03-14 22:11:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924794992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:25,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:25,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:25,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862077844] [2025-03-14 22:11:25,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:25,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:25,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:25,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:25,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:25,933 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:25,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 823 transitions, 14360 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:25,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:25,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:25,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:26,428 INFO L124 PetriNetUnfolderBase]: 257/1958 cut-off events. [2025-03-14 22:11:26,428 INFO L125 PetriNetUnfolderBase]: For 9374/11915 co-relation queries the response was YES. [2025-03-14 22:11:26,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12415 conditions, 1958 events. 257/1958 cut-off events. For 9374/11915 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 17765 event pairs, 28 based on Foata normal form. 26/1857 useless extension candidates. Maximal degree in co-relation 6173. Up to 547 conditions per place. [2025-03-14 22:11:26,438 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 353 selfloop transitions, 12 changer transitions 349/843 dead transitions. [2025-03-14 22:11:26,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 843 transitions, 16194 flow [2025-03-14 22:11:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2448 transitions. [2025-03-14 22:11:26,442 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7578947368421053 [2025-03-14 22:11:26,443 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 168 predicate places. [2025-03-14 22:11:26,443 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 843 transitions, 16194 flow [2025-03-14 22:11:26,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:26,444 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:26,444 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] [2025-03-14 22:11:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:11:26,444 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:11:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1457507537, now seen corresponding path program 11 times [2025-03-14 22:11:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687904961] [2025-03-14 22:11:26,445 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:26,453 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:26,453 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:26,597 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:11:26,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:26,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687904961] [2025-03-14 22:11:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687904961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:26,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:26,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567496431] [2025-03-14 22:11:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:26,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:26,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:26,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:26,599 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:26,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 843 transitions, 16194 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:26,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:26,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:26,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:27,114 INFO L124 PetriNetUnfolderBase]: 263/2019 cut-off events. [2025-03-14 22:11:27,114 INFO L125 PetriNetUnfolderBase]: For 11110/14871 co-relation queries the response was YES. [2025-03-14 22:11:27,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13476 conditions, 2019 events. 263/2019 cut-off events. For 11110/14871 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 18419 event pairs, 25 based on Foata normal form. 61/1944 useless extension candidates. Maximal degree in co-relation 8015. Up to 544 conditions per place. [2025-03-14 22:11:27,125 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 325 selfloop transitions, 7 changer transitions 379/840 dead transitions. [2025-03-14 22:11:27,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 840 transitions, 17550 flow [2025-03-14 22:11:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2451 transitions. [2025-03-14 22:11:27,128 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7588235294117647 [2025-03-14 22:11:27,128 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 184 predicate places. [2025-03-14 22:11:27,128 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 840 transitions, 17550 flow [2025-03-14 22:11:27,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:27,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:27,129 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] [2025-03-14 22:11:27,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 22:11:27,129 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:11:27,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:27,130 INFO L85 PathProgramCache]: Analyzing trace with hash 29906045, now seen corresponding path program 12 times [2025-03-14 22:11:27,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:27,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658197251] [2025-03-14 22:11:27,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:11:27,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:27,137 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:11:27,138 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:27,308 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:11:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658197251] [2025-03-14 22:11:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658197251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882661806] [2025-03-14 22:11:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:27,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:27,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:27,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:27,311 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:27,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 840 transitions, 17550 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:27,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:27,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:27,842 INFO L124 PetriNetUnfolderBase]: 262/1998 cut-off events. [2025-03-14 22:11:27,842 INFO L125 PetriNetUnfolderBase]: For 14173/17568 co-relation queries the response was YES. [2025-03-14 22:11:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14920 conditions, 1998 events. 262/1998 cut-off events. For 14173/17568 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 18210 event pairs, 31 based on Foata normal form. 28/1899 useless extension candidates. Maximal degree in co-relation 7325. Up to 569 conditions per place. [2025-03-14 22:11:27,854 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 315 selfloop transitions, 23 changer transitions 408/875 dead transitions. [2025-03-14 22:11:27,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 875 transitions, 19891 flow [2025-03-14 22:11:27,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2447 transitions. [2025-03-14 22:11:27,856 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7575851393188855 [2025-03-14 22:11:27,856 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 200 predicate places. [2025-03-14 22:11:27,857 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 875 transitions, 19891 flow [2025-03-14 22:11:27,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:27,857 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:27,857 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] [2025-03-14 22:11:27,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 22:11:27,857 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:11:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1095085181, now seen corresponding path program 13 times [2025-03-14 22:11:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:27,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651356675] [2025-03-14 22:11:27,858 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:11:27,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:27,998 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:11:27,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:27,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651356675] [2025-03-14 22:11:27,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651356675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:27,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:27,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613819117] [2025-03-14 22:11:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:27,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:27,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:27,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:28,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:28,000 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:28,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 875 transitions, 19891 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:28,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:28,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:28,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:28,555 INFO L124 PetriNetUnfolderBase]: 265/2071 cut-off events. [2025-03-14 22:11:28,555 INFO L125 PetriNetUnfolderBase]: For 17055/20742 co-relation queries the response was YES. [2025-03-14 22:11:28,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16466 conditions, 2071 events. 265/2071 cut-off events. For 17055/20742 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 19129 event pairs, 31 based on Foata normal form. 32/1974 useless extension candidates. Maximal degree in co-relation 7951. Up to 595 conditions per place. [2025-03-14 22:11:28,566 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 311 selfloop transitions, 22 changer transitions 442/904 dead transitions. [2025-03-14 22:11:28,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 904 transitions, 22207 flow [2025-03-14 22:11:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:28,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2878 transitions. [2025-03-14 22:11:28,572 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7573684210526316 [2025-03-14 22:11:28,572 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 219 predicate places. [2025-03-14 22:11:28,573 INFO L471 AbstractCegarLoop]: Abstraction has has 401 places, 904 transitions, 22207 flow [2025-03-14 22:11:28,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:28,573 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:28,573 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] [2025-03-14 22:11:28,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 22:11:28,573 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:28,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:28,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1023839905, now seen corresponding path program 14 times [2025-03-14 22:11:28,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279702216] [2025-03-14 22:11:28,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:28,587 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:28,587 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:28,701 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:11:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:28,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279702216] [2025-03-14 22:11:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279702216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:28,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111496002] [2025-03-14 22:11:28,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:28,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:28,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:28,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:28,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:28,703 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:28,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 904 transitions, 22207 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:28,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:28,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:28,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:29,258 INFO L124 PetriNetUnfolderBase]: 272/2172 cut-off events. [2025-03-14 22:11:29,259 INFO L125 PetriNetUnfolderBase]: For 17490/21449 co-relation queries the response was YES. [2025-03-14 22:11:29,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18032 conditions, 2172 events. 272/2172 cut-off events. For 17490/21449 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 20485 event pairs, 25 based on Foata normal form. 23/2053 useless extension candidates. Maximal degree in co-relation 10387. Up to 618 conditions per place. [2025-03-14 22:11:29,272 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 311 selfloop transitions, 14 changer transitions 474/928 dead transitions. [2025-03-14 22:11:29,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 928 transitions, 24489 flow [2025-03-14 22:11:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2585 transitions. [2025-03-14 22:11:29,274 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7558479532163743 [2025-03-14 22:11:29,274 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 236 predicate places. [2025-03-14 22:11:29,274 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 928 transitions, 24489 flow [2025-03-14 22:11:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:29,275 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:29,275 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] [2025-03-14 22:11:29,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 22:11:29,275 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -675152845, now seen corresponding path program 15 times [2025-03-14 22:11:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685449178] [2025-03-14 22:11:29,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:29,283 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:29,283 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:29,409 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:11:29,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685449178] [2025-03-14 22:11:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685449178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:29,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:29,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:29,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829032954] [2025-03-14 22:11:29,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:29,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:29,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:29,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:29,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:29,411 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:29,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 928 transitions, 24489 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:29,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:29,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:29,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:30,084 INFO L124 PetriNetUnfolderBase]: 281/2318 cut-off events. [2025-03-14 22:11:30,084 INFO L125 PetriNetUnfolderBase]: For 23306/28501 co-relation queries the response was YES. [2025-03-14 22:11:30,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20403 conditions, 2318 events. 281/2318 cut-off events. For 23306/28501 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 22242 event pairs, 28 based on Foata normal form. 37/2209 useless extension candidates. Maximal degree in co-relation 10090. Up to 671 conditions per place. [2025-03-14 22:11:30,100 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 345 selfloop transitions, 15 changer transitions 509/998 dead transitions. [2025-03-14 22:11:30,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 998 transitions, 28348 flow [2025-03-14 22:11:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2879 transitions. [2025-03-14 22:11:30,102 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7576315789473684 [2025-03-14 22:11:30,103 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 255 predicate places. [2025-03-14 22:11:30,103 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 998 transitions, 28348 flow [2025-03-14 22:11:30,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:30,103 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:30,103 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] [2025-03-14 22:11:30,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 22:11:30,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:30,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 202122547, now seen corresponding path program 16 times [2025-03-14 22:11:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:30,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437040737] [2025-03-14 22:11:30,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:30,115 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:30,115 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:30,256 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:11:30,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:30,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437040737] [2025-03-14 22:11:30,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437040737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:30,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:30,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127668413] [2025-03-14 22:11:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:30,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:30,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:30,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:30,258 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:30,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 998 transitions, 28348 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:30,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:30,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:30,842 INFO L124 PetriNetUnfolderBase]: 282/2340 cut-off events. [2025-03-14 22:11:30,843 INFO L125 PetriNetUnfolderBase]: For 25375/30470 co-relation queries the response was YES. [2025-03-14 22:11:30,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22040 conditions, 2340 events. 282/2340 cut-off events. For 25375/30470 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 22536 event pairs, 28 based on Foata normal form. 59/2251 useless extension candidates. Maximal degree in co-relation 11643. Up to 693 conditions per place. [2025-03-14 22:11:30,859 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 333 selfloop transitions, 22 changer transitions 539/1023 dead transitions. [2025-03-14 22:11:30,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 1023 transitions, 30945 flow [2025-03-14 22:11:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:30,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2291 transitions. [2025-03-14 22:11:30,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7536184210526315 [2025-03-14 22:11:30,889 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 270 predicate places. [2025-03-14 22:11:30,889 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 1023 transitions, 30945 flow [2025-03-14 22:11:30,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:30,890 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:30,890 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] [2025-03-14 22:11:30,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 22:11:30,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2135242913, now seen corresponding path program 17 times [2025-03-14 22:11:30,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:30,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853839037] [2025-03-14 22:11:30,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:30,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:30,899 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:30,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:31,023 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:11:31,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:31,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853839037] [2025-03-14 22:11:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853839037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801964559] [2025-03-14 22:11:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:31,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:31,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:31,025 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:31,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1023 transitions, 30945 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:31,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:31,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:31,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:31,691 INFO L124 PetriNetUnfolderBase]: 283/2394 cut-off events. [2025-03-14 22:11:31,691 INFO L125 PetriNetUnfolderBase]: For 26849/31384 co-relation queries the response was YES. [2025-03-14 22:11:31,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23761 conditions, 2394 events. 283/2394 cut-off events. For 26849/31384 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 23292 event pairs, 25 based on Foata normal form. 41/2284 useless extension candidates. Maximal degree in co-relation 13192. Up to 715 conditions per place. [2025-03-14 22:11:31,705 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 335 selfloop transitions, 16 changer transitions 568/1048 dead transitions. [2025-03-14 22:11:31,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1048 transitions, 33642 flow [2025-03-14 22:11:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2585 transitions. [2025-03-14 22:11:31,708 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7558479532163743 [2025-03-14 22:11:31,708 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 287 predicate places. [2025-03-14 22:11:31,708 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 1048 transitions, 33642 flow [2025-03-14 22:11:31,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:31,709 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:31,709 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] [2025-03-14 22:11:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 22:11:31,710 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:31,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash -602550023, now seen corresponding path program 18 times [2025-03-14 22:11:31,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:31,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34545450] [2025-03-14 22:11:31,711 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:11:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:31,723 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:11:31,723 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:31,853 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:11:31,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:31,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34545450] [2025-03-14 22:11:31,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34545450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:31,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:31,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:31,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323637006] [2025-03-14 22:11:31,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:31,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:31,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:31,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:31,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:31,855 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:31,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 1048 transitions, 33642 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:31,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:31,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:32,595 INFO L124 PetriNetUnfolderBase]: 285/2410 cut-off events. [2025-03-14 22:11:32,595 INFO L125 PetriNetUnfolderBase]: For 30402/35045 co-relation queries the response was YES. [2025-03-14 22:11:32,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25550 conditions, 2410 events. 285/2410 cut-off events. For 30402/35045 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 23429 event pairs, 28 based on Foata normal form. 61/2319 useless extension candidates. Maximal degree in co-relation 11398. Up to 737 conditions per place. [2025-03-14 22:11:32,611 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 330 selfloop transitions, 17 changer transitions 600/1076 dead transitions. [2025-03-14 22:11:32,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1076 transitions, 36553 flow [2025-03-14 22:11:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:11:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:11:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2724 transitions. [2025-03-14 22:11:32,613 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7545706371191135 [2025-03-14 22:11:32,613 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 305 predicate places. [2025-03-14 22:11:32,613 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 1076 transitions, 36553 flow [2025-03-14 22:11:32,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:32,614 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:32,614 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] [2025-03-14 22:11:32,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 22:11:32,614 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:32,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 576736293, now seen corresponding path program 19 times [2025-03-14 22:11:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:32,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178600089] [2025-03-14 22:11:32,615 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:11:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:32,743 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:11:32,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:32,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178600089] [2025-03-14 22:11:32,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178600089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:32,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:32,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:32,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130662438] [2025-03-14 22:11:32,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:32,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:32,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:32,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:32,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:32,745 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:32,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 1076 transitions, 36553 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:32,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:32,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:32,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:33,418 INFO L124 PetriNetUnfolderBase]: 285/2449 cut-off events. [2025-03-14 22:11:33,419 INFO L125 PetriNetUnfolderBase]: For 34372/39883 co-relation queries the response was YES. [2025-03-14 22:11:33,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26809 conditions, 2449 events. 285/2449 cut-off events. For 34372/39883 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 24072 event pairs, 25 based on Foata normal form. 81/2378 useless extension candidates. Maximal degree in co-relation 14764. Up to 734 conditions per place. [2025-03-14 22:11:33,434 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 304 selfloop transitions, 12 changer transitions 628/1073 dead transitions. [2025-03-14 22:11:33,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 1073 transitions, 38327 flow [2025-03-14 22:11:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2427 transitions. [2025-03-14 22:11:33,436 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7513931888544891 [2025-03-14 22:11:33,437 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 321 predicate places. [2025-03-14 22:11:33,437 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 1073 transitions, 38327 flow [2025-03-14 22:11:33,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:33,437 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:33,438 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] [2025-03-14 22:11:33,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 22:11:33,438 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:33,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:33,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1947360979, now seen corresponding path program 20 times [2025-03-14 22:11:33,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898229215] [2025-03-14 22:11:33,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:33,448 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:33,449 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:33,559 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:11:33,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:33,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898229215] [2025-03-14 22:11:33,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898229215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:33,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:33,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995979775] [2025-03-14 22:11:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:33,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:33,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:33,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:33,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:33,561 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 190 [2025-03-14 22:11:33,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1073 transitions, 38327 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:33,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:33,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 190 [2025-03-14 22:11:33,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:34,229 INFO L124 PetriNetUnfolderBase]: 285/2405 cut-off events. [2025-03-14 22:11:34,229 INFO L125 PetriNetUnfolderBase]: For 37110/42109 co-relation queries the response was YES. [2025-03-14 22:11:34,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27979 conditions, 2405 events. 285/2405 cut-off events. For 37110/42109 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 23482 event pairs, 28 based on Foata normal form. 26/2281 useless extension candidates. Maximal degree in co-relation 14514. Up to 731 conditions per place. [2025-03-14 22:11:34,243 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 277 selfloop transitions, 6 changer transitions 658/1070 dead transitions. [2025-03-14 22:11:34,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1070 transitions, 40089 flow [2025-03-14 22:11:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2450 transitions. [2025-03-14 22:11:34,245 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7585139318885449 [2025-03-14 22:11:34,245 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 337 predicate places. [2025-03-14 22:11:34,246 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 1070 transitions, 40089 flow [2025-03-14 22:11:34,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 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:11:34,246 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:34,246 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] [2025-03-14 22:11:34,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 22:11:34,246 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:34,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1080392707, now seen corresponding path program 1 times [2025-03-14 22:11:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:34,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865185467] [2025-03-14 22:11:34,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:11:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:34,344 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:11:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865185467] [2025-03-14 22:11:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865185467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:34,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:34,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931624425] [2025-03-14 22:11:34,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:34,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:34,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:34,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:34,345 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:34,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 1070 transitions, 40089 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:34,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:34,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:34,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:35,032 INFO L124 PetriNetUnfolderBase]: 330/2432 cut-off events. [2025-03-14 22:11:35,032 INFO L125 PetriNetUnfolderBase]: For 56370/61434 co-relation queries the response was YES. [2025-03-14 22:11:35,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27886 conditions, 2432 events. 330/2432 cut-off events. For 56370/61434 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 23476 event pairs, 69 based on Foata normal form. 20/2313 useless extension candidates. Maximal degree in co-relation 12608. Up to 906 conditions per place. [2025-03-14 22:11:35,046 INFO L140 encePairwiseOnDemand]: 172/190 looper letters, 210 selfloop transitions, 22 changer transitions 679/1054 dead transitions. [2025-03-14 22:11:35,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 1054 transitions, 41049 flow [2025-03-14 22:11:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2928 transitions. [2025-03-14 22:11:35,048 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7705263157894737 [2025-03-14 22:11:35,048 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 353 predicate places. [2025-03-14 22:11:35,048 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 1054 transitions, 41049 flow [2025-03-14 22:11:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:35,049 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:35,049 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] [2025-03-14 22:11:35,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-14 22:11:35,049 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:35,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash 591412973, now seen corresponding path program 2 times [2025-03-14 22:11:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:35,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712399455] [2025-03-14 22:11:35,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:35,056 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:35,056 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:35,159 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:11:35,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:35,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712399455] [2025-03-14 22:11:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712399455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:35,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:35,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479515265] [2025-03-14 22:11:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:35,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:35,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:35,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:35,160 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:35,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1054 transitions, 41049 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:35,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:35,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:35,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:35,947 INFO L124 PetriNetUnfolderBase]: 335/2362 cut-off events. [2025-03-14 22:11:35,948 INFO L125 PetriNetUnfolderBase]: For 60209/66385 co-relation queries the response was YES. [2025-03-14 22:11:35,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29948 conditions, 2362 events. 335/2362 cut-off events. For 60209/66385 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 22590 event pairs, 41 based on Foata normal form. 38/2275 useless extension candidates. Maximal degree in co-relation 13483. Up to 905 conditions per place. [2025-03-14 22:11:35,962 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 221 selfloop transitions, 16 changer transitions 723/1103 dead transitions. [2025-03-14 22:11:35,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 1103 transitions, 44378 flow [2025-03-14 22:11:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-14 22:11:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-14 22:11:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2894 transitions. [2025-03-14 22:11:35,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.761578947368421 [2025-03-14 22:11:35,964 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 372 predicate places. [2025-03-14 22:11:35,964 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 1103 transitions, 44378 flow [2025-03-14 22:11:35,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:35,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:35,965 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:11:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 22:11:35,965 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1050304439, now seen corresponding path program 3 times [2025-03-14 22:11:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:35,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922718252] [2025-03-14 22:11:35,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:35,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:35,972 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:35,972 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:36,065 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:11:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922718252] [2025-03-14 22:11:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922718252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:36,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826247093] [2025-03-14 22:11:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:36,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:36,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:36,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:36,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:36,067 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:36,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 1103 transitions, 44378 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:36,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:36,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:36,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:36,755 INFO L124 PetriNetUnfolderBase]: 365/2614 cut-off events. [2025-03-14 22:11:36,755 INFO L125 PetriNetUnfolderBase]: For 66748/73037 co-relation queries the response was YES. [2025-03-14 22:11:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33632 conditions, 2614 events. 365/2614 cut-off events. For 66748/73037 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 25792 event pairs, 35 based on Foata normal form. 39/2513 useless extension candidates. Maximal degree in co-relation 15269. Up to 1118 conditions per place. [2025-03-14 22:11:36,770 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 263 selfloop transitions, 21 changer transitions 761/1188 dead transitions. [2025-03-14 22:11:36,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 1188 transitions, 50089 flow [2025-03-14 22:11:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:11:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:11:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2750 transitions. [2025-03-14 22:11:36,771 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7617728531855956 [2025-03-14 22:11:36,772 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 390 predicate places. [2025-03-14 22:11:36,772 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 1188 transitions, 50089 flow [2025-03-14 22:11:36,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:36,772 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:36,772 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] [2025-03-14 22:11:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 22:11:36,772 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1207664029, now seen corresponding path program 4 times [2025-03-14 22:11:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826118784] [2025-03-14 22:11:36,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:36,779 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:36,779 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:36,866 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:11:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826118784] [2025-03-14 22:11:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826118784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:36,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:36,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819366056] [2025-03-14 22:11:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:36,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:36,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:36,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:36,868 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:36,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1188 transitions, 50089 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:36,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:36,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:36,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:37,693 INFO L124 PetriNetUnfolderBase]: 382/2817 cut-off events. [2025-03-14 22:11:37,694 INFO L125 PetriNetUnfolderBase]: For 78466/86545 co-relation queries the response was YES. [2025-03-14 22:11:37,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37709 conditions, 2817 events. 382/2817 cut-off events. For 78466/86545 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 28680 event pairs, 35 based on Foata normal form. 28/2700 useless extension candidates. Maximal degree in co-relation 21658. Up to 1203 conditions per place. [2025-03-14 22:11:37,710 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 282 selfloop transitions, 33 changer transitions 819/1277 dead transitions. [2025-03-14 22:11:37,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 1277 transitions, 56506 flow [2025-03-14 22:11:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2328 transitions. [2025-03-14 22:11:37,712 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7657894736842106 [2025-03-14 22:11:37,712 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 405 predicate places. [2025-03-14 22:11:37,713 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 1277 transitions, 56506 flow [2025-03-14 22:11:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:37,713 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:37,713 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] [2025-03-14 22:11:37,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 22:11:37,713 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:37,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 204062217, now seen corresponding path program 5 times [2025-03-14 22:11:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920945187] [2025-03-14 22:11:37,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:37,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:37,725 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:37,725 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:37,813 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:11:37,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920945187] [2025-03-14 22:11:37,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920945187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007159511] [2025-03-14 22:11:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:37,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:37,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:37,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:37,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:37,815 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:37,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 1277 transitions, 56506 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:37,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:37,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:37,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:38,667 INFO L124 PetriNetUnfolderBase]: 387/2827 cut-off events. [2025-03-14 22:11:38,667 INFO L125 PetriNetUnfolderBase]: For 87924/98644 co-relation queries the response was YES. [2025-03-14 22:11:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39915 conditions, 2827 events. 387/2827 cut-off events. For 87924/98644 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 28655 event pairs, 35 based on Foata normal form. 31/2708 useless extension candidates. Maximal degree in co-relation 17389. Up to 1298 conditions per place. [2025-03-14 22:11:38,682 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 293 selfloop transitions, 20 changer transitions 847/1303 dead transitions. [2025-03-14 22:11:38,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 1303 transitions, 60053 flow [2025-03-14 22:11:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:38,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2303 transitions. [2025-03-14 22:11:38,684 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7575657894736842 [2025-03-14 22:11:38,684 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 420 predicate places. [2025-03-14 22:11:38,684 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 1303 transitions, 60053 flow [2025-03-14 22:11:38,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:38,685 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:38,685 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] [2025-03-14 22:11:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 22:11:38,685 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 352240149, now seen corresponding path program 6 times [2025-03-14 22:11:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257739218] [2025-03-14 22:11:38,686 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:11:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:38,691 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:11:38,692 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:38,780 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:11:38,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:38,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257739218] [2025-03-14 22:11:38,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257739218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:38,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:38,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687994572] [2025-03-14 22:11:38,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:38,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:38,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:38,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:38,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:38,782 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:38,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 1303 transitions, 60053 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:38,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:38,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:38,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:39,717 INFO L124 PetriNetUnfolderBase]: 381/2765 cut-off events. [2025-03-14 22:11:39,717 INFO L125 PetriNetUnfolderBase]: For 95583/108406 co-relation queries the response was YES. [2025-03-14 22:11:39,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41158 conditions, 2765 events. 381/2765 cut-off events. For 95583/108406 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 27992 event pairs, 34 based on Foata normal form. 45/2675 useless extension candidates. Maximal degree in co-relation 18068. Up to 1289 conditions per place. [2025-03-14 22:11:39,736 INFO L140 encePairwiseOnDemand]: 177/190 looper letters, 262 selfloop transitions, 9 changer transitions 879/1293 dead transitions. [2025-03-14 22:11:39,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 1293 transitions, 61825 flow [2025-03-14 22:11:39,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:39,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2586 transitions. [2025-03-14 22:11:39,738 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.756140350877193 [2025-03-14 22:11:39,738 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 437 predicate places. [2025-03-14 22:11:39,738 INFO L471 AbstractCegarLoop]: Abstraction has has 619 places, 1293 transitions, 61825 flow [2025-03-14 22:11:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:39,739 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:39,739 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] [2025-03-14 22:11:39,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 22:11:39,739 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:39,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2036159327, now seen corresponding path program 7 times [2025-03-14 22:11:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:39,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410514006] [2025-03-14 22:11:39,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:11:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:39,845 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:11:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410514006] [2025-03-14 22:11:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410514006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139302159] [2025-03-14 22:11:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:39,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:39,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:39,847 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:39,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 1293 transitions, 61825 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:39,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:39,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:39,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:40,785 INFO L124 PetriNetUnfolderBase]: 396/2911 cut-off events. [2025-03-14 22:11:40,786 INFO L125 PetriNetUnfolderBase]: For 104096/117251 co-relation queries the response was YES. [2025-03-14 22:11:40,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43826 conditions, 2911 events. 396/2911 cut-off events. For 104096/117251 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 29867 event pairs, 38 based on Foata normal form. 111/2873 useless extension candidates. Maximal degree in co-relation 25486. Up to 1319 conditions per place. [2025-03-14 22:11:40,805 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 251 selfloop transitions, 27 changer transitions 906/1327 dead transitions. [2025-03-14 22:11:40,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 1327 transitions, 65959 flow [2025-03-14 22:11:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:11:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:11:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2194 transitions. [2025-03-14 22:11:40,806 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7698245614035087 [2025-03-14 22:11:40,806 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 451 predicate places. [2025-03-14 22:11:40,807 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 1327 transitions, 65959 flow [2025-03-14 22:11:40,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:40,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:40,807 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] [2025-03-14 22:11:40,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-14 22:11:40,807 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:40,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:40,808 INFO L85 PathProgramCache]: Analyzing trace with hash 373476489, now seen corresponding path program 8 times [2025-03-14 22:11:40,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:40,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741026342] [2025-03-14 22:11:40,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:40,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:40,814 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:40,814 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:40,912 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:11:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741026342] [2025-03-14 22:11:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741026342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:40,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:40,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709116488] [2025-03-14 22:11:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:40,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:40,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:40,914 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:40,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 1327 transitions, 65959 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:40,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:40,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:40,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:41,964 INFO L124 PetriNetUnfolderBase]: 398/2974 cut-off events. [2025-03-14 22:11:41,964 INFO L125 PetriNetUnfolderBase]: For 111956/123331 co-relation queries the response was YES. [2025-03-14 22:11:41,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46008 conditions, 2974 events. 398/2974 cut-off events. For 111956/123331 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 30724 event pairs, 34 based on Foata normal form. 110/2934 useless extension candidates. Maximal degree in co-relation 20109. Up to 1336 conditions per place. [2025-03-14 22:11:41,980 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 249 selfloop transitions, 21 changer transitions 935/1348 dead transitions. [2025-03-14 22:11:41,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 1348 transitions, 69426 flow [2025-03-14 22:11:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2612 transitions. [2025-03-14 22:11:41,982 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7637426900584795 [2025-03-14 22:11:41,982 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 468 predicate places. [2025-03-14 22:11:41,982 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 1348 transitions, 69426 flow [2025-03-14 22:11:41,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:41,983 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:41,983 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] [2025-03-14 22:11:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 22:11:41,983 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:41,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:41,983 INFO L85 PathProgramCache]: Analyzing trace with hash -991919849, now seen corresponding path program 9 times [2025-03-14 22:11:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114193978] [2025-03-14 22:11:41,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:41,991 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:41,991 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:42,079 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:11:42,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:42,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114193978] [2025-03-14 22:11:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114193978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:42,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797074765] [2025-03-14 22:11:42,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:42,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:42,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:42,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:42,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:42,081 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:42,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 1348 transitions, 69426 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:42,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:42,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:42,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:43,141 INFO L124 PetriNetUnfolderBase]: 415/3030 cut-off events. [2025-03-14 22:11:43,141 INFO L125 PetriNetUnfolderBase]: For 126460/140940 co-relation queries the response was YES. [2025-03-14 22:11:43,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49204 conditions, 3030 events. 415/3030 cut-off events. For 126460/140940 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 31506 event pairs, 31 based on Foata normal form. 97/2979 useless extension candidates. Maximal degree in co-relation 21633. Up to 1379 conditions per place. [2025-03-14 22:11:43,165 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 266 selfloop transitions, 23 changer transitions 966/1398 dead transitions. [2025-03-14 22:11:43,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 1398 transitions, 74655 flow [2025-03-14 22:11:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2475 transitions. [2025-03-14 22:11:43,166 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7662538699690402 [2025-03-14 22:11:43,167 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 484 predicate places. [2025-03-14 22:11:43,167 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 1398 transitions, 74655 flow [2025-03-14 22:11:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:43,167 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:43,167 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] [2025-03-14 22:11:43,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 22:11:43,167 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:43,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:43,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1995666813, now seen corresponding path program 10 times [2025-03-14 22:11:43,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:43,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592982083] [2025-03-14 22:11:43,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:43,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:43,173 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:43,173 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:11:43,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:43,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592982083] [2025-03-14 22:11:43,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592982083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:43,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:43,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:43,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978035519] [2025-03-14 22:11:43,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:43,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:43,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:43,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:43,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:43,282 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:43,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 1398 transitions, 74655 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:43,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:43,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:43,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:44,409 INFO L124 PetriNetUnfolderBase]: 418/3092 cut-off events. [2025-03-14 22:11:44,410 INFO L125 PetriNetUnfolderBase]: For 133883/148662 co-relation queries the response was YES. [2025-03-14 22:11:44,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51657 conditions, 3092 events. 418/3092 cut-off events. For 133883/148662 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 32422 event pairs, 34 based on Foata normal form. 82/3025 useless extension candidates. Maximal degree in co-relation 27889. Up to 1402 conditions per place. [2025-03-14 22:11:44,435 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 262 selfloop transitions, 23 changer transitions 994/1422 dead transitions. [2025-03-14 22:11:44,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 1422 transitions, 78577 flow [2025-03-14 22:11:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2472 transitions. [2025-03-14 22:11:44,437 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7653250773993808 [2025-03-14 22:11:44,437 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 500 predicate places. [2025-03-14 22:11:44,437 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 1422 transitions, 78577 flow [2025-03-14 22:11:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:44,437 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:44,438 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] [2025-03-14 22:11:44,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 22:11:44,438 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:44,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:44,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1480361355, now seen corresponding path program 11 times [2025-03-14 22:11:44,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055287555] [2025-03-14 22:11:44,438 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:44,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:44,444 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:44,444 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:44,547 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:11:44,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:44,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055287555] [2025-03-14 22:11:44,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055287555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:44,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:44,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:44,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799047836] [2025-03-14 22:11:44,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:44,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:44,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:44,549 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:44,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 1422 transitions, 78577 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:44,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:44,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:44,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:45,680 INFO L124 PetriNetUnfolderBase]: 417/3091 cut-off events. [2025-03-14 22:11:45,680 INFO L125 PetriNetUnfolderBase]: For 142060/157643 co-relation queries the response was YES. [2025-03-14 22:11:45,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53743 conditions, 3091 events. 417/3091 cut-off events. For 142060/157643 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32445 event pairs, 31 based on Foata normal form. 79/3020 useless extension candidates. Maximal degree in co-relation 24329. Up to 1414 conditions per place. [2025-03-14 22:11:45,707 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 256 selfloop transitions, 13 changer transitions 1023/1435 dead transitions. [2025-03-14 22:11:45,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 1435 transitions, 81965 flow [2025-03-14 22:11:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2334 transitions. [2025-03-14 22:11:45,709 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7677631578947368 [2025-03-14 22:11:45,709 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 515 predicate places. [2025-03-14 22:11:45,709 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 1435 transitions, 81965 flow [2025-03-14 22:11:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:45,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:45,710 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] [2025-03-14 22:11:45,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-14 22:11:45,710 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:45,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:45,710 INFO L85 PathProgramCache]: Analyzing trace with hash -927023235, now seen corresponding path program 12 times [2025-03-14 22:11:45,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:45,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980301435] [2025-03-14 22:11:45,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:11:45,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:45,716 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:11:45,716 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:45,800 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:11:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:45,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980301435] [2025-03-14 22:11:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980301435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:45,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963789661] [2025-03-14 22:11:45,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:45,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:45,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:45,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:45,802 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:45,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 1435 transitions, 81965 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:45,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:45,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:45,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:46,970 INFO L124 PetriNetUnfolderBase]: 424/3159 cut-off events. [2025-03-14 22:11:46,970 INFO L125 PetriNetUnfolderBase]: For 159960/177821 co-relation queries the response was YES. [2025-03-14 22:11:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56574 conditions, 3159 events. 424/3159 cut-off events. For 159960/177821 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 33342 event pairs, 33 based on Foata normal form. 63/3071 useless extension candidates. Maximal degree in co-relation 30727. Up to 1446 conditions per place. [2025-03-14 22:11:46,995 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 249 selfloop transitions, 18 changer transitions 1057/1465 dead transitions. [2025-03-14 22:11:46,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 1465 transitions, 86459 flow [2025-03-14 22:11:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:11:46,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:11:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2773 transitions. [2025-03-14 22:11:46,996 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7681440443213297 [2025-03-14 22:11:46,997 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 533 predicate places. [2025-03-14 22:11:46,997 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 1465 transitions, 86459 flow [2025-03-14 22:11:46,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:46,997 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:46,997 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] [2025-03-14 22:11:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-14 22:11:46,997 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1564648655, now seen corresponding path program 13 times [2025-03-14 22:11:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349988454] [2025-03-14 22:11:46,998 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:11:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:47,092 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:11:47,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349988454] [2025-03-14 22:11:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349988454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:47,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056597751] [2025-03-14 22:11:47,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:47,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:47,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:47,094 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:47,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 1465 transitions, 86459 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:47,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:47,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:47,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:48,343 INFO L124 PetriNetUnfolderBase]: 427/3218 cut-off events. [2025-03-14 22:11:48,343 INFO L125 PetriNetUnfolderBase]: For 170048/189030 co-relation queries the response was YES. [2025-03-14 22:11:48,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59110 conditions, 3218 events. 427/3218 cut-off events. For 170048/189030 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 34262 event pairs, 31 based on Foata normal form. 32/3100 useless extension candidates. Maximal degree in co-relation 29465. Up to 1468 conditions per place. [2025-03-14 22:11:48,369 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 243 selfloop transitions, 18 changer transitions 1085/1487 dead transitions. [2025-03-14 22:11:48,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 1487 transitions, 90523 flow [2025-03-14 22:11:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2328 transitions. [2025-03-14 22:11:48,370 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7657894736842106 [2025-03-14 22:11:48,371 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 548 predicate places. [2025-03-14 22:11:48,371 INFO L471 AbstractCegarLoop]: Abstraction has has 730 places, 1487 transitions, 90523 flow [2025-03-14 22:11:48,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:48,371 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:48,371 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] [2025-03-14 22:11:48,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-14 22:11:48,371 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:48,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1397444747, now seen corresponding path program 14 times [2025-03-14 22:11:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995611933] [2025-03-14 22:11:48,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:48,377 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:48,377 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:48,448 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:11:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995611933] [2025-03-14 22:11:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995611933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107601749] [2025-03-14 22:11:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:48,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:48,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:48,449 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:48,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 730 places, 1487 transitions, 90523 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:48,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:48,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:49,835 INFO L124 PetriNetUnfolderBase]: 426/3175 cut-off events. [2025-03-14 22:11:49,835 INFO L125 PetriNetUnfolderBase]: For 191387/214519 co-relation queries the response was YES. [2025-03-14 22:11:49,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61763 conditions, 3175 events. 426/3175 cut-off events. For 191387/214519 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 33579 event pairs, 41 based on Foata normal form. 40/3070 useless extension candidates. Maximal degree in co-relation 26942. Up to 1494 conditions per place. [2025-03-14 22:11:49,860 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 243 selfloop transitions, 16 changer transitions 1113/1513 dead transitions. [2025-03-14 22:11:49,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 1513 transitions, 94958 flow [2025-03-14 22:11:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:11:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:11:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2329 transitions. [2025-03-14 22:11:49,862 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7661184210526316 [2025-03-14 22:11:49,862 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 563 predicate places. [2025-03-14 22:11:49,862 INFO L471 AbstractCegarLoop]: Abstraction has has 745 places, 1513 transitions, 94958 flow [2025-03-14 22:11:49,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:49,862 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:49,862 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] [2025-03-14 22:11:49,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-14 22:11:49,863 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:49,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:49,863 INFO L85 PathProgramCache]: Analyzing trace with hash 734153265, now seen corresponding path program 15 times [2025-03-14 22:11:49,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:49,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000194589] [2025-03-14 22:11:49,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:49,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:49,869 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:49,869 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:49,950 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:11:49,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:49,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000194589] [2025-03-14 22:11:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000194589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:49,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486780209] [2025-03-14 22:11:49,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:49,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:49,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:49,952 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:49,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 745 places, 1513 transitions, 94958 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:49,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:49,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:49,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:51,377 INFO L124 PetriNetUnfolderBase]: 426/3158 cut-off events. [2025-03-14 22:11:51,377 INFO L125 PetriNetUnfolderBase]: For 202147/227178 co-relation queries the response was YES. [2025-03-14 22:11:51,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63190 conditions, 3158 events. 426/3158 cut-off events. For 202147/227178 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 33496 event pairs, 35 based on Foata normal form. 56/3072 useless extension candidates. Maximal degree in co-relation 27344. Up to 1484 conditions per place. [2025-03-14 22:11:51,405 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 212 selfloop transitions, 6 changer transitions 1148/1503 dead transitions. [2025-03-14 22:11:51,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 762 places, 1503 transitions, 96970 flow [2025-03-14 22:11:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2612 transitions. [2025-03-14 22:11:51,407 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7637426900584795 [2025-03-14 22:11:51,407 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 580 predicate places. [2025-03-14 22:11:51,407 INFO L471 AbstractCegarLoop]: Abstraction has has 762 places, 1503 transitions, 96970 flow [2025-03-14 22:11:51,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:51,407 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:51,407 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] [2025-03-14 22:11:51,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-14 22:11:51,407 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:51,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1425028277, now seen corresponding path program 1 times [2025-03-14 22:11:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:51,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904085828] [2025-03-14 22:11:51,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:11:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:11:51,502 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:11:51,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:51,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904085828] [2025-03-14 22:11:51,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904085828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:51,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:51,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935367165] [2025-03-14 22:11:51,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:51,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:51,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:51,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:51,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:51,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 762 places, 1503 transitions, 96970 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:51,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:51,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:51,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:53,018 INFO L124 PetriNetUnfolderBase]: 472/3276 cut-off events. [2025-03-14 22:11:53,018 INFO L125 PetriNetUnfolderBase]: For 242294/262264 co-relation queries the response was YES. [2025-03-14 22:11:53,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63989 conditions, 3276 events. 472/3276 cut-off events. For 242294/262264 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 35033 event pairs, 96 based on Foata normal form. 53/3206 useless extension candidates. Maximal degree in co-relation 29770. Up to 1483 conditions per place. [2025-03-14 22:11:53,050 INFO L140 encePairwiseOnDemand]: 173/190 looper letters, 84 selfloop transitions, 27 changer transitions 1203/1455 dead transitions. [2025-03-14 22:11:53,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 779 places, 1455 transitions, 95861 flow [2025-03-14 22:11:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:11:53,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:11:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2766 transitions. [2025-03-14 22:11:53,051 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7662049861495844 [2025-03-14 22:11:53,052 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 597 predicate places. [2025-03-14 22:11:53,052 INFO L471 AbstractCegarLoop]: Abstraction has has 779 places, 1455 transitions, 95861 flow [2025-03-14 22:11:53,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:53,052 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:53,052 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] [2025-03-14 22:11:53,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-14 22:11:53,052 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2076102863, now seen corresponding path program 2 times [2025-03-14 22:11:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670838521] [2025-03-14 22:11:53,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:11:53,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:53,059 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:53,060 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:53,150 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:11:53,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:53,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670838521] [2025-03-14 22:11:53,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670838521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:53,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:53,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:53,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010771803] [2025-03-14 22:11:53,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:53,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:53,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:53,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:53,153 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:53,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 779 places, 1455 transitions, 95861 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:53,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:53,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:53,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:54,600 INFO L124 PetriNetUnfolderBase]: 486/3333 cut-off events. [2025-03-14 22:11:54,600 INFO L125 PetriNetUnfolderBase]: For 249692/264132 co-relation queries the response was YES. [2025-03-14 22:11:54,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67005 conditions, 3333 events. 486/3333 cut-off events. For 249692/264132 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 35898 event pairs, 84 based on Foata normal form. 38/3251 useless extension candidates. Maximal degree in co-relation 31986. Up to 1514 conditions per place. [2025-03-14 22:11:54,622 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 85 selfloop transitions, 32 changer transitions 1229/1487 dead transitions. [2025-03-14 22:11:54,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 795 places, 1487 transitions, 100612 flow [2025-03-14 22:11:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:11:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:11:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2460 transitions. [2025-03-14 22:11:54,624 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7616099071207431 [2025-03-14 22:11:54,624 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 613 predicate places. [2025-03-14 22:11:54,624 INFO L471 AbstractCegarLoop]: Abstraction has has 795 places, 1487 transitions, 100612 flow [2025-03-14 22:11:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:54,624 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:54,624 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] [2025-03-14 22:11:54,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-14 22:11:54,625 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:54,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:54,625 INFO L85 PathProgramCache]: Analyzing trace with hash 114420777, now seen corresponding path program 3 times [2025-03-14 22:11:54,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:54,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274918487] [2025-03-14 22:11:54,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:54,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:54,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:54,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:54,712 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:11:54,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:54,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274918487] [2025-03-14 22:11:54,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274918487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:54,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:54,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:54,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036858950] [2025-03-14 22:11:54,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:54,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:54,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:54,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:54,714 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:54,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 1487 transitions, 100612 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:54,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:54,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:54,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:56,243 INFO L124 PetriNetUnfolderBase]: 498/3526 cut-off events. [2025-03-14 22:11:56,243 INFO L125 PetriNetUnfolderBase]: For 270399/286675 co-relation queries the response was YES. [2025-03-14 22:11:56,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69470 conditions, 3526 events. 498/3526 cut-off events. For 270399/286675 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 38491 event pairs, 80 based on Foata normal form. 34/3417 useless extension candidates. Maximal degree in co-relation 32661. Up to 1531 conditions per place. [2025-03-14 22:11:56,268 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 80 selfloop transitions, 17 changer transitions 1260/1497 dead transitions. [2025-03-14 22:11:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 1497 transitions, 103836 flow [2025-03-14 22:11:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 22:11:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 22:11:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2039 transitions. [2025-03-14 22:11:56,270 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7665413533834586 [2025-03-14 22:11:56,270 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 626 predicate places. [2025-03-14 22:11:56,270 INFO L471 AbstractCegarLoop]: Abstraction has has 808 places, 1497 transitions, 103836 flow [2025-03-14 22:11:56,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:56,270 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:56,270 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] [2025-03-14 22:11:56,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-14 22:11:56,271 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:56,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1298419, now seen corresponding path program 4 times [2025-03-14 22:11:56,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:56,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471939364] [2025-03-14 22:11:56,271 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:11:56,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:56,277 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:11:56,277 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:56,368 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:11:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471939364] [2025-03-14 22:11:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471939364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:56,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655981329] [2025-03-14 22:11:56,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:56,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:56,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:56,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:56,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:56,370 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:56,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 1497 transitions, 103836 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:56,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:56,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:58,054 INFO L124 PetriNetUnfolderBase]: 524/3628 cut-off events. [2025-03-14 22:11:58,055 INFO L125 PetriNetUnfolderBase]: For 296858/316642 co-relation queries the response was YES. [2025-03-14 22:11:58,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74677 conditions, 3628 events. 524/3628 cut-off events. For 296858/316642 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 39620 event pairs, 87 based on Foata normal form. 74/3555 useless extension candidates. Maximal degree in co-relation 35444. Up to 1621 conditions per place. [2025-03-14 22:11:58,085 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 121 selfloop transitions, 21 changer transitions 1287/1569 dead transitions. [2025-03-14 22:11:58,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 1569 transitions, 111655 flow [2025-03-14 22:11:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:11:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:11:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2621 transitions. [2025-03-14 22:11:58,088 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7663742690058479 [2025-03-14 22:11:58,088 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 643 predicate places. [2025-03-14 22:11:58,088 INFO L471 AbstractCegarLoop]: Abstraction has has 825 places, 1569 transitions, 111655 flow [2025-03-14 22:11:58,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:58,089 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:58,089 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] [2025-03-14 22:11:58,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-14 22:11:58,089 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:11:58,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:58,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1188804563, now seen corresponding path program 5 times [2025-03-14 22:11:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208729767] [2025-03-14 22:11:58,090 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:11:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:58,097 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:11:58,097 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:58,218 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:11:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208729767] [2025-03-14 22:11:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208729767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:58,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:11:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338571196] [2025-03-14 22:11:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:58,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:11:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:11:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:11:58,220 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:11:58,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 1569 transitions, 111655 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:11:58,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:58,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:11:58,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:00,001 INFO L124 PetriNetUnfolderBase]: 532/3622 cut-off events. [2025-03-14 22:12:00,001 INFO L125 PetriNetUnfolderBase]: For 324199/343487 co-relation queries the response was YES. [2025-03-14 22:12:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78352 conditions, 3622 events. 532/3622 cut-off events. For 324199/343487 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 39670 event pairs, 101 based on Foata normal form. 38/3532 useless extension candidates. Maximal degree in co-relation 37756. Up to 1676 conditions per place. [2025-03-14 22:12:00,026 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 133 selfloop transitions, 25 changer transitions 1308/1606 dead transitions. [2025-03-14 22:12:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 840 places, 1606 transitions, 117090 flow [2025-03-14 22:12:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:12:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:12:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2321 transitions. [2025-03-14 22:12:00,027 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7634868421052632 [2025-03-14 22:12:00,028 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 658 predicate places. [2025-03-14 22:12:00,028 INFO L471 AbstractCegarLoop]: Abstraction has has 840 places, 1606 transitions, 117090 flow [2025-03-14 22:12:00,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:00,028 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:00,028 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] [2025-03-14 22:12:00,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-14 22:12:00,028 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2097039155, now seen corresponding path program 6 times [2025-03-14 22:12:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344230421] [2025-03-14 22:12:00,029 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:12:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:00,034 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:12:00,034 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:00,116 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:12:00,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:00,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344230421] [2025-03-14 22:12:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344230421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:00,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623192304] [2025-03-14 22:12:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:00,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:00,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:00,117 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:00,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 840 places, 1606 transitions, 117090 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:00,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:00,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:00,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:01,780 INFO L124 PetriNetUnfolderBase]: 546/3775 cut-off events. [2025-03-14 22:12:01,781 INFO L125 PetriNetUnfolderBase]: For 342073/363681 co-relation queries the response was YES. [2025-03-14 22:12:01,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81058 conditions, 3775 events. 546/3775 cut-off events. For 342073/363681 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 41741 event pairs, 95 based on Foata normal form. 38/3668 useless extension candidates. Maximal degree in co-relation 50685. Up to 1691 conditions per place. [2025-03-14 22:12:01,817 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 128 selfloop transitions, 26 changer transitions 1326/1620 dead transitions. [2025-03-14 22:12:01,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 1620 transitions, 120951 flow [2025-03-14 22:12:01,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:12:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:12:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2181 transitions. [2025-03-14 22:12:01,819 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7652631578947369 [2025-03-14 22:12:01,819 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 672 predicate places. [2025-03-14 22:12:01,819 INFO L471 AbstractCegarLoop]: Abstraction has has 854 places, 1620 transitions, 120951 flow [2025-03-14 22:12:01,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:01,820 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:01,820 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] [2025-03-14 22:12:01,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-14 22:12:01,820 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:01,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1809606975, now seen corresponding path program 7 times [2025-03-14 22:12:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403902743] [2025-03-14 22:12:01,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:12:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:12:01,951 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:12:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403902743] [2025-03-14 22:12:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403902743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:01,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:01,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:01,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436586761] [2025-03-14 22:12:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:01,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:01,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:01,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:01,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:01,953 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:01,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 854 places, 1620 transitions, 120951 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:01,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:01,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:01,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:03,594 INFO L124 PetriNetUnfolderBase]: 548/3841 cut-off events. [2025-03-14 22:12:03,595 INFO L125 PetriNetUnfolderBase]: For 363918/382921 co-relation queries the response was YES. [2025-03-14 22:12:03,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83605 conditions, 3841 events. 548/3841 cut-off events. For 363918/382921 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 42678 event pairs, 85 based on Foata normal form. 40/3735 useless extension candidates. Maximal degree in co-relation 40202. Up to 1703 conditions per place. [2025-03-14 22:12:03,635 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 125 selfloop transitions, 15 changer transitions 1350/1630 dead transitions. [2025-03-14 22:12:03,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 1630 transitions, 124667 flow [2025-03-14 22:12:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:12:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:12:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2323 transitions. [2025-03-14 22:12:03,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7641447368421053 [2025-03-14 22:12:03,637 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 687 predicate places. [2025-03-14 22:12:03,637 INFO L471 AbstractCegarLoop]: Abstraction has has 869 places, 1630 transitions, 124667 flow [2025-03-14 22:12:03,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:03,637 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:03,637 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] [2025-03-14 22:12:03,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-14 22:12:03,638 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2145458641, now seen corresponding path program 8 times [2025-03-14 22:12:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216865372] [2025-03-14 22:12:03,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:12:03,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:03,643 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:12:03,643 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:03,727 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:12:03,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:03,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216865372] [2025-03-14 22:12:03,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216865372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:03,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:03,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:03,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814990831] [2025-03-14 22:12:03,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:03,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:03,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:03,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:03,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:03,729 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:03,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 869 places, 1630 transitions, 124667 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:03,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:03,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:03,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:05,445 INFO L124 PetriNetUnfolderBase]: 543/3702 cut-off events. [2025-03-14 22:12:05,446 INFO L125 PetriNetUnfolderBase]: For 378143/398773 co-relation queries the response was YES. [2025-03-14 22:12:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86295 conditions, 3702 events. 543/3702 cut-off events. For 378143/398773 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 40845 event pairs, 93 based on Foata normal form. 53/3628 useless extension candidates. Maximal degree in co-relation 50934. Up to 1726 conditions per place. [2025-03-14 22:12:05,481 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 115 selfloop transitions, 21 changer transitions 1371/1647 dead transitions. [2025-03-14 22:12:05,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 885 places, 1647 transitions, 128896 flow [2025-03-14 22:12:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:12:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:12:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2461 transitions. [2025-03-14 22:12:05,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7619195046439629 [2025-03-14 22:12:05,483 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 703 predicate places. [2025-03-14 22:12:05,483 INFO L471 AbstractCegarLoop]: Abstraction has has 885 places, 1647 transitions, 128896 flow [2025-03-14 22:12:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:05,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:05,483 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:12:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-14 22:12:05,483 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -358031077, now seen corresponding path program 9 times [2025-03-14 22:12:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237371899] [2025-03-14 22:12:05,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:12:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:05,489 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:12:05,489 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:12:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237371899] [2025-03-14 22:12:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237371899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359223309] [2025-03-14 22:12:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:05,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:05,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:05,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:05,574 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:05,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 885 places, 1647 transitions, 128896 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:05,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:05,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:05,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:07,676 INFO L124 PetriNetUnfolderBase]: 547/3770 cut-off events. [2025-03-14 22:12:07,677 INFO L125 PetriNetUnfolderBase]: For 407671/429263 co-relation queries the response was YES. [2025-03-14 22:12:07,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89061 conditions, 3770 events. 547/3770 cut-off events. For 407671/429263 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 41878 event pairs, 99 based on Foata normal form. 51/3694 useless extension candidates. Maximal degree in co-relation 42847. Up to 1744 conditions per place. [2025-03-14 22:12:07,711 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 111 selfloop transitions, 21 changer transitions 1389/1661 dead transitions. [2025-03-14 22:12:07,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 1661 transitions, 132923 flow [2025-03-14 22:12:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:12:07,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:12:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2180 transitions. [2025-03-14 22:12:07,713 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7649122807017544 [2025-03-14 22:12:07,713 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 717 predicate places. [2025-03-14 22:12:07,713 INFO L471 AbstractCegarLoop]: Abstraction has has 899 places, 1661 transitions, 132923 flow [2025-03-14 22:12:07,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:07,713 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:07,713 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] [2025-03-14 22:12:07,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-14 22:12:07,714 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:07,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1522287123, now seen corresponding path program 10 times [2025-03-14 22:12:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53520479] [2025-03-14 22:12:07,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:12:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:07,722 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:12:07,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:12:07,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53520479] [2025-03-14 22:12:07,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53520479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:07,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:07,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:07,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793366169] [2025-03-14 22:12:07,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:07,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:07,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:07,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:07,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:07,836 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:07,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 1661 transitions, 132923 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:07,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:07,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:07,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:09,895 INFO L124 PetriNetUnfolderBase]: 547/3749 cut-off events. [2025-03-14 22:12:09,895 INFO L125 PetriNetUnfolderBase]: For 428257/449955 co-relation queries the response was YES. [2025-03-14 22:12:09,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90236 conditions, 3749 events. 547/3749 cut-off events. For 428257/449955 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 41594 event pairs, 101 based on Foata normal form. 57/3681 useless extension candidates. Maximal degree in co-relation 43804. Up to 1728 conditions per place. [2025-03-14 22:12:09,932 INFO L140 encePairwiseOnDemand]: 175/190 looper letters, 84 selfloop transitions, 8 changer transitions 1415/1644 dead transitions. [2025-03-14 22:12:09,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 1644 transitions, 134285 flow [2025-03-14 22:12:09,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:12:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:12:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2182 transitions. [2025-03-14 22:12:09,934 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7656140350877193 [2025-03-14 22:12:09,934 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 731 predicate places. [2025-03-14 22:12:09,934 INFO L471 AbstractCegarLoop]: Abstraction has has 913 places, 1644 transitions, 134285 flow [2025-03-14 22:12:09,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:09,934 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:09,934 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] [2025-03-14 22:12:09,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-14 22:12:09,934 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:09,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:09,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1008325311, now seen corresponding path program 11 times [2025-03-14 22:12:09,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:09,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043895455] [2025-03-14 22:12:09,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:12:09,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:09,940 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:12:09,940 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:10,027 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:12:10,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:10,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043895455] [2025-03-14 22:12:10,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043895455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:10,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:10,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:10,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992080776] [2025-03-14 22:12:10,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:10,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:10,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:10,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:10,029 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:10,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 913 places, 1644 transitions, 134285 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:10,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:10,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:10,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:12,193 INFO L124 PetriNetUnfolderBase]: 646/4254 cut-off events. [2025-03-14 22:12:12,193 INFO L125 PetriNetUnfolderBase]: For 512948/542297 co-relation queries the response was YES. [2025-03-14 22:12:12,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103053 conditions, 4254 events. 646/4254 cut-off events. For 512948/542297 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 47713 event pairs, 72 based on Foata normal form. 121/4207 useless extension candidates. Maximal degree in co-relation 63477. Up to 1919 conditions per place. [2025-03-14 22:12:12,236 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 107 selfloop transitions, 20 changer transitions 1550/1814 dead transitions. [2025-03-14 22:12:12,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 1814 transitions, 152446 flow [2025-03-14 22:12:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:12:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:12:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2626 transitions. [2025-03-14 22:12:12,238 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7678362573099415 [2025-03-14 22:12:12,238 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 748 predicate places. [2025-03-14 22:12:12,238 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 1814 transitions, 152446 flow [2025-03-14 22:12:12,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:12,238 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:12,238 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] [2025-03-14 22:12:12,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-14 22:12:12,238 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:12,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:12,239 INFO L85 PathProgramCache]: Analyzing trace with hash -389681467, now seen corresponding path program 12 times [2025-03-14 22:12:12,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:12,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929835939] [2025-03-14 22:12:12,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:12:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:12,248 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:12:12,248 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:12,326 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:12:12,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:12,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929835939] [2025-03-14 22:12:12,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929835939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:12,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389836478] [2025-03-14 22:12:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:12,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:12,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:12,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:12,327 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:12,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 1814 transitions, 152446 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:12,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:12,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:12,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:14,816 INFO L124 PetriNetUnfolderBase]: 644/4224 cut-off events. [2025-03-14 22:12:14,816 INFO L125 PetriNetUnfolderBase]: For 491472/512690 co-relation queries the response was YES. [2025-03-14 22:12:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107262 conditions, 4224 events. 644/4224 cut-off events. For 491472/512690 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 47478 event pairs, 71 based on Foata normal form. 216/4292 useless extension candidates. Maximal degree in co-relation 52974. Up to 1960 conditions per place. [2025-03-14 22:12:14,860 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 77 selfloop transitions, 11 changer transitions 1634/1857 dead transitions. [2025-03-14 22:12:14,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 1857 transitions, 159453 flow [2025-03-14 22:12:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-14 22:12:14,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-14 22:12:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2767 transitions. [2025-03-14 22:12:14,862 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7664819944598338 [2025-03-14 22:12:14,862 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 766 predicate places. [2025-03-14 22:12:14,862 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 1857 transitions, 159453 flow [2025-03-14 22:12:14,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:14,862 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:14,862 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] [2025-03-14 22:12:14,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-14 22:12:14,862 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:14,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:14,863 INFO L85 PathProgramCache]: Analyzing trace with hash 635290181, now seen corresponding path program 13 times [2025-03-14 22:12:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:14,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844264671] [2025-03-14 22:12:14,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:12:14,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:12:14,954 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:12:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844264671] [2025-03-14 22:12:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844264671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504076190] [2025-03-14 22:12:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:14,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:14,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:14,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:14,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:14,955 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:14,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 1857 transitions, 159453 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:17,404 INFO L124 PetriNetUnfolderBase]: 650/4294 cut-off events. [2025-03-14 22:12:17,404 INFO L125 PetriNetUnfolderBase]: For 515937/536173 co-relation queries the response was YES. [2025-03-14 22:12:17,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110561 conditions, 4294 events. 650/4294 cut-off events. For 515937/536173 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 48586 event pairs, 76 based on Foata normal form. 138/4282 useless extension candidates. Maximal degree in co-relation 64669. Up to 1986 conditions per place. [2025-03-14 22:12:17,450 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 71 selfloop transitions, 13 changer transitions 1656/1874 dead transitions. [2025-03-14 22:12:17,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 1874 transitions, 164306 flow [2025-03-14 22:12:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:12:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:12:17,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2461 transitions. [2025-03-14 22:12:17,451 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7619195046439629 [2025-03-14 22:12:17,451 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 782 predicate places. [2025-03-14 22:12:17,452 INFO L471 AbstractCegarLoop]: Abstraction has has 964 places, 1874 transitions, 164306 flow [2025-03-14 22:12:17,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:17,452 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:17,452 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] [2025-03-14 22:12:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-14 22:12:17,452 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:17,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1557754003, now seen corresponding path program 14 times [2025-03-14 22:12:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295587022] [2025-03-14 22:12:17,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:12:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:17,457 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:12:17,457 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:17,561 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:12:17,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:17,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295587022] [2025-03-14 22:12:17,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295587022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:17,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:17,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:17,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836991662] [2025-03-14 22:12:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:17,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:17,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:17,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:17,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:17,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:17,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 964 places, 1874 transitions, 164306 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:17,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:17,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:17,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:20,103 INFO L124 PetriNetUnfolderBase]: 661/4468 cut-off events. [2025-03-14 22:12:20,103 INFO L125 PetriNetUnfolderBase]: For 537089/557975 co-relation queries the response was YES. [2025-03-14 22:12:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113780 conditions, 4468 events. 661/4468 cut-off events. For 537089/557975 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 51164 event pairs, 75 based on Foata normal form. 135/4434 useless extension candidates. Maximal degree in co-relation 56353. Up to 2004 conditions per place. [2025-03-14 22:12:20,140 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 67 selfloop transitions, 13 changer transitions 1674/1888 dead transitions. [2025-03-14 22:12:20,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 1888 transitions, 168927 flow [2025-03-14 22:12:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:12:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:12:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2180 transitions. [2025-03-14 22:12:20,142 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7649122807017544 [2025-03-14 22:12:20,142 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 796 predicate places. [2025-03-14 22:12:20,142 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1888 transitions, 168927 flow [2025-03-14 22:12:20,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:20,142 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:20,142 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] [2025-03-14 22:12:20,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-14 22:12:20,142 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:20,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1613187003, now seen corresponding path program 15 times [2025-03-14 22:12:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:20,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296531317] [2025-03-14 22:12:20,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:12:20,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:20,148 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:12:20,148 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:20,223 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:12:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:20,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296531317] [2025-03-14 22:12:20,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296531317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:20,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:20,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:12:20,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349810339] [2025-03-14 22:12:20,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:20,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:12:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:20,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:12:20,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:12:20,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 190 [2025-03-14 22:12:20,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1888 transitions, 168927 flow. Second operand has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:20,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:20,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 190 [2025-03-14 22:12:20,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:23,141 INFO L124 PetriNetUnfolderBase]: 654/4289 cut-off events. [2025-03-14 22:12:23,141 INFO L125 PetriNetUnfolderBase]: For 557783/578287 co-relation queries the response was YES. [2025-03-14 22:12:23,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115029 conditions, 4289 events. 654/4289 cut-off events. For 557783/578287 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 48623 event pairs, 76 based on Foata normal form. 143/4284 useless extension candidates. Maximal degree in co-relation 57350. Up to 1988 conditions per place. [2025-03-14 22:12:23,181 INFO L140 encePairwiseOnDemand]: 174/190 looper letters, 41 selfloop transitions, 0 changer transitions 1699/1871 dead transitions. [2025-03-14 22:12:23,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 992 places, 1871 transitions, 170573 flow [2025-03-14 22:12:23,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:12:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:12:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2181 transitions. [2025-03-14 22:12:23,182 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7652631578947369 [2025-03-14 22:12:23,183 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 810 predicate places. [2025-03-14 22:12:23,183 INFO L471 AbstractCegarLoop]: Abstraction has has 992 places, 1871 transitions, 170573 flow [2025-03-14 22:12:23,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 141.5) internal successors, (1415), 10 states have internal predecessors, (1415), 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:12:23,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:23,183 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] [2025-03-14 22:12:23,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-14 22:12:23,183 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:23,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1157469221, now seen corresponding path program 1 times [2025-03-14 22:12:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:23,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021463045] [2025-03-14 22:12:23,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:12:23,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:12:23,348 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:12:23,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:23,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021463045] [2025-03-14 22:12:23,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021463045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:23,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:23,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:12:23,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742589613] [2025-03-14 22:12:23,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:12:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:23,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:12:23,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:12:23,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:12:23,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 992 places, 1871 transitions, 170573 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:23,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:23,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:12:23,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:28,540 INFO L124 PetriNetUnfolderBase]: 1667/7256 cut-off events. [2025-03-14 22:12:28,541 INFO L125 PetriNetUnfolderBase]: For 1061031/1082779 co-relation queries the response was YES. [2025-03-14 22:12:28,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166369 conditions, 7256 events. 1667/7256 cut-off events. For 1061031/1082779 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 82676 event pairs, 492 based on Foata normal form. 25/6957 useless extension candidates. Maximal degree in co-relation 95301. Up to 3536 conditions per place. [2025-03-14 22:12:28,621 INFO L140 encePairwiseOnDemand]: 159/190 looper letters, 241 selfloop transitions, 87 changer transitions 1756/2202 dead transitions. [2025-03-14 22:12:28,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1039 places, 2202 transitions, 197046 flow [2025-03-14 22:12:28,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 22:12:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 22:12:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 6298 transitions. [2025-03-14 22:12:28,624 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6905701754385964 [2025-03-14 22:12:28,624 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 857 predicate places. [2025-03-14 22:12:28,624 INFO L471 AbstractCegarLoop]: Abstraction has has 1039 places, 2202 transitions, 197046 flow [2025-03-14 22:12:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:28,624 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:28,624 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] [2025-03-14 22:12:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-14 22:12:28,625 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2001918299, now seen corresponding path program 2 times [2025-03-14 22:12:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40604609] [2025-03-14 22:12:28,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:12:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:28,630 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:12:28,630 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:28,986 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:12:28,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:28,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40604609] [2025-03-14 22:12:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40604609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:12:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831759740] [2025-03-14 22:12:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:12:28,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:28,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:12:28,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:12:28,988 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:12:28,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1039 places, 2202 transitions, 197046 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:28,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:28,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:12:28,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:35,724 INFO L124 PetriNetUnfolderBase]: 1832/8130 cut-off events. [2025-03-14 22:12:35,724 INFO L125 PetriNetUnfolderBase]: For 1203225/1226161 co-relation queries the response was YES. [2025-03-14 22:12:35,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192153 conditions, 8130 events. 1832/8130 cut-off events. For 1203225/1226161 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 92026 event pairs, 435 based on Foata normal form. 115/7915 useless extension candidates. Maximal degree in co-relation 110133. Up to 4025 conditions per place. [2025-03-14 22:12:35,812 INFO L140 encePairwiseOnDemand]: 165/190 looper letters, 611 selfloop transitions, 65 changer transitions 1862/2656 dead transitions. [2025-03-14 22:12:35,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1086 places, 2656 transitions, 233361 flow [2025-03-14 22:12:35,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-14 22:12:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-14 22:12:35,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 6210 transitions. [2025-03-14 22:12:35,814 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.680921052631579 [2025-03-14 22:12:35,815 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 904 predicate places. [2025-03-14 22:12:35,815 INFO L471 AbstractCegarLoop]: Abstraction has has 1086 places, 2656 transitions, 233361 flow [2025-03-14 22:12:35,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:35,815 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:35,815 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] [2025-03-14 22:12:35,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-14 22:12:35,815 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:35,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -874255757, now seen corresponding path program 3 times [2025-03-14 22:12:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189690222] [2025-03-14 22:12:35,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:12:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:35,822 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:12:35,822 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:35,999 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:12:35,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:35,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189690222] [2025-03-14 22:12:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189690222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:35,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:35,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:12:35,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163827640] [2025-03-14 22:12:35,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:35,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:12:35,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:36,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:12:36,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:12:36,000 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:12:36,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1086 places, 2656 transitions, 233361 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:36,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:36,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:12:36,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:43,530 INFO L124 PetriNetUnfolderBase]: 1856/8150 cut-off events. [2025-03-14 22:12:43,530 INFO L125 PetriNetUnfolderBase]: For 1227721/1253722 co-relation queries the response was YES. [2025-03-14 22:12:43,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200572 conditions, 8150 events. 1856/8150 cut-off events. For 1227721/1253722 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 91909 event pairs, 438 based on Foata normal form. 78/7896 useless extension candidates. Maximal degree in co-relation 115566. Up to 4025 conditions per place. [2025-03-14 22:12:43,625 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 622 selfloop transitions, 76 changer transitions 1917/2733 dead transitions. [2025-03-14 22:12:43,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1111 places, 2733 transitions, 244652 flow [2025-03-14 22:12:43,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 22:12:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 22:12:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3406 transitions. [2025-03-14 22:12:43,627 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6894736842105263 [2025-03-14 22:12:43,627 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 929 predicate places. [2025-03-14 22:12:43,627 INFO L471 AbstractCegarLoop]: Abstraction has has 1111 places, 2733 transitions, 244652 flow [2025-03-14 22:12:43,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:43,627 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:43,627 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] [2025-03-14 22:12:43,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-14 22:12:43,627 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:43,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1279457215, now seen corresponding path program 4 times [2025-03-14 22:12:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506761550] [2025-03-14 22:12:43,628 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:12:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:43,634 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:12:43,634 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:43,782 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:12:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:43,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506761550] [2025-03-14 22:12:43,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506761550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:43,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:43,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:12:43,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014417632] [2025-03-14 22:12:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:43,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:12:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:12:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:12:43,784 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:12:43,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1111 places, 2733 transitions, 244652 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:43,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:43,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:12:43,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:12:52,319 INFO L124 PetriNetUnfolderBase]: 1899/8350 cut-off events. [2025-03-14 22:12:52,319 INFO L125 PetriNetUnfolderBase]: For 1282753/1310791 co-relation queries the response was YES. [2025-03-14 22:12:52,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211634 conditions, 8350 events. 1899/8350 cut-off events. For 1282753/1310791 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 94657 event pairs, 439 based on Foata normal form. 100/8118 useless extension candidates. Maximal degree in co-relation 121429. Up to 4023 conditions per place. [2025-03-14 22:12:52,425 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 668 selfloop transitions, 76 changer transitions 1997/2859 dead transitions. [2025-03-14 22:12:52,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1155 places, 2859 transitions, 259855 flow [2025-03-14 22:12:52,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:12:52,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:12:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5816 transitions. [2025-03-14 22:12:52,428 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.680233918128655 [2025-03-14 22:12:52,428 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 973 predicate places. [2025-03-14 22:12:52,428 INFO L471 AbstractCegarLoop]: Abstraction has has 1155 places, 2859 transitions, 259855 flow [2025-03-14 22:12:52,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:52,429 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:12:52,429 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] [2025-03-14 22:12:52,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-14 22:12:52,429 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:12:52,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:12:52,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1660983785, now seen corresponding path program 5 times [2025-03-14 22:12:52,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:12:52,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45318042] [2025-03-14 22:12:52,430 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:12:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:12:52,435 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:12:52,435 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:12:52,638 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:12:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:12:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45318042] [2025-03-14 22:12:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45318042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:12:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:12:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:12:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143335436] [2025-03-14 22:12:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:12:52,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:12:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:12:52,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:12:52,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:12:52,640 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:12:52,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1155 places, 2859 transitions, 259855 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:12:52,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:12:52,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:12:52,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:01,729 INFO L124 PetriNetUnfolderBase]: 1930/8494 cut-off events. [2025-03-14 22:13:01,729 INFO L125 PetriNetUnfolderBase]: For 1333668/1365380 co-relation queries the response was YES. [2025-03-14 22:13:01,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221136 conditions, 8494 events. 1930/8494 cut-off events. For 1333668/1365380 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 96595 event pairs, 439 based on Foata normal form. 91/8244 useless extension candidates. Maximal degree in co-relation 139618. Up to 4023 conditions per place. [2025-03-14 22:13:01,842 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 674 selfloop transitions, 90 changer transitions 2058/2940 dead transitions. [2025-03-14 22:13:01,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1189 places, 2940 transitions, 272207 flow [2025-03-14 22:13:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:13:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:13:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4537 transitions. [2025-03-14 22:13:01,844 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6822556390977443 [2025-03-14 22:13:01,845 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1007 predicate places. [2025-03-14 22:13:01,845 INFO L471 AbstractCegarLoop]: Abstraction has has 1189 places, 2940 transitions, 272207 flow [2025-03-14 22:13:01,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:01,845 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:01,845 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] [2025-03-14 22:13:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-14 22:13:01,845 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:13:01,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:01,846 INFO L85 PathProgramCache]: Analyzing trace with hash 105304797, now seen corresponding path program 6 times [2025-03-14 22:13:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:01,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856418032] [2025-03-14 22:13:01,846 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:13:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:01,854 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:13:01,854 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:13:02,194 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:13:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856418032] [2025-03-14 22:13:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856418032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:13:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917384784] [2025-03-14 22:13:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:13:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:02,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:13:02,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:13:02,196 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:13:02,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1189 places, 2940 transitions, 272207 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:02,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:02,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:13:02,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:11,693 INFO L124 PetriNetUnfolderBase]: 1933/8555 cut-off events. [2025-03-14 22:13:11,693 INFO L125 PetriNetUnfolderBase]: For 1380137/1413252 co-relation queries the response was YES. [2025-03-14 22:13:11,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228182 conditions, 8555 events. 1933/8555 cut-off events. For 1380137/1413252 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 97418 event pairs, 440 based on Foata normal form. 107/8330 useless extension candidates. Maximal degree in co-relation 131318. Up to 4025 conditions per place. [2025-03-14 22:13:11,789 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 655 selfloop transitions, 77 changer transitions 2127/2977 dead transitions. [2025-03-14 22:13:11,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1229 places, 2977 transitions, 280928 flow [2025-03-14 22:13:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-14 22:13:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-14 22:13:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5292 transitions. [2025-03-14 22:13:11,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6793324775353017 [2025-03-14 22:13:11,791 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1047 predicate places. [2025-03-14 22:13:11,791 INFO L471 AbstractCegarLoop]: Abstraction has has 1229 places, 2977 transitions, 280928 flow [2025-03-14 22:13:11,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:11,792 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:11,792 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] [2025-03-14 22:13:11,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-14 22:13:11,792 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:13:11,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1739467911, now seen corresponding path program 7 times [2025-03-14 22:13:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298758783] [2025-03-14 22:13:11,793 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:13:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:13:11,954 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:13:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298758783] [2025-03-14 22:13:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298758783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:11,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:13:11,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183357529] [2025-03-14 22:13:11,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:11,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:13:11,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:11,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:13:11,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:13:11,956 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:13:11,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1229 places, 2977 transitions, 280928 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:11,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:11,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:13:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:21,994 INFO L124 PetriNetUnfolderBase]: 1933/8593 cut-off events. [2025-03-14 22:13:21,994 INFO L125 PetriNetUnfolderBase]: For 1423539/1458005 co-relation queries the response was YES. [2025-03-14 22:13:22,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233637 conditions, 8593 events. 1933/8593 cut-off events. For 1423539/1458005 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 98012 event pairs, 430 based on Foata normal form. 92/8346 useless extension candidates. Maximal degree in co-relation 135121. Up to 4023 conditions per place. [2025-03-14 22:13:22,102 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 618 selfloop transitions, 57 changer transitions 2193/2986 dead transitions. [2025-03-14 22:13:22,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1257 places, 2986 transitions, 286946 flow [2025-03-14 22:13:22,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 22:13:22,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 22:13:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3782 transitions. [2025-03-14 22:13:22,104 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.686388384754991 [2025-03-14 22:13:22,104 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1075 predicate places. [2025-03-14 22:13:22,105 INFO L471 AbstractCegarLoop]: Abstraction has has 1257 places, 2986 transitions, 286946 flow [2025-03-14 22:13:22,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:22,105 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:22,105 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] [2025-03-14 22:13:22,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-14 22:13:22,105 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:13:22,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1723046281, now seen corresponding path program 8 times [2025-03-14 22:13:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339179546] [2025-03-14 22:13:22,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:13:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:22,113 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:13:22,113 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:13:22,257 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:13:22,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339179546] [2025-03-14 22:13:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339179546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:22,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:13:22,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082834052] [2025-03-14 22:13:22,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:22,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:13:22,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:22,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:13:22,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:13:22,259 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:13:22,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1257 places, 2986 transitions, 286946 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:22,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:22,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:13:22,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:34,333 INFO L124 PetriNetUnfolderBase]: 2394/10333 cut-off events. [2025-03-14 22:13:34,334 INFO L125 PetriNetUnfolderBase]: For 1697242/1745111 co-relation queries the response was YES. [2025-03-14 22:13:34,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287548 conditions, 10333 events. 2394/10333 cut-off events. For 1697242/1745111 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 118304 event pairs, 452 based on Foata normal form. 180/10081 useless extension candidates. Maximal degree in co-relation 180577. Up to 4785 conditions per place. [2025-03-14 22:13:34,652 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1093 selfloop transitions, 223 changer transitions 2285/3719 dead transitions. [2025-03-14 22:13:34,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1299 places, 3719 transitions, 353029 flow [2025-03-14 22:13:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-14 22:13:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-14 22:13:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5615 transitions. [2025-03-14 22:13:34,655 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6872705018359853 [2025-03-14 22:13:34,655 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1117 predicate places. [2025-03-14 22:13:34,655 INFO L471 AbstractCegarLoop]: Abstraction has has 1299 places, 3719 transitions, 353029 flow [2025-03-14 22:13:34,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:34,655 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:34,655 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] [2025-03-14 22:13:34,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-14 22:13:34,656 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:13:34,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:34,656 INFO L85 PathProgramCache]: Analyzing trace with hash 577164749, now seen corresponding path program 9 times [2025-03-14 22:13:34,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:34,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54226674] [2025-03-14 22:13:34,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:13:34,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:34,661 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:13:34,661 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:13:34,788 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:13:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:34,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54226674] [2025-03-14 22:13:34,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54226674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:34,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:34,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:13:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175100563] [2025-03-14 22:13:34,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:34,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:13:34,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:34,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:13:34,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:13:34,790 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:13:34,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1299 places, 3719 transitions, 353029 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:34,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:34,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:13:34,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:51,917 INFO L124 PetriNetUnfolderBase]: 2430/10588 cut-off events. [2025-03-14 22:13:51,918 INFO L125 PetriNetUnfolderBase]: For 1785917/1833476 co-relation queries the response was YES. [2025-03-14 22:13:51,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300538 conditions, 10588 events. 2430/10588 cut-off events. For 1785917/1833476 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 122250 event pairs, 443 based on Foata normal form. 205/10352 useless extension candidates. Maximal degree in co-relation 190995. Up to 4783 conditions per place. [2025-03-14 22:13:52,069 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1150 selfloop transitions, 200 changer transitions 2366/3834 dead transitions. [2025-03-14 22:13:52,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1347 places, 3834 transitions, 370764 flow [2025-03-14 22:13:52,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-14 22:13:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-14 22:13:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 6382 transitions. [2025-03-14 22:13:52,072 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.685499462943072 [2025-03-14 22:13:52,073 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1165 predicate places. [2025-03-14 22:13:52,073 INFO L471 AbstractCegarLoop]: Abstraction has has 1347 places, 3834 transitions, 370764 flow [2025-03-14 22:13:52,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:52,073 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:52,074 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] [2025-03-14 22:13:52,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-14 22:13:52,074 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:13:52,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 444677423, now seen corresponding path program 10 times [2025-03-14 22:13:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:52,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862437704] [2025-03-14 22:13:52,075 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:13:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:52,082 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:13:52,082 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:13:52,218 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:13:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862437704] [2025-03-14 22:13:52,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862437704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:52,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:52,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:13:52,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600903074] [2025-03-14 22:13:52,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:52,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:13:52,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:52,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:13:52,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:13:52,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:13:52,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1347 places, 3834 transitions, 370764 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:13:52,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:52,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:13:52,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:10,364 INFO L124 PetriNetUnfolderBase]: 2469/10757 cut-off events. [2025-03-14 22:14:10,364 INFO L125 PetriNetUnfolderBase]: For 1875307/1933610 co-relation queries the response was YES. [2025-03-14 22:14:10,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312985 conditions, 10757 events. 2469/10757 cut-off events. For 1875307/1933610 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 124574 event pairs, 423 based on Foata normal form. 235/10544 useless extension candidates. Maximal degree in co-relation 181524. Up to 4785 conditions per place. [2025-03-14 22:14:10,506 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1173 selfloop transitions, 224 changer transitions 2420/3935 dead transitions. [2025-03-14 22:14:10,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1380 places, 3935 transitions, 388240 flow [2025-03-14 22:14:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 22:14:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 22:14:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4492 transitions. [2025-03-14 22:14:10,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6953560371517028 [2025-03-14 22:14:10,509 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1198 predicate places. [2025-03-14 22:14:10,509 INFO L471 AbstractCegarLoop]: Abstraction has has 1380 places, 3935 transitions, 388240 flow [2025-03-14 22:14:10,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:10,509 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:10,509 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] [2025-03-14 22:14:10,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-14 22:14:10,509 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:14:10,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1492537375, now seen corresponding path program 11 times [2025-03-14 22:14:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:10,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944729278] [2025-03-14 22:14:10,510 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:10,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:10,515 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:14:10,515 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:10,647 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:14:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944729278] [2025-03-14 22:14:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944729278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:10,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145791905] [2025-03-14 22:14:10,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:10,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:10,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:10,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:10,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:10,648 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:14:10,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1380 places, 3935 transitions, 388240 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:10,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:10,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:14:10,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:31,107 INFO L124 PetriNetUnfolderBase]: 2496/10854 cut-off events. [2025-03-14 22:14:31,108 INFO L125 PetriNetUnfolderBase]: For 1923537/1984064 co-relation queries the response was YES. [2025-03-14 22:14:31,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324285 conditions, 10854 events. 2496/10854 cut-off events. For 1923537/1984064 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 125786 event pairs, 440 based on Foata normal form. 252/10663 useless extension candidates. Maximal degree in co-relation 188421. Up to 4785 conditions per place. [2025-03-14 22:14:31,257 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1178 selfloop transitions, 232 changer transitions 2482/4010 dead transitions. [2025-03-14 22:14:31,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1419 places, 4010 transitions, 402902 flow [2025-03-14 22:14:31,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-14 22:14:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-14 22:14:31,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5243 transitions. [2025-03-14 22:14:31,260 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6898684210526316 [2025-03-14 22:14:31,260 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1237 predicate places. [2025-03-14 22:14:31,260 INFO L471 AbstractCegarLoop]: Abstraction has has 1419 places, 4010 transitions, 402902 flow [2025-03-14 22:14:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:31,261 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:31,261 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] [2025-03-14 22:14:31,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-14 22:14:31,261 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:14:31,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:31,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1576858393, now seen corresponding path program 12 times [2025-03-14 22:14:31,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:31,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033699354] [2025-03-14 22:14:31,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:14:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:31,268 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:14:31,268 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:31,404 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:14:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033699354] [2025-03-14 22:14:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033699354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:31,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:31,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274428476] [2025-03-14 22:14:31,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:31,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:31,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:31,406 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:14:31,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1419 places, 4010 transitions, 402902 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:31,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:31,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:14:31,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:51,666 INFO L124 PetriNetUnfolderBase]: 2527/10975 cut-off events. [2025-03-14 22:14:51,666 INFO L125 PetriNetUnfolderBase]: For 2019403/2086412 co-relation queries the response was YES. [2025-03-14 22:14:51,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336034 conditions, 10975 events. 2527/10975 cut-off events. For 2019403/2086412 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 127647 event pairs, 444 based on Foata normal form. 195/10723 useless extension candidates. Maximal degree in co-relation 195671. Up to 4785 conditions per place. [2025-03-14 22:14:51,825 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1199 selfloop transitions, 232 changer transitions 2544/4093 dead transitions. [2025-03-14 22:14:51,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1457 places, 4093 transitions, 418802 flow [2025-03-14 22:14:51,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-14 22:14:51,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-14 22:14:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5110 transitions. [2025-03-14 22:14:51,827 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.689608636977058 [2025-03-14 22:14:51,827 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1275 predicate places. [2025-03-14 22:14:51,828 INFO L471 AbstractCegarLoop]: Abstraction has has 1457 places, 4093 transitions, 418802 flow [2025-03-14 22:14:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:51,828 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:51,828 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] [2025-03-14 22:14:51,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-03-14 22:14:51,828 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:14:51,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1289316407, now seen corresponding path program 13 times [2025-03-14 22:14:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:51,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786689769] [2025-03-14 22:14:51,829 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:14:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:51,952 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:14:51,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786689769] [2025-03-14 22:14:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786689769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:14:51,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992395063] [2025-03-14 22:14:51,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:51,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:51,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:51,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:14:51,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1457 places, 4093 transitions, 418802 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:14:51,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:51,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:14:51,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:14,551 INFO L124 PetriNetUnfolderBase]: 2546/11095 cut-off events. [2025-03-14 22:15:14,551 INFO L125 PetriNetUnfolderBase]: For 2064231/2132816 co-relation queries the response was YES. [2025-03-14 22:15:14,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346871 conditions, 11095 events. 2546/11095 cut-off events. For 2064231/2132816 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 129272 event pairs, 440 based on Foata normal form. 272/10921 useless extension candidates. Maximal degree in co-relation 202583. Up to 4785 conditions per place. [2025-03-14 22:15:14,711 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1177 selfloop transitions, 264 changer transitions 2599/4158 dead transitions. [2025-03-14 22:15:14,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1492 places, 4158 transitions, 433311 flow [2025-03-14 22:15:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-14 22:15:14,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-14 22:15:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 4736 transitions. [2025-03-14 22:15:14,713 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6923976608187135 [2025-03-14 22:15:14,714 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1310 predicate places. [2025-03-14 22:15:14,714 INFO L471 AbstractCegarLoop]: Abstraction has has 1492 places, 4158 transitions, 433311 flow [2025-03-14 22:15:14,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:15:14,714 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:14,714 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] [2025-03-14 22:15:14,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-03-14 22:15:14,714 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:15:14,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:14,715 INFO L85 PathProgramCache]: Analyzing trace with hash 20158335, now seen corresponding path program 14 times [2025-03-14 22:15:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700266422] [2025-03-14 22:15:14,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:15:14,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:14,722 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:15:14,722 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:14,852 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:15:14,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:14,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700266422] [2025-03-14 22:15:14,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700266422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:14,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:15:14,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594598758] [2025-03-14 22:15:14,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:14,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:15:14,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:14,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:15:14,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:15:14,854 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:15:14,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1492 places, 4158 transitions, 433311 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:15:14,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:14,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:15:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:38,768 INFO L124 PetriNetUnfolderBase]: 2567/11157 cut-off events. [2025-03-14 22:15:38,768 INFO L125 PetriNetUnfolderBase]: For 2126068/2200334 co-relation queries the response was YES. [2025-03-14 22:15:38,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357559 conditions, 11157 events. 2567/11157 cut-off events. For 2126068/2200334 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 130193 event pairs, 444 based on Foata normal form. 196/10910 useless extension candidates. Maximal degree in co-relation 208815. Up to 4785 conditions per place. [2025-03-14 22:15:38,924 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1206 selfloop transitions, 230 changer transitions 2669/4223 dead transitions. [2025-03-14 22:15:38,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1536 places, 4223 transitions, 447409 flow [2025-03-14 22:15:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:15:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:15:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5865 transitions. [2025-03-14 22:15:38,927 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6859649122807018 [2025-03-14 22:15:38,933 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1354 predicate places. [2025-03-14 22:15:38,933 INFO L471 AbstractCegarLoop]: Abstraction has has 1536 places, 4223 transitions, 447409 flow [2025-03-14 22:15:38,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:15:38,933 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:38,933 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] [2025-03-14 22:15:38,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-03-14 22:15:38,933 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:15:38,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:38,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1361582329, now seen corresponding path program 15 times [2025-03-14 22:15:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459533429] [2025-03-14 22:15:38,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:15:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:38,939 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:15:38,939 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:39,073 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:15:39,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:39,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459533429] [2025-03-14 22:15:39,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459533429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:39,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:39,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:15:39,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982513413] [2025-03-14 22:15:39,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:39,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:15:39,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:39,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:15:39,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:15:39,075 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:15:39,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1536 places, 4223 transitions, 447409 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:15:39,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:39,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:15:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:16:02,329 INFO L124 PetriNetUnfolderBase]: 2578/11312 cut-off events. [2025-03-14 22:16:02,329 INFO L125 PetriNetUnfolderBase]: For 2221775/2299613 co-relation queries the response was YES. [2025-03-14 22:16:02,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367769 conditions, 11312 events. 2578/11312 cut-off events. For 2221775/2299613 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 132808 event pairs, 434 based on Foata normal form. 194/11053 useless extension candidates. Maximal degree in co-relation 214964. Up to 4802 conditions per place. [2025-03-14 22:16:02,506 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1202 selfloop transitions, 228 changer transitions 2724/4272 dead transitions. [2025-03-14 22:16:02,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1565 places, 4272 transitions, 460666 flow [2025-03-14 22:16:02,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-14 22:16:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-14 22:16:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3979 transitions. [2025-03-14 22:16:02,508 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6980701754385965 [2025-03-14 22:16:02,509 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1383 predicate places. [2025-03-14 22:16:02,509 INFO L471 AbstractCegarLoop]: Abstraction has has 1565 places, 4272 transitions, 460666 flow [2025-03-14 22:16:02,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:02,509 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:16:02,509 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] [2025-03-14 22:16:02,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-03-14 22:16:02,509 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:16:02,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:16:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 221932471, now seen corresponding path program 16 times [2025-03-14 22:16:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:16:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479822640] [2025-03-14 22:16:02,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:16:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:16:02,518 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:16:02,518 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:16:02,645 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:16:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:16:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479822640] [2025-03-14 22:16:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479822640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:16:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:16:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:16:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870613300] [2025-03-14 22:16:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:16:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:16:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:16:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:16:02,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:16:02,647 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:16:02,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1565 places, 4272 transitions, 460666 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:02,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:16:02,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:16:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:16:28,435 INFO L124 PetriNetUnfolderBase]: 2595/11382 cut-off events. [2025-03-14 22:16:28,435 INFO L125 PetriNetUnfolderBase]: For 2268483/2349685 co-relation queries the response was YES. [2025-03-14 22:16:28,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378575 conditions, 11382 events. 2595/11382 cut-off events. For 2268483/2349685 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 133641 event pairs, 437 based on Foata normal form. 272/11200 useless extension candidates. Maximal degree in co-relation 221403. Up to 4848 conditions per place. [2025-03-14 22:16:28,765 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1187 selfloop transitions, 246 changer transitions 2778/4329 dead transitions. [2025-03-14 22:16:28,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1599 places, 4329 transitions, 474954 flow [2025-03-14 22:16:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:16:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:16:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4615 transitions. [2025-03-14 22:16:28,767 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.693984962406015 [2025-03-14 22:16:28,767 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1417 predicate places. [2025-03-14 22:16:28,767 INFO L471 AbstractCegarLoop]: Abstraction has has 1599 places, 4329 transitions, 474954 flow [2025-03-14 22:16:28,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:28,767 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:16:28,767 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] [2025-03-14 22:16:28,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-03-14 22:16:28,767 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:16:28,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:16:28,768 INFO L85 PathProgramCache]: Analyzing trace with hash 896136645, now seen corresponding path program 17 times [2025-03-14 22:16:28,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:16:28,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164818051] [2025-03-14 22:16:28,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:16:28,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:16:28,773 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:16:28,774 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:16:28,900 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:16:28,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:16:28,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164818051] [2025-03-14 22:16:28,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164818051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:16:28,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:16:28,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:16:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228419338] [2025-03-14 22:16:28,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:16:28,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:16:28,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:16:28,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:16:28,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:16:28,902 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:16:28,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1599 places, 4329 transitions, 474954 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:28,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:16:28,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:16:28,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:16:55,383 INFO L124 PetriNetUnfolderBase]: 2594/11434 cut-off events. [2025-03-14 22:16:55,384 INFO L125 PetriNetUnfolderBase]: For 2320010/2401639 co-relation queries the response was YES. [2025-03-14 22:16:55,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387686 conditions, 11434 events. 2594/11434 cut-off events. For 2320010/2401639 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 134581 event pairs, 434 based on Foata normal form. 168/11148 useless extension candidates. Maximal degree in co-relation 226651. Up to 4870 conditions per place. [2025-03-14 22:16:55,725 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1188 selfloop transitions, 209 changer transitions 2842/4357 dead transitions. [2025-03-14 22:16:55,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1631 places, 4357 transitions, 486653 flow [2025-03-14 22:16:55,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:16:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:16:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4355 transitions. [2025-03-14 22:16:55,727 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6945773524720893 [2025-03-14 22:16:55,728 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1449 predicate places. [2025-03-14 22:16:55,728 INFO L471 AbstractCegarLoop]: Abstraction has has 1631 places, 4357 transitions, 486653 flow [2025-03-14 22:16:55,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:55,728 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:16:55,728 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] [2025-03-14 22:16:55,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-03-14 22:16:55,728 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:16:55,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:16:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1612519765, now seen corresponding path program 18 times [2025-03-14 22:16:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:16:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376792298] [2025-03-14 22:16:55,729 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:16:55,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:16:55,735 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:16:55,735 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:16:55,859 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:16:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:16:55,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376792298] [2025-03-14 22:16:55,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376792298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:16:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:16:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:16:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288755916] [2025-03-14 22:16:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:16:55,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:16:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:16:55,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:16:55,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:16:55,861 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:16:55,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1631 places, 4357 transitions, 486653 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:16:55,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:16:55,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:16:55,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:17:21,968 INFO L124 PetriNetUnfolderBase]: 2603/11459 cut-off events. [2025-03-14 22:17:21,969 INFO L125 PetriNetUnfolderBase]: For 2404374/2496822 co-relation queries the response was YES. [2025-03-14 22:17:22,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397634 conditions, 11459 events. 2603/11459 cut-off events. For 2404374/2496822 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 135055 event pairs, 432 based on Foata normal form. 233/11236 useless extension candidates. Maximal degree in co-relation 273517. Up to 4903 conditions per place. [2025-03-14 22:17:22,162 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1162 selfloop transitions, 224 changer transitions 2900/4404 dead transitions. [2025-03-14 22:17:22,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1662 places, 4404 transitions, 500066 flow [2025-03-14 22:17:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-14 22:17:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-14 22:17:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 4240 transitions. [2025-03-14 22:17:22,164 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6973684210526315 [2025-03-14 22:17:22,165 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1480 predicate places. [2025-03-14 22:17:22,165 INFO L471 AbstractCegarLoop]: Abstraction has has 1662 places, 4404 transitions, 500066 flow [2025-03-14 22:17:22,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:17:22,165 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:17:22,165 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] [2025-03-14 22:17:22,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-03-14 22:17:22,165 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:17:22,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:17:22,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1967832185, now seen corresponding path program 19 times [2025-03-14 22:17:22,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:17:22,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281395948] [2025-03-14 22:17:22,166 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:17:22,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:17:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:17:22,330 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:17:22,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:17:22,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281395948] [2025-03-14 22:17:22,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281395948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:17:22,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:17:22,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:17:22,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244355008] [2025-03-14 22:17:22,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:17:22,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:17:22,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:17:22,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:17:22,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:17:22,332 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:17:22,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1662 places, 4404 transitions, 500066 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:17:22,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:17:22,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:17:22,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:17:49,159 INFO L124 PetriNetUnfolderBase]: 2608/11541 cut-off events. [2025-03-14 22:17:49,159 INFO L125 PetriNetUnfolderBase]: For 2470009/2565986 co-relation queries the response was YES. [2025-03-14 22:17:49,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407264 conditions, 11541 events. 2608/11541 cut-off events. For 2470009/2565986 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 136235 event pairs, 421 based on Foata normal form. 313/11392 useless extension candidates. Maximal degree in co-relation 238017. Up to 4930 conditions per place. [2025-03-14 22:17:49,349 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1138 selfloop transitions, 226 changer transitions 2958/4440 dead transitions. [2025-03-14 22:17:49,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1696 places, 4440 transitions, 512497 flow [2025-03-14 22:17:49,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:17:49,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:17:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4613 transitions. [2025-03-14 22:17:49,351 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6936842105263158 [2025-03-14 22:17:49,351 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1514 predicate places. [2025-03-14 22:17:49,351 INFO L471 AbstractCegarLoop]: Abstraction has has 1696 places, 4440 transitions, 512497 flow [2025-03-14 22:17:49,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:17:49,352 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:17:49,352 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] [2025-03-14 22:17:49,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-03-14 22:17:49,352 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:17:49,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:17:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1358619979, now seen corresponding path program 20 times [2025-03-14 22:17:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:17:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430598894] [2025-03-14 22:17:49,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:17:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:17:49,358 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:17:49,358 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:17:49,481 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:17:49,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:17:49,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430598894] [2025-03-14 22:17:49,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430598894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:17:49,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:17:49,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:17:49,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489402671] [2025-03-14 22:17:49,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:17:49,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:17:49,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:17:49,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:17:49,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:17:49,483 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:17:49,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1696 places, 4440 transitions, 512497 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:17:49,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:17:49,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:17:49,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:18:17,420 INFO L124 PetriNetUnfolderBase]: 2627/11642 cut-off events. [2025-03-14 22:18:17,420 INFO L125 PetriNetUnfolderBase]: For 2593179/2694287 co-relation queries the response was YES. [2025-03-14 22:18:17,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418818 conditions, 11642 events. 2627/11642 cut-off events. For 2593179/2694287 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 137880 event pairs, 438 based on Foata normal form. 256/11431 useless extension candidates. Maximal degree in co-relation 244950. Up to 4980 conditions per place. [2025-03-14 22:18:17,605 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1145 selfloop transitions, 212 changer transitions 3028/4503 dead transitions. [2025-03-14 22:18:17,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1740 places, 4503 transitions, 528332 flow [2025-03-14 22:18:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:18:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:18:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5873 transitions. [2025-03-14 22:18:17,607 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6869005847953217 [2025-03-14 22:18:17,607 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1558 predicate places. [2025-03-14 22:18:17,608 INFO L471 AbstractCegarLoop]: Abstraction has has 1740 places, 4503 transitions, 528332 flow [2025-03-14 22:18:17,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:18:17,608 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:18:17,608 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] [2025-03-14 22:18:17,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-03-14 22:18:17,608 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:18:17,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:18:17,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1460923511, now seen corresponding path program 21 times [2025-03-14 22:18:17,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:18:17,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119574837] [2025-03-14 22:18:17,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:18:17,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:18:17,616 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:18:17,616 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:18:17,736 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:18:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:18:17,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119574837] [2025-03-14 22:18:17,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119574837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:18:17,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:18:17,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:18:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794282766] [2025-03-14 22:18:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:18:17,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:18:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:18:17,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:18:17,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:18:17,737 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:18:17,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1740 places, 4503 transitions, 528332 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:18:17,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:18:17,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:18:17,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:18:46,927 INFO L124 PetriNetUnfolderBase]: 2629/11650 cut-off events. [2025-03-14 22:18:46,927 INFO L125 PetriNetUnfolderBase]: For 2638119/2742427 co-relation queries the response was YES. [2025-03-14 22:18:46,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428277 conditions, 11650 events. 2629/11650 cut-off events. For 2638119/2742427 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 137910 event pairs, 438 based on Foata normal form. 276/11458 useless extension candidates. Maximal degree in co-relation 250313. Up to 5002 conditions per place. [2025-03-14 22:18:47,130 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1128 selfloop transitions, 199 changer transitions 3090/4535 dead transitions. [2025-03-14 22:18:47,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1773 places, 4535 transitions, 540809 flow [2025-03-14 22:18:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-14 22:18:47,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-14 22:18:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 4488 transitions. [2025-03-14 22:18:47,132 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6947368421052632 [2025-03-14 22:18:47,132 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1591 predicate places. [2025-03-14 22:18:47,132 INFO L471 AbstractCegarLoop]: Abstraction has has 1773 places, 4535 transitions, 540809 flow [2025-03-14 22:18:47,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:18:47,132 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:18:47,132 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] [2025-03-14 22:18:47,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-03-14 22:18:47,133 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:18:47,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:18:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash -461069473, now seen corresponding path program 22 times [2025-03-14 22:18:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:18:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808173843] [2025-03-14 22:18:47,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:18:47,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:18:47,139 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:18:47,139 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:18:47,262 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:18:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:18:47,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808173843] [2025-03-14 22:18:47,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808173843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:18:47,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:18:47,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:18:47,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494589305] [2025-03-14 22:18:47,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:18:47,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:18:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:18:47,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:18:47,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:18:47,264 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:18:47,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1773 places, 4535 transitions, 540809 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:18:47,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:18:47,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:18:47,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:19:17,043 INFO L124 PetriNetUnfolderBase]: 2629/11641 cut-off events. [2025-03-14 22:19:17,043 INFO L125 PetriNetUnfolderBase]: For 2687610/2798302 co-relation queries the response was YES. [2025-03-14 22:19:17,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435711 conditions, 11641 events. 2629/11641 cut-off events. For 2687610/2798302 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 137833 event pairs, 438 based on Foata normal form. 246/11427 useless extension candidates. Maximal degree in co-relation 255362. Up to 4997 conditions per place. [2025-03-14 22:19:17,244 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1087 selfloop transitions, 176 changer transitions 3159/4540 dead transitions. [2025-03-14 22:19:17,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1812 places, 4540 transitions, 549909 flow [2025-03-14 22:19:17,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-14 22:19:17,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-14 22:19:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 5247 transitions. [2025-03-14 22:19:17,246 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6903947368421053 [2025-03-14 22:19:17,247 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1630 predicate places. [2025-03-14 22:19:17,247 INFO L471 AbstractCegarLoop]: Abstraction has has 1812 places, 4540 transitions, 549909 flow [2025-03-14 22:19:17,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:19:17,247 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:19:17,247 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:17,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-03-14 22:19:17,247 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:19:17,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:19:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1076353735, now seen corresponding path program 23 times [2025-03-14 22:19:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:19:17,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405839880] [2025-03-14 22:19:17,248 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:19:17,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:19:17,255 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:19:17,255 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:19:17,395 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:19:17,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:19:17,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405839880] [2025-03-14 22:19:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405839880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:19:17,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:19:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:19:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288526044] [2025-03-14 22:19:17,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:19:17,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:19:17,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:19:17,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:19:17,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:19:17,397 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:19:17,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1812 places, 4540 transitions, 549909 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:19:17,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:19:17,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:19:17,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:19:50,034 INFO L124 PetriNetUnfolderBase]: 2688/11927 cut-off events. [2025-03-14 22:19:50,034 INFO L125 PetriNetUnfolderBase]: For 2798923/2901689 co-relation queries the response was YES. [2025-03-14 22:19:50,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452138 conditions, 11927 events. 2688/11927 cut-off events. For 2798923/2901689 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 142057 event pairs, 422 based on Foata normal form. 137/11597 useless extension candidates. Maximal degree in co-relation 267371. Up to 5101 conditions per place. [2025-03-14 22:19:50,396 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1261 selfloop transitions, 84 changer transitions 3228/4691 dead transitions. [2025-03-14 22:19:50,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1849 places, 4691 transitions, 575380 flow [2025-03-14 22:19:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 22:19:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 22:19:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4910 transitions. [2025-03-14 22:19:50,398 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6800554016620498 [2025-03-14 22:19:50,398 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1667 predicate places. [2025-03-14 22:19:50,398 INFO L471 AbstractCegarLoop]: Abstraction has has 1849 places, 4691 transitions, 575380 flow [2025-03-14 22:19:50,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:19:50,399 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:19:50,399 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:50,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-03-14 22:19:50,399 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:19:50,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:19:50,400 INFO L85 PathProgramCache]: Analyzing trace with hash 767262423, now seen corresponding path program 24 times [2025-03-14 22:19:50,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:19:50,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844455345] [2025-03-14 22:19:50,400 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:19:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:19:50,407 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:19:50,407 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:19:50,538 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:19:50,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:19:50,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844455345] [2025-03-14 22:19:50,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844455345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:19:50,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:19:50,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:19:50,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461184943] [2025-03-14 22:19:50,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:19:50,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:19:50,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:19:50,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:19:50,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:19:50,540 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:19:50,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1849 places, 4691 transitions, 575380 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:19:50,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:19:50,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:19:50,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:20:24,972 INFO L124 PetriNetUnfolderBase]: 2718/12018 cut-off events. [2025-03-14 22:20:24,972 INFO L125 PetriNetUnfolderBase]: For 2904649/3016184 co-relation queries the response was YES. [2025-03-14 22:20:25,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 465655 conditions, 12018 events. 2718/12018 cut-off events. For 2904649/3016184 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 143201 event pairs, 448 based on Foata normal form. 143/11693 useless extension candidates. Maximal degree in co-relation 276366. Up to 5171 conditions per place. [2025-03-14 22:20:25,191 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1276 selfloop transitions, 97 changer transitions 3290/4781 dead transitions. [2025-03-14 22:20:25,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1883 places, 4781 transitions, 595405 flow [2025-03-14 22:20:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:20:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:20:25,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4535 transitions. [2025-03-14 22:20:25,193 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6819548872180451 [2025-03-14 22:20:25,193 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1701 predicate places. [2025-03-14 22:20:25,193 INFO L471 AbstractCegarLoop]: Abstraction has has 1883 places, 4781 transitions, 595405 flow [2025-03-14 22:20:25,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:20:25,194 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:20:25,194 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] [2025-03-14 22:20:25,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-03-14 22:20:25,194 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:20:25,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:20:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1839354223, now seen corresponding path program 25 times [2025-03-14 22:20:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:20:25,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130183629] [2025-03-14 22:20:25,195 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:20:25,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:20:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:20:25,516 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:20:25,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:20:25,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130183629] [2025-03-14 22:20:25,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130183629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:20:25,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:20:25,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:20:25,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704701532] [2025-03-14 22:20:25,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:20:25,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:20:25,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:20:25,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:20:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:20:25,517 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:20:25,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1883 places, 4781 transitions, 595405 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:20:25,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:20:25,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:20:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:21:01,553 INFO L124 PetriNetUnfolderBase]: 2773/12245 cut-off events. [2025-03-14 22:21:01,553 INFO L125 PetriNetUnfolderBase]: For 2992091/3104652 co-relation queries the response was YES. [2025-03-14 22:21:01,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482592 conditions, 12245 events. 2773/12245 cut-off events. For 2992091/3104652 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 146486 event pairs, 417 based on Foata normal form. 142/11917 useless extension candidates. Maximal degree in co-relation 317226. Up to 5282 conditions per place. [2025-03-14 22:21:01,788 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1326 selfloop transitions, 108 changer transitions 3361/4913 dead transitions. [2025-03-14 22:21:01,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1921 places, 4913 transitions, 620589 flow [2025-03-14 22:21:01,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-14 22:21:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-14 22:21:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5044 transitions. [2025-03-14 22:21:01,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6807017543859649 [2025-03-14 22:21:01,791 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1739 predicate places. [2025-03-14 22:21:01,791 INFO L471 AbstractCegarLoop]: Abstraction has has 1921 places, 4913 transitions, 620589 flow [2025-03-14 22:21:01,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:21:01,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:21:01,792 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] [2025-03-14 22:21:01,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-03-14 22:21:01,792 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:21:01,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:21:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1348494131, now seen corresponding path program 26 times [2025-03-14 22:21:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:21:01,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010861162] [2025-03-14 22:21:01,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:21:01,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:21:01,799 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:21:01,799 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:21:01,912 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:21:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:21:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010861162] [2025-03-14 22:21:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010861162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:21:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:21:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:21:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286013131] [2025-03-14 22:21:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:21:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:21:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:21:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:21:01,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:21:01,913 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:21:01,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1921 places, 4913 transitions, 620589 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:21:01,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:21:01,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:21:01,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:21:38,221 INFO L124 PetriNetUnfolderBase]: 2822/12363 cut-off events. [2025-03-14 22:21:38,221 INFO L125 PetriNetUnfolderBase]: For 3126571/3252673 co-relation queries the response was YES. [2025-03-14 22:21:38,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498850 conditions, 12363 events. 2822/12363 cut-off events. For 3126571/3252673 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 147886 event pairs, 436 based on Foata normal form. 167/12058 useless extension candidates. Maximal degree in co-relation 349821. Up to 5380 conditions per place. [2025-03-14 22:21:38,447 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1302 selfloop transitions, 181 changer transitions 3432/5033 dead transitions. [2025-03-14 22:21:38,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1961 places, 5033 transitions, 644693 flow [2025-03-14 22:21:38,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-14 22:21:38,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-14 22:21:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 5325 transitions. [2025-03-14 22:21:38,449 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6835686777920411 [2025-03-14 22:21:38,450 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1779 predicate places. [2025-03-14 22:21:38,450 INFO L471 AbstractCegarLoop]: Abstraction has has 1961 places, 5033 transitions, 644693 flow [2025-03-14 22:21:38,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:21:38,450 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:21:38,450 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] [2025-03-14 22:21:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-03-14 22:21:38,450 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:21:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:21:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash 697240645, now seen corresponding path program 27 times [2025-03-14 22:21:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:21:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430867454] [2025-03-14 22:21:38,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:21:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:21:38,624 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:21:38,624 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:21:38,746 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:21:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:21:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430867454] [2025-03-14 22:21:38,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430867454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:21:38,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:21:38,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:21:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550821817] [2025-03-14 22:21:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:21:38,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:21:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:21:38,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:21:38,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:21:38,748 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:21:38,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1961 places, 5033 transitions, 644693 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:21:38,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:21:38,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:21:38,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:22:19,144 INFO L124 PetriNetUnfolderBase]: 2843/12408 cut-off events. [2025-03-14 22:22:19,145 INFO L125 PetriNetUnfolderBase]: For 3173269/3298305 co-relation queries the response was YES. [2025-03-14 22:22:19,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511717 conditions, 12408 events. 2843/12408 cut-off events. For 3173269/3298305 co-relation queries the response was YES. Maximal size of possible extension queue 624. Compared 148284 event pairs, 433 based on Foata normal form. 163/12101 useless extension candidates. Maximal degree in co-relation 306366. Up to 5436 conditions per place. [2025-03-14 22:22:19,368 INFO L140 encePairwiseOnDemand]: 161/190 looper letters, 1310 selfloop transitions, 187 changer transitions 3487/5102 dead transitions. [2025-03-14 22:22:19,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1988 places, 5102 transitions, 663526 flow [2025-03-14 22:22:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-14 22:22:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-14 22:22:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3692 transitions. [2025-03-14 22:22:19,370 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.693984962406015 [2025-03-14 22:22:19,370 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1806 predicate places. [2025-03-14 22:22:19,371 INFO L471 AbstractCegarLoop]: Abstraction has has 1988 places, 5102 transitions, 663526 flow [2025-03-14 22:22:19,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:22:19,371 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:22:19,371 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] [2025-03-14 22:22:19,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-03-14 22:22:19,371 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:22:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:22:19,372 INFO L85 PathProgramCache]: Analyzing trace with hash 391130779, now seen corresponding path program 28 times [2025-03-14 22:22:19,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:22:19,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431821134] [2025-03-14 22:22:19,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:22:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:22:19,379 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:22:19,379 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:22:19,511 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:22:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:22:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431821134] [2025-03-14 22:22:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431821134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:22:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:22:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:22:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111850155] [2025-03-14 22:22:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:22:19,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:22:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:22:19,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:22:19,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:22:19,513 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:22:19,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1988 places, 5102 transitions, 663526 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:22:19,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:22:19,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:22:19,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:22:58,972 INFO L124 PetriNetUnfolderBase]: 2872/12701 cut-off events. [2025-03-14 22:22:58,973 INFO L125 PetriNetUnfolderBase]: For 3341480/3470534 co-relation queries the response was YES. [2025-03-14 22:22:59,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528383 conditions, 12701 events. 2872/12701 cut-off events. For 3341480/3470534 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 153159 event pairs, 435 based on Foata normal form. 146/12366 useless extension candidates. Maximal degree in co-relation 346582. Up to 5536 conditions per place. [2025-03-14 22:22:59,385 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1371 selfloop transitions, 148 changer transitions 3569/5206 dead transitions. [2025-03-14 22:22:59,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2032 places, 5206 transitions, 687399 flow [2025-03-14 22:22:59,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:22:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:22:59,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 5812 transitions. [2025-03-14 22:22:59,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.679766081871345 [2025-03-14 22:22:59,388 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1850 predicate places. [2025-03-14 22:22:59,388 INFO L471 AbstractCegarLoop]: Abstraction has has 2032 places, 5206 transitions, 687399 flow [2025-03-14 22:22:59,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:22:59,388 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:22:59,389 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] [2025-03-14 22:22:59,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-03-14 22:22:59,389 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:22:59,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:22:59,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1705924125, now seen corresponding path program 29 times [2025-03-14 22:22:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:22:59,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224629152] [2025-03-14 22:22:59,389 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:22:59,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:22:59,395 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:22:59,395 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:22:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:22:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:22:59,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224629152] [2025-03-14 22:22:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224629152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:22:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:22:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:22:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948416147] [2025-03-14 22:22:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:22:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:22:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:22:59,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:22:59,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:22:59,527 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:22:59,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2032 places, 5206 transitions, 687399 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:22:59,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:22:59,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:22:59,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:23:42,787 INFO L124 PetriNetUnfolderBase]: 2919/12891 cut-off events. [2025-03-14 22:23:42,787 INFO L125 PetriNetUnfolderBase]: For 3505194/3640421 co-relation queries the response was YES. [2025-03-14 22:23:42,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545526 conditions, 12891 events. 2919/12891 cut-off events. For 3505194/3640421 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 155803 event pairs, 437 based on Foata normal form. 145/12554 useless extension candidates. Maximal degree in co-relation 327073. Up to 5638 conditions per place. [2025-03-14 22:23:43,048 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1460 selfloop transitions, 122 changer transitions 3624/5324 dead transitions. [2025-03-14 22:23:43,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2060 places, 5324 transitions, 713997 flow [2025-03-14 22:23:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 22:23:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 22:23:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3792 transitions. [2025-03-14 22:23:43,050 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6882032667876588 [2025-03-14 22:23:43,050 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1878 predicate places. [2025-03-14 22:23:43,050 INFO L471 AbstractCegarLoop]: Abstraction has has 2060 places, 5324 transitions, 713997 flow [2025-03-14 22:23:43,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:23:43,051 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:23:43,051 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] [2025-03-14 22:23:43,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-03-14 22:23:43,051 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:23:43,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:23:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -276762409, now seen corresponding path program 30 times [2025-03-14 22:23:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:23:43,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18001092] [2025-03-14 22:23:43,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:23:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:23:43,058 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:23:43,059 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:23:43,190 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:23:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:23:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18001092] [2025-03-14 22:23:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18001092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:23:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:23:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:23:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061237472] [2025-03-14 22:23:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:23:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:23:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:23:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:23:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:23:43,192 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:23:43,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2060 places, 5324 transitions, 713997 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:23:43,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:23:43,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:23:43,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:24:28,225 INFO L124 PetriNetUnfolderBase]: 2942/12893 cut-off events. [2025-03-14 22:24:28,225 INFO L125 PetriNetUnfolderBase]: For 3577833/3722400 co-relation queries the response was YES. [2025-03-14 22:24:28,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559222 conditions, 12893 events. 2942/12893 cut-off events. For 3577833/3722400 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 155535 event pairs, 429 based on Foata normal form. 166/12578 useless extension candidates. Maximal degree in co-relation 335104. Up to 5697 conditions per place. [2025-03-14 22:24:28,481 INFO L140 encePairwiseOnDemand]: 167/190 looper letters, 1448 selfloop transitions, 140 changer transitions 3687/5393 dead transitions. [2025-03-14 22:24:28,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2092 places, 5393 transitions, 733465 flow [2025-03-14 22:24:28,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-14 22:24:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-14 22:24:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4289 transitions. [2025-03-14 22:24:28,484 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6840510366826156 [2025-03-14 22:24:28,484 INFO L298 CegarLoopForPetriNet]: 182 programPoint places, 1910 predicate places. [2025-03-14 22:24:28,484 INFO L471 AbstractCegarLoop]: Abstraction has has 2092 places, 5393 transitions, 733465 flow [2025-03-14 22:24:28,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:24:28,484 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:24:28,484 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] [2025-03-14 22:24:28,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-03-14 22:24:28,485 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-14 22:24:28,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:24:28,486 INFO L85 PathProgramCache]: Analyzing trace with hash 545911611, now seen corresponding path program 31 times [2025-03-14 22:24:28,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:24:28,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288209449] [2025-03-14 22:24:28,486 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:24:28,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:24:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:24:28,627 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:24:28,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:24:28,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288209449] [2025-03-14 22:24:28,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288209449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:24:28,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:24:28,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-14 22:24:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516571731] [2025-03-14 22:24:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:24:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:24:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:24:28,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:24:28,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:24:28,629 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 190 [2025-03-14 22:24:28,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2092 places, 5393 transitions, 733465 flow. Second operand has 14 states, 14 states have (on average 126.14285714285714) internal successors, (1766), 14 states have internal predecessors, (1766), 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:24:28,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:24:28,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 190 [2025-03-14 22:24:28,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 22:25:07,222 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:25:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-14 22:25:07,261 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:25:07,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-03-14 22:25:07,262 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 123/190 universal loopers) in iteration 81,while PetriNetUnfolder was constructing finite prefix that currently has 464884 conditions, 11214 events (2666/11213 cut-off events. For 3451292/3592631 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 140131 event pairs, 429 based on Foata normal form. 169/11142 useless extension candidates. Maximal degree in co-relation 314454. Up to 4530 conditions per place.). [2025-03-14 22:25:07,265 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:25:07,265 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:25:07,266 INFO L422 BasicCegarLoop]: Path program histogram: [31, 20, 15, 15] [2025-03-14 22:25:07,272 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:25:07,272 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:25:07,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:25:07 BasicIcfg [2025-03-14 22:25:07,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:25:07,290 INFO L158 Benchmark]: Toolchain (without parser) took 830057.38ms. Allocated memory was 71.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 43.7MB in the beginning and 557.8MB in the end (delta: -514.1MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-14 22:25:07,290 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:25:07,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.40ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 31.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:25:07,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.54ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 30.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:25:07,291 INFO L158 Benchmark]: Boogie Preprocessor took 27.82ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 29.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:25:07,291 INFO L158 Benchmark]: RCFGBuilder took 400.48ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 39.7MB in the end (delta: -10.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2025-03-14 22:25:07,291 INFO L158 Benchmark]: TraceAbstraction took 829397.17ms. Allocated memory was 71.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 38.4MB in the beginning and 557.8MB in the end (delta: -519.4MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-03-14 22:25:07,292 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.5MB in the beginning and 36.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.40ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 31.7MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.54ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 30.1MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.82ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 29.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 400.48ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 39.7MB in the end (delta: -10.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * TraceAbstraction took 829397.17ms. Allocated memory was 71.3MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 38.4MB in the beginning and 557.8MB in the end (delta: -519.4MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 123/190 universal loopers) in iteration 81,while PetriNetUnfolder was constructing finite prefix that currently has 464884 conditions, 11214 events (2666/11213 cut-off events. For 3451292/3592631 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 140131 event pairs, 429 based on Foata normal form. 169/11142 useless extension candidates. Maximal degree in co-relation 314454. Up to 4530 conditions per place.). - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 123/190 universal loopers) in iteration 81,while PetriNetUnfolder was constructing finite prefix that currently has 464884 conditions, 11214 events (2666/11213 cut-off events. For 3451292/3592631 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 140131 event pairs, 429 based on Foata normal form. 169/11142 useless extension candidates. Maximal degree in co-relation 314454. Up to 4530 conditions per place.). - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 123/190 universal loopers) in iteration 81,while PetriNetUnfolder was constructing finite prefix that currently has 464884 conditions, 11214 events (2666/11213 cut-off events. For 3451292/3592631 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 140131 event pairs, 429 based on Foata normal form. 169/11142 useless extension candidates. Maximal degree in co-relation 314454. Up to 4530 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 270 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: 829.3s, OverallIterations: 81, TraceHistogramMax: 1, PathProgramHistogramMax: 31, EmptinessCheckTime: 0.0s, AutomataDifference: 816.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11103 SdHoareTripleChecker+Valid, 15.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11103 mSDsluCounter, 62633 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54243 mSDsCounter, 557 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34536 IncrementalHoareTripleChecker+Invalid, 35093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 557 mSolverCounterUnsat, 8390 mSDtfsCounter, 34536 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2570 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 2381 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18167 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=733465occurred in iteration=80, InterpolantAutomatonStates: 2001, 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.3s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.5s InterpolantComputationTime, 8165 NumberOfCodeBlocks, 8165 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 8084 ConstructedInterpolants, 0 QuantifiedInterpolants, 32288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 81 InterpolantComputations, 81 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown