/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-array-int-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:02:17,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:02:18,094 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:02:18,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:02:18,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:02:18,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:02:18,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:02:18,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:02:18,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:02:18,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:02:18,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:02:18,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:02:18,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:02:18,125 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:02:18,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:02:18,125 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:02:18,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:02:18,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:02:18,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:02:18,375 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:02:18,375 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:02:18,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2025-03-14 22:02:19,498 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12464489/54008907de0241d2b917d4449828db53/FLAGd87f43499 [2025-03-14 22:02:19,663 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:02:19,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-array-int-symm.wvr.c [2025-03-14 22:02:19,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12464489/54008907de0241d2b917d4449828db53/FLAGd87f43499 [2025-03-14 22:02:20,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12464489/54008907de0241d2b917d4449828db53 [2025-03-14 22:02:20,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:02:20,075 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:02:20,076 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:02:20,076 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:02:20,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:02:20,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44eb5c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20, skipping insertion in model container [2025-03-14 22:02:20,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:02:20,199 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-array-int-symm.wvr.c[2508,2521] [2025-03-14 22:02:20,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:02:20,214 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:02:20,231 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-array-int-symm.wvr.c[2508,2521] [2025-03-14 22:02:20,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:02:20,247 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:02:20,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20 WrapperNode [2025-03-14 22:02:20,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:02:20,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:02:20,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:02:20,249 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:02:20,254 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:02:20" (1/1) ... [2025-03-14 22:02:20,262 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:02:20" (1/1) ... [2025-03-14 22:02:20,286 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 181 [2025-03-14 22:02:20,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:02:20,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:02:20,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:02:20,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:02:20,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:02:20,316 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:02:20,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:02:20,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:02:20,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (1/1) ... [2025-03-14 22:02:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:02:20,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:20,342 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:02:20,347 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:02:20,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:02:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:02:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:02:20,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:02:20,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:02:20,364 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:02:20,437 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:02:20,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:02:20,680 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:02:20,680 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:02:20,692 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:02:20,692 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 22:02:20,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:02:20 BoogieIcfgContainer [2025-03-14 22:02:20,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:02:20,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:02:20,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:02:20,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:02:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:02:20" (1/3) ... [2025-03-14 22:02:20,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be966f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:02:20, skipping insertion in model container [2025-03-14 22:02:20,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:02:20" (2/3) ... [2025-03-14 22:02:20,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be966f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:02:20, skipping insertion in model container [2025-03-14 22:02:20,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:02:20" (3/3) ... [2025-03-14 22:02:20,702 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-14 22:02:20,713 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:02:20,715 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 234 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-14 22:02:20,715 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:02:20,790 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:02:20,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:02:20,837 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;@7dd59280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:02:20,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:02:20,922 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:02:20,923 INFO L124 PetriNetUnfolderBase]: 16/240 cut-off events. [2025-03-14 22:02:20,924 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:02:20,924 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:20,925 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:20,925 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:02:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1941930278, now seen corresponding path program 1 times [2025-03-14 22:02:20,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:20,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065149249] [2025-03-14 22:02:20,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:20,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:22,104 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:02:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065149249] [2025-03-14 22:02:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065149249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:02:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311554305] [2025-03-14 22:02:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:02:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:22,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:02:22,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:02:22,141 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 250 [2025-03-14 22:02:22,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 250 transitions, 514 flow. Second operand has 20 states, 20 states have (on average 148.7) internal successors, (2974), 20 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states 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:02:22,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:22,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 250 [2025-03-14 22:02:22,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:23,340 INFO L124 PetriNetUnfolderBase]: 144/1820 cut-off events. [2025-03-14 22:02:23,340 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-14 22:02:23,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2308 conditions, 1820 events. 144/1820 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13521 event pairs, 57 based on Foata normal form. 95/1727 useless extension candidates. Maximal degree in co-relation 607. Up to 109 conditions per place. [2025-03-14 22:02:23,364 INFO L140 encePairwiseOnDemand]: 199/250 looper letters, 185 selfloop transitions, 34 changer transitions 37/395 dead transitions. [2025-03-14 22:02:23,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 395 transitions, 1353 flow [2025-03-14 22:02:23,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:02:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:02:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5375 transitions. [2025-03-14 22:02:23,399 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-03-14 22:02:23,403 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 27 predicate places. [2025-03-14 22:02:23,403 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 395 transitions, 1353 flow [2025-03-14 22:02:23,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 148.7) internal successors, (2974), 20 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states 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:02:23,405 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:23,405 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:23,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:02:23,405 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:02:23,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:23,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1038234774, now seen corresponding path program 2 times [2025-03-14 22:02:23,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:23,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094679076] [2025-03-14 22:02:23,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:23,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:23,448 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:23,448 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:23,969 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:02:23,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:23,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094679076] [2025-03-14 22:02:23,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094679076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:23,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:23,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:02:23,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200683710] [2025-03-14 22:02:23,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:23,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:02:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:23,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:02:23,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:02:23,976 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 250 [2025-03-14 22:02:23,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 395 transitions, 1353 flow. Second operand has 20 states, 20 states have (on average 148.7) internal successors, (2974), 20 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states 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:02:23,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:23,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 250 [2025-03-14 22:02:23,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:24,976 INFO L124 PetriNetUnfolderBase]: 140/1861 cut-off events. [2025-03-14 22:02:24,976 INFO L125 PetriNetUnfolderBase]: For 280/384 co-relation queries the response was YES. [2025-03-14 22:02:24,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 1861 events. 140/1861 cut-off events. For 280/384 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13646 event pairs, 52 based on Foata normal form. 4/1675 useless extension candidates. Maximal degree in co-relation 753. Up to 109 conditions per place. [2025-03-14 22:02:24,988 INFO L140 encePairwiseOnDemand]: 211/250 looper letters, 208 selfloop transitions, 36 changer transitions 59/442 dead transitions. [2025-03-14 22:02:24,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 442 transitions, 2159 flow [2025-03-14 22:02:24,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 22:02:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 22:02:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5331 transitions. [2025-03-14 22:02:24,998 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6092571428571428 [2025-03-14 22:02:24,998 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 61 predicate places. [2025-03-14 22:02:24,998 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 442 transitions, 2159 flow [2025-03-14 22:02:25,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 148.7) internal successors, (2974), 20 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states 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:02:25,000 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:25,000 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:25,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:02:25,000 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:02:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1918988779, now seen corresponding path program 1 times [2025-03-14 22:02:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519128560] [2025-03-14 22:02:25,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:25,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:25,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519128560] [2025-03-14 22:02:25,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519128560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:25,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968742781] [2025-03-14 22:02:25,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:25,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:25,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:25,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 22:02:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:25,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 22:02:25,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:25,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:25,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968742781] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:25,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:25,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15, 14] total 30 [2025-03-14 22:02:25,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385856098] [2025-03-14 22:02:25,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:25,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:02:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:25,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:02:25,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:02:25,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 250 [2025-03-14 22:02:25,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 442 transitions, 2159 flow. Second operand has 14 states, 14 states have (on average 150.57142857142858) internal successors, (2108), 14 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states 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:02:25,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:25,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 250 [2025-03-14 22:02:25,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:26,681 INFO L124 PetriNetUnfolderBase]: 149/2026 cut-off events. [2025-03-14 22:02:26,681 INFO L125 PetriNetUnfolderBase]: For 619/877 co-relation queries the response was YES. [2025-03-14 22:02:26,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 2026 events. 149/2026 cut-off events. For 619/877 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15411 event pairs, 39 based on Foata normal form. 0/1814 useless extension candidates. Maximal degree in co-relation 747. Up to 187 conditions per place. [2025-03-14 22:02:26,690 INFO L140 encePairwiseOnDemand]: 216/250 looper letters, 245 selfloop transitions, 30 changer transitions 67/481 dead transitions. [2025-03-14 22:02:26,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 481 transitions, 3089 flow [2025-03-14 22:02:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:02:26,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 22:02:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3716 transitions. [2025-03-14 22:02:26,697 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6193333333333333 [2025-03-14 22:02:26,697 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 84 predicate places. [2025-03-14 22:02:26,697 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 481 transitions, 3089 flow [2025-03-14 22:02:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 150.57142857142858) internal successors, (2108), 14 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states 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:02:26,699 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:26,699 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:26,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 22:02:26,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:26,903 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:02:26,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:26,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1751127073, now seen corresponding path program 2 times [2025-03-14 22:02:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578337853] [2025-03-14 22:02:26,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:26,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:26,928 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:26,928 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:27,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:27,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578337853] [2025-03-14 22:02:27,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578337853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:27,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:27,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-14 22:02:27,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638612011] [2025-03-14 22:02:27,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:27,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-14 22:02:27,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:27,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-14 22:02:27,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-14 22:02:27,337 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 250 [2025-03-14 22:02:27,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 481 transitions, 3089 flow. Second operand has 18 states, 18 states have (on average 149.33333333333334) internal successors, (2688), 18 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states 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:02:27,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:27,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 250 [2025-03-14 22:02:27,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:28,126 INFO L124 PetriNetUnfolderBase]: 151/2136 cut-off events. [2025-03-14 22:02:28,126 INFO L125 PetriNetUnfolderBase]: For 1196/1694 co-relation queries the response was YES. [2025-03-14 22:02:28,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 2136 events. 151/2136 cut-off events. For 1196/1694 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 16140 event pairs, 37 based on Foata normal form. 10/1922 useless extension candidates. Maximal degree in co-relation 821. Up to 187 conditions per place. [2025-03-14 22:02:28,136 INFO L140 encePairwiseOnDemand]: 215/250 looper letters, 265 selfloop transitions, 36 changer transitions 89/529 dead transitions. [2025-03-14 22:02:28,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 529 transitions, 4268 flow [2025-03-14 22:02:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 22:02:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 22:02:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4711 transitions. [2025-03-14 22:02:28,142 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6078709677419355 [2025-03-14 22:02:28,143 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 114 predicate places. [2025-03-14 22:02:28,143 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 529 transitions, 4268 flow [2025-03-14 22:02:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.33333333333334) internal successors, (2688), 18 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states 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:02:28,144 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:28,144 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:28,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:02:28,144 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:02:28,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:28,144 INFO L85 PathProgramCache]: Analyzing trace with hash 148373178, now seen corresponding path program 1 times [2025-03-14 22:02:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:28,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081301457] [2025-03-14 22:02:28,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081301457] [2025-03-14 22:02:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081301457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:28,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498252850] [2025-03-14 22:02:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:28,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:28,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:28,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:28,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 22:02:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:28,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 22:02:28,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:28,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:29,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498252850] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:29,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15, 14] total 30 [2025-03-14 22:02:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14668808] [2025-03-14 22:02:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:29,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:02:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:29,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:02:29,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-03-14 22:02:29,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 250 [2025-03-14 22:02:29,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 529 transitions, 4268 flow. Second operand has 14 states, 14 states have (on average 150.57142857142858) internal successors, (2108), 14 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states 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:02:29,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:29,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 250 [2025-03-14 22:02:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:29,741 INFO L124 PetriNetUnfolderBase]: 202/2759 cut-off events. [2025-03-14 22:02:29,742 INFO L125 PetriNetUnfolderBase]: For 2203/2911 co-relation queries the response was YES. [2025-03-14 22:02:29,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 2759 events. 202/2759 cut-off events. For 2203/2911 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 23194 event pairs, 40 based on Foata normal form. 0/2468 useless extension candidates. Maximal degree in co-relation 1057. Up to 383 conditions per place. [2025-03-14 22:02:29,759 INFO L140 encePairwiseOnDemand]: 219/250 looper letters, 336 selfloop transitions, 31 changer transitions 107/613 dead transitions. [2025-03-14 22:02:29,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 613 transitions, 6080 flow [2025-03-14 22:02:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:02:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 22:02:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3723 transitions. [2025-03-14 22:02:29,762 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6205 [2025-03-14 22:02:29,764 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 137 predicate places. [2025-03-14 22:02:29,764 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 613 transitions, 6080 flow [2025-03-14 22:02:29,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 150.57142857142858) internal successors, (2108), 14 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states 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:02:29,765 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:29,765 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:29,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 22:02:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:29,969 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:02:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash -418007644, now seen corresponding path program 2 times [2025-03-14 22:02:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530307099] [2025-03-14 22:02:29,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:29,992 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:29,993 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:30,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:30,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530307099] [2025-03-14 22:02:30,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530307099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:30,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:30,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:02:30,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420188908] [2025-03-14 22:02:30,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:02:30,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:30,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:02:30,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:02:30,468 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 250 [2025-03-14 22:02:30,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 613 transitions, 6080 flow. Second operand has 20 states, 20 states have (on average 141.95) internal successors, (2839), 20 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states 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:02:30,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:30,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 250 [2025-03-14 22:02:30,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:32,164 INFO L124 PetriNetUnfolderBase]: 610/6080 cut-off events. [2025-03-14 22:02:32,164 INFO L125 PetriNetUnfolderBase]: For 7912/10702 co-relation queries the response was YES. [2025-03-14 22:02:32,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14919 conditions, 6080 events. 610/6080 cut-off events. For 7912/10702 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 64500 event pairs, 122 based on Foata normal form. 17/5431 useless extension candidates. Maximal degree in co-relation 3049. Up to 690 conditions per place. [2025-03-14 22:02:32,195 INFO L140 encePairwiseOnDemand]: 213/250 looper letters, 537 selfloop transitions, 59 changer transitions 216/944 dead transitions. [2025-03-14 22:02:32,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 944 transitions, 11513 flow [2025-03-14 22:02:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-14 22:02:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-14 22:02:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6241 transitions. [2025-03-14 22:02:32,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5805581395348837 [2025-03-14 22:02:32,201 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 179 predicate places. [2025-03-14 22:02:32,201 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 944 transitions, 11513 flow [2025-03-14 22:02:32,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 141.95) internal successors, (2839), 20 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states 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:02:32,202 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:32,202 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:32,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:02:32,202 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:02:32,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:32,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1272506495, now seen corresponding path program 1 times [2025-03-14 22:02:32,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:32,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192171982] [2025-03-14 22:02:32,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:32,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192171982] [2025-03-14 22:02:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192171982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:32,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63359267] [2025-03-14 22:02:32,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:32,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:32,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:32,369 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:32,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 22:02:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:32,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:02:32,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:32,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:02:32,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63359267] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:32,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:32,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2025-03-14 22:02:32,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433283290] [2025-03-14 22:02:32,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:32,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:02:32,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:32,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:02:32,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:02:32,899 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2025-03-14 22:02:32,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 944 transitions, 11513 flow. Second operand has 11 states, 11 states have (on average 190.9090909090909) internal successors, (2100), 11 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:02:32,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:32,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2025-03-14 22:02:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:33,885 INFO L124 PetriNetUnfolderBase]: 921/7939 cut-off events. [2025-03-14 22:02:33,886 INFO L125 PetriNetUnfolderBase]: For 16310/17992 co-relation queries the response was YES. [2025-03-14 22:02:33,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20622 conditions, 7939 events. 921/7939 cut-off events. For 16310/17992 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 90245 event pairs, 204 based on Foata normal form. 15/7098 useless extension candidates. Maximal degree in co-relation 5044. Up to 859 conditions per place. [2025-03-14 22:02:33,921 INFO L140 encePairwiseOnDemand]: 230/250 looper letters, 259 selfloop transitions, 41 changer transitions 216/1025 dead transitions. [2025-03-14 22:02:33,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 1025 transitions, 13180 flow [2025-03-14 22:02:33,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:02:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:02:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3119 transitions. [2025-03-14 22:02:33,923 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.77975 [2025-03-14 22:02:33,924 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 194 predicate places. [2025-03-14 22:02:33,924 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 1025 transitions, 13180 flow [2025-03-14 22:02:33,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 190.9090909090909) internal successors, (2100), 11 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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:02:33,925 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:33,925 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:33,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 22:02:34,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:34,125 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:02:34,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1135562073, now seen corresponding path program 1 times [2025-03-14 22:02:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527404241] [2025-03-14 22:02:34,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527404241] [2025-03-14 22:02:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527404241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85117216] [2025-03-14 22:02:34,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:34,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:34,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:34,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:34,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 22:02:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:34,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-14 22:02:34,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:34,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85117216] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 22:02:34,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13, 11] total 23 [2025-03-14 22:02:34,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674410574] [2025-03-14 22:02:34,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:34,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:02:34,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:34,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:02:34,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2025-03-14 22:02:34,842 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 250 [2025-03-14 22:02:34,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 1025 transitions, 13180 flow. Second operand has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states 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:02:34,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:34,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 250 [2025-03-14 22:02:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:35,991 INFO L124 PetriNetUnfolderBase]: 944/8278 cut-off events. [2025-03-14 22:02:35,991 INFO L125 PetriNetUnfolderBase]: For 20911/22205 co-relation queries the response was YES. [2025-03-14 22:02:36,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23344 conditions, 8278 events. 944/8278 cut-off events. For 20911/22205 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 94981 event pairs, 201 based on Foata normal form. 11/7400 useless extension candidates. Maximal degree in co-relation 5647. Up to 882 conditions per place. [2025-03-14 22:02:36,089 INFO L140 encePairwiseOnDemand]: 230/250 looper letters, 340 selfloop transitions, 64 changer transitions 216/1118 dead transitions. [2025-03-14 22:02:36,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 1118 transitions, 15157 flow [2025-03-14 22:02:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:02:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:02:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3122 transitions. [2025-03-14 22:02:36,092 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7805 [2025-03-14 22:02:36,094 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 209 predicate places. [2025-03-14 22:02:36,094 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 1118 transitions, 15157 flow [2025-03-14 22:02:36,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 191.0) internal successors, (2101), 11 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states 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:02:36,095 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:36,095 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:36,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 22:02:36,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:36,296 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:02:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 956402110, now seen corresponding path program 1 times [2025-03-14 22:02:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:36,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733551612] [2025-03-14 22:02:36,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:36,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:36,387 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:02:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:36,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733551612] [2025-03-14 22:02:36,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733551612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:36,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:36,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:02:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480806574] [2025-03-14 22:02:36,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:36,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:02:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:36,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:02:36,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:02:36,389 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 250 [2025-03-14 22:02:36,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1118 transitions, 15157 flow. Second operand has 7 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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:02:36,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:36,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 250 [2025-03-14 22:02:36,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:37,065 INFO L124 PetriNetUnfolderBase]: 606/5137 cut-off events. [2025-03-14 22:02:37,066 INFO L125 PetriNetUnfolderBase]: For 18088/19242 co-relation queries the response was YES. [2025-03-14 22:02:37,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17085 conditions, 5137 events. 606/5137 cut-off events. For 18088/19242 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 51322 event pairs, 132 based on Foata normal form. 21/4647 useless extension candidates. Maximal degree in co-relation 5230. Up to 829 conditions per place. [2025-03-14 22:02:37,087 INFO L140 encePairwiseOnDemand]: 238/250 looper letters, 269 selfloop transitions, 13 changer transitions 222/930 dead transitions. [2025-03-14 22:02:37,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 930 transitions, 12984 flow [2025-03-14 22:02:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:02:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:02:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1977 transitions. [2025-03-14 22:02:37,089 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7908 [2025-03-14 22:02:37,090 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 215 predicate places. [2025-03-14 22:02:37,090 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 930 transitions, 12984 flow [2025-03-14 22:02:37,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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:02:37,090 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:37,090 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:37,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:02:37,090 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:02:37,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1648560034, now seen corresponding path program 1 times [2025-03-14 22:02:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:37,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542980433] [2025-03-14 22:02:37,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:37,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:37,161 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:02:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542980433] [2025-03-14 22:02:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542980433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:02:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484285544] [2025-03-14 22:02:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:02:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:37,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:02:37,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:02:37,163 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 250 [2025-03-14 22:02:37,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 930 transitions, 12984 flow. Second operand has 7 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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:02:37,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:37,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 250 [2025-03-14 22:02:37,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:37,708 INFO L124 PetriNetUnfolderBase]: 480/4242 cut-off events. [2025-03-14 22:02:37,709 INFO L125 PetriNetUnfolderBase]: For 17031/18205 co-relation queries the response was YES. [2025-03-14 22:02:37,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14669 conditions, 4242 events. 480/4242 cut-off events. For 17031/18205 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 40099 event pairs, 108 based on Foata normal form. 6/3821 useless extension candidates. Maximal degree in co-relation 5629. Up to 829 conditions per place. [2025-03-14 22:02:37,729 INFO L140 encePairwiseOnDemand]: 238/250 looper letters, 190 selfloop transitions, 8 changer transitions 235/736 dead transitions. [2025-03-14 22:02:37,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 736 transitions, 10658 flow [2025-03-14 22:02:37,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:02:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:02:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1975 transitions. [2025-03-14 22:02:37,730 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.79 [2025-03-14 22:02:37,731 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 221 predicate places. [2025-03-14 22:02:37,731 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 736 transitions, 10658 flow [2025-03-14 22:02:37,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.28571428571428) internal successors, (1360), 7 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states 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:02:37,731 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:37,731 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:37,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:02:37,732 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:02:37,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1873085735, now seen corresponding path program 1 times [2025-03-14 22:02:37,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559841457] [2025-03-14 22:02:37,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559841457] [2025-03-14 22:02:38,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559841457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:38,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55403469] [2025-03-14 22:02:38,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:38,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:38,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:38,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:38,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 22:02:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:38,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-14 22:02:38,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:38,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55403469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:02:39,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:02:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 43 [2025-03-14 22:02:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228302739] [2025-03-14 22:02:39,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:02:39,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-14 22:02:39,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:39,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-14 22:02:39,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1551, Unknown=0, NotChecked=0, Total=1806 [2025-03-14 22:02:39,330 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 250 [2025-03-14 22:02:39,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 736 transitions, 10658 flow. Second operand has 43 states, 43 states have (on average 146.97674418604652) internal successors, (6320), 43 states have internal predecessors, (6320), 0 states have call successors, (0), 0 states 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:02:39,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:39,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 250 [2025-03-14 22:02:39,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:41,530 INFO L124 PetriNetUnfolderBase]: 1123/9429 cut-off events. [2025-03-14 22:02:41,530 INFO L125 PetriNetUnfolderBase]: For 47188/50425 co-relation queries the response was YES. [2025-03-14 22:02:41,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34360 conditions, 9429 events. 1123/9429 cut-off events. For 47188/50425 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 108976 event pairs, 288 based on Foata normal form. 10/8458 useless extension candidates. Maximal degree in co-relation 5850. Up to 1997 conditions per place. [2025-03-14 22:02:41,595 INFO L140 encePairwiseOnDemand]: 214/250 looper letters, 683 selfloop transitions, 55 changer transitions 345/1252 dead transitions. [2025-03-14 22:02:41,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1252 transitions, 21940 flow [2025-03-14 22:02:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 22:02:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 22:02:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 6711 transitions. [2025-03-14 22:02:41,606 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5965333333333334 [2025-03-14 22:02:41,606 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 265 predicate places. [2025-03-14 22:02:41,606 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 1252 transitions, 21940 flow [2025-03-14 22:02:41,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 146.97674418604652) internal successors, (6320), 43 states have internal predecessors, (6320), 0 states have call successors, (0), 0 states 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:02:41,608 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-14 22:02:41,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 22:02:41,812 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:02:41,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:41,813 INFO L85 PathProgramCache]: Analyzing trace with hash -346519907, now seen corresponding path program 2 times [2025-03-14 22:02:41,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:41,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866106248] [2025-03-14 22:02:41,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:41,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:41,833 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:02:41,833 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:42,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:42,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866106248] [2025-03-14 22:02:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866106248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:42,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:42,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:02:42,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513863455] [2025-03-14 22:02:42,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:42,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:02:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:42,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:02:42,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:02:42,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 250 [2025-03-14 22:02:42,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 1252 transitions, 21940 flow. Second operand has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:02:42,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:42,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 250 [2025-03-14 22:02:42,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:43,747 INFO L124 PetriNetUnfolderBase]: 1256/10429 cut-off events. [2025-03-14 22:02:43,747 INFO L125 PetriNetUnfolderBase]: For 64860/68974 co-relation queries the response was YES. [2025-03-14 22:02:43,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40174 conditions, 10429 events. 1256/10429 cut-off events. For 64860/68974 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 124224 event pairs, 278 based on Foata normal form. 39/9369 useless extension candidates. Maximal degree in co-relation 7302. Up to 2196 conditions per place. [2025-03-14 22:02:43,802 INFO L140 encePairwiseOnDemand]: 230/250 looper letters, 725 selfloop transitions, 60 changer transitions 411/1442 dead transitions. [2025-03-14 22:02:43,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 1442 transitions, 27900 flow [2025-03-14 22:02:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:02:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:02:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2827 transitions. [2025-03-14 22:02:43,804 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.70675 [2025-03-14 22:02:43,805 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 280 predicate places. [2025-03-14 22:02:43,805 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 1442 transitions, 27900 flow [2025-03-14 22:02:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:02:43,805 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:43,805 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:43,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 22:02:43,806 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:02:43,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 993776692, now seen corresponding path program 1 times [2025-03-14 22:02:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122956289] [2025-03-14 22:02:43,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:43,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:43,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122956289] [2025-03-14 22:02:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122956289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:43,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:43,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:02:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731954568] [2025-03-14 22:02:43,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:43,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:02:43,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:43,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:02:43,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:02:43,880 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 250 [2025-03-14 22:02:43,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1442 transitions, 27900 flow. Second operand has 7 states, 7 states have (on average 194.85714285714286) internal successors, (1364), 7 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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:02:43,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:43,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 250 [2025-03-14 22:02:43,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:44,960 INFO L124 PetriNetUnfolderBase]: 824/6352 cut-off events. [2025-03-14 22:02:44,960 INFO L125 PetriNetUnfolderBase]: For 53992/57667 co-relation queries the response was YES. [2025-03-14 22:02:44,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29648 conditions, 6352 events. 824/6352 cut-off events. For 53992/57667 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 65707 event pairs, 190 based on Foata normal form. 47/5785 useless extension candidates. Maximal degree in co-relation 4743. Up to 1584 conditions per place. [2025-03-14 22:02:44,995 INFO L140 encePairwiseOnDemand]: 238/250 looper letters, 330 selfloop transitions, 25 changer transitions 420/1195 dead transitions. [2025-03-14 22:02:44,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 527 places, 1195 transitions, 23910 flow [2025-03-14 22:02:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:02:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:02:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1962 transitions. [2025-03-14 22:02:44,997 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7848 [2025-03-14 22:02:44,997 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 287 predicate places. [2025-03-14 22:02:44,997 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 1195 transitions, 23910 flow [2025-03-14 22:02:44,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.85714285714286) internal successors, (1364), 7 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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:02:44,998 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:44,998 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:44,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 22:02:44,998 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:02:44,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:44,998 INFO L85 PathProgramCache]: Analyzing trace with hash -983921742, now seen corresponding path program 1 times [2025-03-14 22:02:44,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:44,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570585825] [2025-03-14 22:02:44,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:44,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:02:45,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570585825] [2025-03-14 22:02:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570585825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 22:02:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844292133] [2025-03-14 22:02:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 22:02:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:45,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 22:02:45,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 22:02:45,068 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 250 [2025-03-14 22:02:45,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 1195 transitions, 23910 flow. Second operand has 7 states, 7 states have (on average 194.85714285714286) internal successors, (1364), 7 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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:02:45,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:45,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 250 [2025-03-14 22:02:45,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:45,860 INFO L124 PetriNetUnfolderBase]: 654/5170 cut-off events. [2025-03-14 22:02:45,860 INFO L125 PetriNetUnfolderBase]: For 49630/52626 co-relation queries the response was YES. [2025-03-14 22:02:45,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24950 conditions, 5170 events. 654/5170 cut-off events. For 49630/52626 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 50298 event pairs, 169 based on Foata normal form. 32/4691 useless extension candidates. Maximal degree in co-relation 4988. Up to 1351 conditions per place. [2025-03-14 22:02:45,891 INFO L140 encePairwiseOnDemand]: 238/250 looper letters, 234 selfloop transitions, 16 changer transitions 368/929 dead transitions. [2025-03-14 22:02:45,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 929 transitions, 19144 flow [2025-03-14 22:02:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:02:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:02:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1960 transitions. [2025-03-14 22:02:45,892 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.784 [2025-03-14 22:02:45,892 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 283 predicate places. [2025-03-14 22:02:45,892 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 929 transitions, 19144 flow [2025-03-14 22:02:45,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 194.85714285714286) internal successors, (1364), 7 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states 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:02:45,893 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:45,893 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:45,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 22:02:45,894 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:02:45,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:45,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1533304093, now seen corresponding path program 3 times [2025-03-14 22:02:45,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:45,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899460503] [2025-03-14 22:02:45,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:02:45,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:45,916 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:02:45,917 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-14 22:02:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899460503] [2025-03-14 22:02:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899460503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-14 22:02:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352697912] [2025-03-14 22:02:46,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:46,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 22:02:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:46,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 22:02:46,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-14 22:02:46,142 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 250 [2025-03-14 22:02:46,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 929 transitions, 19144 flow. Second operand has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:02:46,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:46,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 250 [2025-03-14 22:02:46,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:47,242 INFO L124 PetriNetUnfolderBase]: 654/5065 cut-off events. [2025-03-14 22:02:47,242 INFO L125 PetriNetUnfolderBase]: For 60421/63583 co-relation queries the response was YES. [2025-03-14 22:02:47,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26145 conditions, 5065 events. 654/5065 cut-off events. For 60421/63583 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 49020 event pairs, 190 based on Foata normal form. 48/4605 useless extension candidates. Maximal degree in co-relation 5162. Up to 1345 conditions per place. [2025-03-14 22:02:47,273 INFO L140 encePairwiseOnDemand]: 230/250 looper letters, 381 selfloop transitions, 30 changer transitions 412/1029 dead transitions. [2025-03-14 22:02:47,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 1029 transitions, 22766 flow [2025-03-14 22:02:47,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:02:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:02:47,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2828 transitions. [2025-03-14 22:02:47,275 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.707 [2025-03-14 22:02:47,275 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 298 predicate places. [2025-03-14 22:02:47,275 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 1029 transitions, 22766 flow [2025-03-14 22:02:47,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 174.0) internal successors, (2088), 12 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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:02:47,276 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:47,276 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:47,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 22:02:47,276 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:02:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1342147253, now seen corresponding path program 1 times [2025-03-14 22:02:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959025303] [2025-03-14 22:02:47,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:02:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:02:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:47,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:47,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959025303] [2025-03-14 22:02:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959025303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:47,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:02:47,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356592784] [2025-03-14 22:02:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:47,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:02:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:47,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:02:47,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:02:47,721 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:02:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 1029 transitions, 22766 flow. Second operand has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:02:47,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:47,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:02:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:50,709 INFO L124 PetriNetUnfolderBase]: 3397/15236 cut-off events. [2025-03-14 22:02:50,710 INFO L125 PetriNetUnfolderBase]: For 130512/134228 co-relation queries the response was YES. [2025-03-14 22:02:50,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65144 conditions, 15236 events. 3397/15236 cut-off events. For 130512/134228 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 175453 event pairs, 1249 based on Foata normal form. 42/13882 useless extension candidates. Maximal degree in co-relation 17111. Up to 3554 conditions per place. [2025-03-14 22:02:50,787 INFO L140 encePairwiseOnDemand]: 221/250 looper letters, 461 selfloop transitions, 39 changer transitions 415/1306 dead transitions. [2025-03-14 22:02:50,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 1306 transitions, 30176 flow [2025-03-14 22:02:50,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-14 22:02:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-14 22:02:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4417 transitions. [2025-03-14 22:02:50,790 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7361666666666666 [2025-03-14 22:02:50,790 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 321 predicate places. [2025-03-14 22:02:50,790 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 1306 transitions, 30176 flow [2025-03-14 22:02:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:02:50,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:50,791 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:50,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 22:02:50,791 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:02:50,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1656726849, now seen corresponding path program 2 times [2025-03-14 22:02:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:50,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025064248] [2025-03-14 22:02:50,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:02:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:50,813 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:02:50,813 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:51,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:51,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025064248] [2025-03-14 22:02:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025064248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:02:51,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:02:51,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:02:51,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765626398] [2025-03-14 22:02:51,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:02:51,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:02:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:51,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:02:51,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:02:51,262 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:02:51,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1306 transitions, 30176 flow. Second operand has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:02:51,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:51,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:02:51,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:02:56,718 INFO L124 PetriNetUnfolderBase]: 5190/23491 cut-off events. [2025-03-14 22:02:56,718 INFO L125 PetriNetUnfolderBase]: For 188161/193441 co-relation queries the response was YES. [2025-03-14 22:02:56,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103544 conditions, 23491 events. 5190/23491 cut-off events. For 188161/193441 co-relation queries the response was YES. Maximal size of possible extension queue 537. Compared 293895 event pairs, 1395 based on Foata normal form. 76/21536 useless extension candidates. Maximal degree in co-relation 26131. Up to 5033 conditions per place. [2025-03-14 22:02:56,864 INFO L140 encePairwiseOnDemand]: 219/250 looper letters, 719 selfloop transitions, 80 changer transitions 459/1649 dead transitions. [2025-03-14 22:02:56,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1649 transitions, 39108 flow [2025-03-14 22:02:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 22:02:56,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 22:02:56,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5346 transitions. [2025-03-14 22:02:56,867 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7373793103448276 [2025-03-14 22:02:56,867 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 349 predicate places. [2025-03-14 22:02:56,867 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 1649 transitions, 39108 flow [2025-03-14 22:02:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:02:56,868 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:02:56,868 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:02:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 22:02:56,868 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:02:56,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:02:56,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1508168951, now seen corresponding path program 3 times [2025-03-14 22:02:56,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:02:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377387044] [2025-03-14 22:02:56,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:02:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:02:56,888 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:02:56,889 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:02:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377387044] [2025-03-14 22:02:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377387044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:02:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402672292] [2025-03-14 22:02:57,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:02:57,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:02:57,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:02:57,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:02:57,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 22:02:57,375 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 22:02:57,375 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:02:57,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-14 22:02:57,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:02:57,586 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 22:02:57,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 22:02:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:57,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:02:57,724 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 22:02:57,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-14 22:02:57,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:02:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402672292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:02:57,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:02:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 9] total 29 [2025-03-14 22:02:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526094591] [2025-03-14 22:02:57,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:02:57,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-14 22:02:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:02:57,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-14 22:02:57,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2025-03-14 22:02:57,772 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:02:57,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 1649 transitions, 39108 flow. Second operand has 29 states, 29 states have (on average 179.24137931034483) internal successors, (5198), 29 states have internal predecessors, (5198), 0 states have call successors, (0), 0 states 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:02:57,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:02:57,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:02:57,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:06,012 INFO L124 PetriNetUnfolderBase]: 6896/29894 cut-off events. [2025-03-14 22:03:06,012 INFO L125 PetriNetUnfolderBase]: For 243322/249534 co-relation queries the response was YES. [2025-03-14 22:03:06,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142749 conditions, 29894 events. 6896/29894 cut-off events. For 243322/249534 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 384444 event pairs, 1198 based on Foata normal form. 115/27468 useless extension candidates. Maximal degree in co-relation 40371. Up to 6337 conditions per place. [2025-03-14 22:03:06,267 INFO L140 encePairwiseOnDemand]: 218/250 looper letters, 1175 selfloop transitions, 180 changer transitions 459/2205 dead transitions. [2025-03-14 22:03:06,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 2205 transitions, 54547 flow [2025-03-14 22:03:06,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-14 22:03:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-14 22:03:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 7037 transitions. [2025-03-14 22:03:06,270 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7407368421052631 [2025-03-14 22:03:06,275 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 386 predicate places. [2025-03-14 22:03:06,275 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 2205 transitions, 54547 flow [2025-03-14 22:03:06,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 179.24137931034483) internal successors, (5198), 29 states have internal predecessors, (5198), 0 states have call successors, (0), 0 states 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:03:06,276 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:06,276 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:03:06,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 22:03:06,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 22:03:06,476 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:03:06,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:06,477 INFO L85 PathProgramCache]: Analyzing trace with hash -984833255, now seen corresponding path program 1 times [2025-03-14 22:03:06,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:06,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646337035] [2025-03-14 22:03:06,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:06,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:03:06,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646337035] [2025-03-14 22:03:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646337035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043674411] [2025-03-14 22:03:06,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:03:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:06,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:03:06,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 22:03:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:03:06,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-14 22:03:06,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:07,467 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 22:03:07,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 22:03:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:07,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:08,140 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-14 22:03:08,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2025-03-14 22:03:08,169 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-14 22:03:08,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-14 22:03:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043674411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:03:08,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:03:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32, 32] total 68 [2025-03-14 22:03:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379343696] [2025-03-14 22:03:08,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:03:08,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-14 22:03:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:08,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-14 22:03:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=4253, Unknown=0, NotChecked=0, Total=4556 [2025-03-14 22:03:08,701 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 250 [2025-03-14 22:03:08,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 2205 transitions, 54547 flow. Second operand has 68 states, 68 states have (on average 86.92647058823529) internal successors, (5911), 68 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states 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:03:08,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:08,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 250 [2025-03-14 22:03:08,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:30,813 INFO L124 PetriNetUnfolderBase]: 14012/42660 cut-off events. [2025-03-14 22:03:30,813 INFO L125 PetriNetUnfolderBase]: For 506332/516896 co-relation queries the response was YES. [2025-03-14 22:03:31,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240818 conditions, 42660 events. 14012/42660 cut-off events. For 506332/516896 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 516226 event pairs, 849 based on Foata normal form. 97/39191 useless extension candidates. Maximal degree in co-relation 66603. Up to 10778 conditions per place. [2025-03-14 22:03:31,271 INFO L140 encePairwiseOnDemand]: 186/250 looper letters, 4206 selfloop transitions, 619 changer transitions 482/5384 dead transitions. [2025-03-14 22:03:31,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 5384 transitions, 102850 flow [2025-03-14 22:03:31,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2025-03-14 22:03:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2025-03-14 22:03:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 13978 transitions. [2025-03-14 22:03:31,279 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3777837837837838 [2025-03-14 22:03:31,279 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 533 predicate places. [2025-03-14 22:03:31,279 INFO L471 AbstractCegarLoop]: Abstraction has has 773 places, 5384 transitions, 102850 flow [2025-03-14 22:03:31,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 86.92647058823529) internal successors, (5911), 68 states have internal predecessors, (5911), 0 states have call successors, (0), 0 states 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:03:31,281 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:31,281 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:03:31,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-14 22:03:31,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:31,482 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:03:31,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1995114561, now seen corresponding path program 4 times [2025-03-14 22:03:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:31,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551003824] [2025-03-14 22:03:31,483 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:03:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:31,498 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:03:31,498 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:03:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551003824] [2025-03-14 22:03:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551003824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:03:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:03:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:03:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422754571] [2025-03-14 22:03:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:03:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:03:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:31,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:03:31,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:03:31,893 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2025-03-14 22:03:31,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 773 places, 5384 transitions, 102850 flow. Second operand has 10 states, 10 states have (on average 199.1) internal successors, (1991), 10 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states 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:03:31,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:31,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2025-03-14 22:03:31,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:03:52,677 INFO L124 PetriNetUnfolderBase]: 14951/46235 cut-off events. [2025-03-14 22:03:52,678 INFO L125 PetriNetUnfolderBase]: For 599364/611548 co-relation queries the response was YES. [2025-03-14 22:03:52,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277472 conditions, 46235 events. 14951/46235 cut-off events. For 599364/611548 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 570394 event pairs, 1135 based on Foata normal form. 84/42413 useless extension candidates. Maximal degree in co-relation 84900. Up to 11363 conditions per place. [2025-03-14 22:03:53,073 INFO L140 encePairwiseOnDemand]: 236/250 looper letters, 3797 selfloop transitions, 483 changer transitions 482/5863 dead transitions. [2025-03-14 22:03:53,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 789 places, 5863 transitions, 119686 flow [2025-03-14 22:03:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 22:03:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 22:03:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3538 transitions. [2025-03-14 22:03:53,076 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8324705882352941 [2025-03-14 22:03:53,076 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 549 predicate places. [2025-03-14 22:03:53,076 INFO L471 AbstractCegarLoop]: Abstraction has has 789 places, 5863 transitions, 119686 flow [2025-03-14 22:03:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 199.1) internal successors, (1991), 10 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states 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:03:53,076 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:03:53,077 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:03:53,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 22:03:53,077 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:03:53,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:03:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -808937019, now seen corresponding path program 5 times [2025-03-14 22:03:53,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:03:53,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38628008] [2025-03-14 22:03:53,078 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:03:53,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:03:53,095 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:03:53,095 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:03:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:03:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38628008] [2025-03-14 22:03:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38628008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:03:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456845824] [2025-03-14 22:03:53,707 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:03:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:03:53,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:03:53,709 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:03:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-14 22:03:53,781 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:03:53,781 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:03:53,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-14 22:03:53,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:03:54,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 22:03:54,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 22:03:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:55,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:03:55,430 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 22:03:55,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-14 22:03:55,448 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-14 22:03:55,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2025-03-14 22:03:56,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:03:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456845824] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:03:56,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:03:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 42, 32] total 83 [2025-03-14 22:03:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348747531] [2025-03-14 22:03:56,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:03:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-03-14 22:03:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:03:56,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-03-14 22:03:56,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=6263, Unknown=0, NotChecked=0, Total=6806 [2025-03-14 22:03:56,177 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 250 [2025-03-14 22:03:56,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 789 places, 5863 transitions, 119686 flow. Second operand has 83 states, 83 states have (on average 86.13253012048193) internal successors, (7149), 83 states have internal predecessors, (7149), 0 states have call successors, (0), 0 states 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:03:56,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:03:56,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 250 [2025-03-14 22:03:56,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:04:51,678 INFO L124 PetriNetUnfolderBase]: 25895/72989 cut-off events. [2025-03-14 22:04:51,678 INFO L125 PetriNetUnfolderBase]: For 1076198/1078946 co-relation queries the response was YES. [2025-03-14 22:04:52,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453418 conditions, 72989 events. 25895/72989 cut-off events. For 1076198/1078946 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 908670 event pairs, 4334 based on Foata normal form. 111/67549 useless extension candidates. Maximal degree in co-relation 153370. Up to 16119 conditions per place. [2025-03-14 22:04:52,504 INFO L140 encePairwiseOnDemand]: 172/250 looper letters, 5071 selfloop transitions, 1502 changer transitions 535/7647 dead transitions. [2025-03-14 22:04:52,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 7647 transitions, 156449 flow [2025-03-14 22:04:52,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2025-03-14 22:04:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2025-03-14 22:04:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 20458 transitions. [2025-03-14 22:04:52,513 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3702805429864253 [2025-03-14 22:04:52,514 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 769 predicate places. [2025-03-14 22:04:52,514 INFO L471 AbstractCegarLoop]: Abstraction has has 1009 places, 7647 transitions, 156449 flow [2025-03-14 22:04:52,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 86.13253012048193) internal successors, (7149), 83 states have internal predecessors, (7149), 0 states have call successors, (0), 0 states 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:04:52,515 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:04:52,516 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:04:52,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-14 22:04:52,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-14 22:04:52,720 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:04:52,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:04:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash 204432933, now seen corresponding path program 6 times [2025-03-14 22:04:52,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:04:52,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979912161] [2025-03-14 22:04:52,721 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:04:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:04:52,735 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:04:52,735 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:04:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:04:53,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:04:53,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979912161] [2025-03-14 22:04:53,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979912161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:04:53,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:04:53,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 22:04:53,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045580945] [2025-03-14 22:04:53,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:04:53,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:04:53,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:04:53,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:04:53,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:04:53,104 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:04:53,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1009 places, 7647 transitions, 156449 flow. Second operand has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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:04:53,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:04:53,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:04:53,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:05:35,071 INFO L124 PetriNetUnfolderBase]: 25906/72955 cut-off events. [2025-03-14 22:05:35,072 INFO L125 PetriNetUnfolderBase]: For 1199496/1202301 co-relation queries the response was YES. [2025-03-14 22:05:35,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485579 conditions, 72955 events. 25906/72955 cut-off events. For 1199496/1202301 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 907973 event pairs, 4390 based on Foata normal form. 47/67492 useless extension candidates. Maximal degree in co-relation 174911. Up to 17755 conditions per place. [2025-03-14 22:05:35,990 INFO L140 encePairwiseOnDemand]: 217/250 looper letters, 4637 selfloop transitions, 609 changer transitions 535/7662 dead transitions. [2025-03-14 22:05:35,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 7662 transitions, 167665 flow [2025-03-14 22:05:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 22:05:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 22:05:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3864 transitions. [2025-03-14 22:05:35,992 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.736 [2025-03-14 22:05:35,993 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 789 predicate places. [2025-03-14 22:05:35,993 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 7662 transitions, 167665 flow [2025-03-14 22:05:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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:05:35,993 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:05:35,993 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:05:35,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 22:05:35,994 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:05:35,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:05:35,995 INFO L85 PathProgramCache]: Analyzing trace with hash 39770791, now seen corresponding path program 7 times [2025-03-14 22:05:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:05:35,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507465382] [2025-03-14 22:05:35,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:05:35,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:05:36,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:05:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:05:36,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:05:36,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507465382] [2025-03-14 22:05:36,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507465382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:05:36,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:05:36,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:05:36,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663917362] [2025-03-14 22:05:36,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:05:36,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:05:36,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:05:36,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:05:36,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:05:36,459 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:05:36,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 7662 transitions, 167665 flow. Second operand has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:05:36,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:05:36,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:05:36,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:06:19,368 INFO L124 PetriNetUnfolderBase]: 25621/72400 cut-off events. [2025-03-14 22:06:19,369 INFO L125 PetriNetUnfolderBase]: For 1296589/1299492 co-relation queries the response was YES. [2025-03-14 22:06:19,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512894 conditions, 72400 events. 25621/72400 cut-off events. For 1296589/1299492 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 901205 event pairs, 4313 based on Foata normal form. 46/66980 useless extension candidates. Maximal degree in co-relation 175084. Up to 17572 conditions per place. [2025-03-14 22:06:20,297 INFO L140 encePairwiseOnDemand]: 217/250 looper letters, 4519 selfloop transitions, 631 changer transitions 535/7534 dead transitions. [2025-03-14 22:06:20,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1048 places, 7534 transitions, 175919 flow [2025-03-14 22:06:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 22:06:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 22:06:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4228 transitions. [2025-03-14 22:06:20,299 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.735304347826087 [2025-03-14 22:06:20,300 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 808 predicate places. [2025-03-14 22:06:20,300 INFO L471 AbstractCegarLoop]: Abstraction has has 1048 places, 7534 transitions, 175919 flow [2025-03-14 22:06:20,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:06:20,301 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:06:20,301 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:06:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 22:06:20,301 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:06:20,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:06:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash -671199813, now seen corresponding path program 2 times [2025-03-14 22:06:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:06:20,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919342839] [2025-03-14 22:06:20,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:06:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:06:20,314 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:06:20,314 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:06:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:06:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:06:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919342839] [2025-03-14 22:06:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919342839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:06:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:06:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-14 22:06:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605554036] [2025-03-14 22:06:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:06:20,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-14 22:06:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:06:20,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-14 22:06:20,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2025-03-14 22:06:20,712 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:06:20,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 7534 transitions, 175919 flow. Second operand has 21 states, 21 states have (on average 178.38095238095238) internal successors, (3746), 21 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states 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:06:20,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:06:20,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:06:20,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:07:05,635 INFO L124 PetriNetUnfolderBase]: 25504/72366 cut-off events. [2025-03-14 22:07:05,635 INFO L125 PetriNetUnfolderBase]: For 1436903/1439932 co-relation queries the response was YES. [2025-03-14 22:07:06,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543217 conditions, 72366 events. 25504/72366 cut-off events. For 1436903/1439932 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 902058 event pairs, 4263 based on Foata normal form. 46/66987 useless extension candidates. Maximal degree in co-relation 196880. Up to 17512 conditions per place. [2025-03-14 22:07:06,668 INFO L140 encePairwiseOnDemand]: 218/250 looper letters, 4532 selfloop transitions, 613 changer transitions 535/7527 dead transitions. [2025-03-14 22:07:06,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1070 places, 7527 transitions, 186353 flow [2025-03-14 22:07:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 22:07:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 22:07:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4221 transitions. [2025-03-14 22:07:06,670 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7340869565217392 [2025-03-14 22:07:06,671 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 830 predicate places. [2025-03-14 22:07:06,671 INFO L471 AbstractCegarLoop]: Abstraction has has 1070 places, 7527 transitions, 186353 flow [2025-03-14 22:07:06,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 178.38095238095238) internal successors, (3746), 21 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states 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:07:06,671 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:07:06,671 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:07:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 22:07:06,671 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:07:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:07:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 882938617, now seen corresponding path program 3 times [2025-03-14 22:07:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:07:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897175239] [2025-03-14 22:07:06,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:07:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:07:06,684 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:07:06,684 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:07:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:07:07,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:07:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897175239] [2025-03-14 22:07:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897175239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:07:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:07:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 22:07:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290925236] [2025-03-14 22:07:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:07:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:07:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:07:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:07:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:07:07,057 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:07:07,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1070 places, 7527 transitions, 186353 flow. Second operand has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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:07:07,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:07:07,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:07:07,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:07:53,401 INFO L124 PetriNetUnfolderBase]: 25819/72721 cut-off events. [2025-03-14 22:07:53,401 INFO L125 PetriNetUnfolderBase]: For 1624698/1627981 co-relation queries the response was YES. [2025-03-14 22:07:53,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580973 conditions, 72721 events. 25819/72721 cut-off events. For 1624698/1627981 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 905631 event pairs, 5248 based on Foata normal form. 46/67248 useless extension candidates. Maximal degree in co-relation 210974. Up to 17878 conditions per place. [2025-03-14 22:07:54,483 INFO L140 encePairwiseOnDemand]: 219/250 looper letters, 4721 selfloop transitions, 586 changer transitions 535/7689 dead transitions. [2025-03-14 22:07:54,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1096 places, 7689 transitions, 201255 flow [2025-03-14 22:07:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-14 22:07:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-14 22:07:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4944 transitions. [2025-03-14 22:07:54,485 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7324444444444445 [2025-03-14 22:07:54,486 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 856 predicate places. [2025-03-14 22:07:54,486 INFO L471 AbstractCegarLoop]: Abstraction has has 1096 places, 7689 transitions, 201255 flow [2025-03-14 22:07:54,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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:07:54,486 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:07:54,486 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:07:54,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 22:07:54,487 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:07:54,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:07:54,488 INFO L85 PathProgramCache]: Analyzing trace with hash 491516639, now seen corresponding path program 4 times [2025-03-14 22:07:54,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:07:54,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596554684] [2025-03-14 22:07:54,488 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:07:54,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:07:54,499 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:07:54,499 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:07:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:07:54,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:07:54,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596554684] [2025-03-14 22:07:54,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596554684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:07:54,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:07:54,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:07:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364187954] [2025-03-14 22:07:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:07:54,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:07:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:07:54,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:07:54,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:07:54,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2025-03-14 22:07:54,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1096 places, 7689 transitions, 201255 flow. Second operand has 10 states, 10 states have (on average 199.1) internal successors, (1991), 10 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states 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:07:54,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:07:54,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2025-03-14 22:07:54,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:08:45,771 INFO L124 PetriNetUnfolderBase]: 28654/81160 cut-off events. [2025-03-14 22:08:45,772 INFO L125 PetriNetUnfolderBase]: For 1962306/1965909 co-relation queries the response was YES. [2025-03-14 22:08:46,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682015 conditions, 81160 events. 28654/81160 cut-off events. For 1962306/1965909 co-relation queries the response was YES. Maximal size of possible extension queue 1494. Compared 1027286 event pairs, 4560 based on Foata normal form. 52/75218 useless extension candidates. Maximal degree in co-relation 245294. Up to 17878 conditions per place. [2025-03-14 22:08:46,960 INFO L140 encePairwiseOnDemand]: 236/250 looper letters, 5254 selfloop transitions, 616 changer transitions 535/8288 dead transitions. [2025-03-14 22:08:46,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1116 places, 8288 transitions, 232067 flow [2025-03-14 22:08:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-14 22:08:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-14 22:08:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4382 transitions. [2025-03-14 22:08:46,963 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8346666666666667 [2025-03-14 22:08:46,963 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 876 predicate places. [2025-03-14 22:08:46,963 INFO L471 AbstractCegarLoop]: Abstraction has has 1116 places, 8288 transitions, 232067 flow [2025-03-14 22:08:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 199.1) internal successors, (1991), 10 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states 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:08:46,964 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:08:46,964 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:08:46,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 22:08:46,964 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:08:46,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:08:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash -702567569, now seen corresponding path program 5 times [2025-03-14 22:08:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:08:46,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280060471] [2025-03-14 22:08:46,965 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:08:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:08:46,979 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:08:46,979 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:08:47,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:08:47,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:08:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280060471] [2025-03-14 22:08:47,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280060471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:08:47,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496750606] [2025-03-14 22:08:47,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:08:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:08:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:08:47,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:08:47,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-14 22:08:47,576 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:08:47,576 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:08:47,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-14 22:08:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:08:48,575 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 22:08:48,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 22:08:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:08:48,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:08:49,161 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-14 22:08:49,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2025-03-14 22:08:49,202 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-14 22:08:49,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-14 22:08:49,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:08:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496750606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:08:49,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:08:49,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 42, 32] total 81 [2025-03-14 22:08:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679065704] [2025-03-14 22:08:49,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:08:49,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-14 22:08:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:08:49,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-14 22:08:49,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=5963, Unknown=0, NotChecked=0, Total=6480 [2025-03-14 22:08:49,725 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 250 [2025-03-14 22:08:49,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 8288 transitions, 232067 flow. Second operand has 81 states, 81 states have (on average 86.24691358024691) internal successors, (6986), 81 states have internal predecessors, (6986), 0 states have call successors, (0), 0 states 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:08:49,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:08:49,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 250 [2025-03-14 22:08:49,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:10:26,304 INFO L124 PetriNetUnfolderBase]: 30888/87105 cut-off events. [2025-03-14 22:10:26,305 INFO L125 PetriNetUnfolderBase]: For 2251047/2259402 co-relation queries the response was YES. [2025-03-14 22:10:26,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789978 conditions, 87105 events. 30888/87105 cut-off events. For 2251047/2259402 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 1113773 event pairs, 4831 based on Foata normal form. 543/81187 useless extension candidates. Maximal degree in co-relation 293519. Up to 18347 conditions per place. [2025-03-14 22:10:27,721 INFO L140 encePairwiseOnDemand]: 169/250 looper letters, 7089 selfloop transitions, 1076 changer transitions 625/9530 dead transitions. [2025-03-14 22:10:27,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1293 places, 9530 transitions, 280421 flow [2025-03-14 22:10:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-03-14 22:10:27,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2025-03-14 22:10:27,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 16707 transitions. [2025-03-14 22:10:27,728 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.375438202247191 [2025-03-14 22:10:27,729 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 1053 predicate places. [2025-03-14 22:10:27,729 INFO L471 AbstractCegarLoop]: Abstraction has has 1293 places, 9530 transitions, 280421 flow [2025-03-14 22:10:27,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 86.24691358024691) internal successors, (6986), 81 states have internal predecessors, (6986), 0 states have call successors, (0), 0 states 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:10:27,730 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:10:27,730 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:10:27,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-14 22:10:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-14 22:10:27,931 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:10:27,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:10:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1497077097, now seen corresponding path program 8 times [2025-03-14 22:10:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:10:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173533059] [2025-03-14 22:10:27,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:10:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:10:27,955 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:10:27,955 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:10:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:10:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:10:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173533059] [2025-03-14 22:10:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173533059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:10:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:10:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-14 22:10:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618359872] [2025-03-14 22:10:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:10:28,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-14 22:10:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:10:28,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-14 22:10:28,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-14 22:10:28,308 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:10:28,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1293 places, 9530 transitions, 280421 flow. Second operand has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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:10:28,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:10:28,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:10:28,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:11:47,561 INFO L124 PetriNetUnfolderBase]: 30535/85930 cut-off events. [2025-03-14 22:11:47,561 INFO L125 PetriNetUnfolderBase]: For 2481511/2488786 co-relation queries the response was YES. [2025-03-14 22:11:48,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820610 conditions, 85930 events. 30535/85930 cut-off events. For 2481511/2488786 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 1095426 event pairs, 4613 based on Foata normal form. 63/79651 useless extension candidates. Maximal degree in co-relation 313534. Up to 17968 conditions per place. [2025-03-14 22:11:48,988 INFO L140 encePairwiseOnDemand]: 219/250 looper letters, 5901 selfloop transitions, 693 changer transitions 596/9310 dead transitions. [2025-03-14 22:11:48,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1283 places, 9310 transitions, 289676 flow [2025-03-14 22:11:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-14 22:11:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-14 22:11:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5332 transitions. [2025-03-14 22:11:48,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.735448275862069 [2025-03-14 22:11:48,991 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 1043 predicate places. [2025-03-14 22:11:48,991 INFO L471 AbstractCegarLoop]: Abstraction has has 1283 places, 9310 transitions, 289676 flow [2025-03-14 22:11:48,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 178.5) internal successors, (3570), 20 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states 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,991 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:11:48,992 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:11:48,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-14 22:11:48,992 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:48,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:11:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash 313874863, now seen corresponding path program 9 times [2025-03-14 22:11:48,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:11:48,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902139478] [2025-03-14 22:11:48,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:11:48,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:11:49,003 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:11:49,004 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:11:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:11:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:11:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902139478] [2025-03-14 22:11:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902139478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:11:49,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:11:49,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-14 22:11:49,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557253394] [2025-03-14 22:11:49,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:11:49,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 22:11:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:11:49,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 22:11:49,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-14 22:11:49,467 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 250 [2025-03-14 22:11:49,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1283 places, 9310 transitions, 289676 flow. Second operand has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:11:49,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 250 [2025-03-14 22:11:49,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:13:05,769 INFO L124 PetriNetUnfolderBase]: 30605/86035 cut-off events. [2025-03-14 22:13:05,769 INFO L125 PetriNetUnfolderBase]: For 2709588/2717086 co-relation queries the response was YES. [2025-03-14 22:13:06,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860864 conditions, 86035 events. 30605/86035 cut-off events. For 2709588/2717086 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 1095645 event pairs, 4714 based on Foata normal form. 57/79724 useless extension candidates. Maximal degree in co-relation 311158. Up to 18002 conditions per place. [2025-03-14 22:13:07,088 INFO L140 encePairwiseOnDemand]: 217/250 looper letters, 6056 selfloop transitions, 651 changer transitions 596/9423 dead transitions. [2025-03-14 22:13:07,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1305 places, 9423 transitions, 306742 flow [2025-03-14 22:13:07,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-14 22:13:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-14 22:13:07,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4237 transitions. [2025-03-14 22:13:07,090 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7368695652173913 [2025-03-14 22:13:07,091 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 1065 predicate places. [2025-03-14 22:13:07,091 INFO L471 AbstractCegarLoop]: Abstraction has has 1305 places, 9423 transitions, 306742 flow [2025-03-14 22:13:07,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 178.6315789473684) internal successors, (3394), 19 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states 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:07,091 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:13:07,091 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:13:07,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-14 22:13:07,091 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:13:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:13:07,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1450485161, now seen corresponding path program 10 times [2025-03-14 22:13:07,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:13:07,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921594047] [2025-03-14 22:13:07,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:13:07,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:13:07,105 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:13:07,105 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:13:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 22:13:07,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:13:07,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921594047] [2025-03-14 22:13:07,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921594047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:13:07,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:13:07,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-14 22:13:07,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361733933] [2025-03-14 22:13:07,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:13:07,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-14 22:13:07,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:13:07,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-14 22:13:07,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-14 22:13:07,370 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2025-03-14 22:13:07,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1305 places, 9423 transitions, 306742 flow. Second operand has 9 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:07,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:13:07,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2025-03-14 22:13:07,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:37,757 INFO L124 PetriNetUnfolderBase]: 30812/86383 cut-off events. [2025-03-14 22:14:37,758 INFO L125 PetriNetUnfolderBase]: For 2985656/2993952 co-relation queries the response was YES. [2025-03-14 22:14:38,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903414 conditions, 86383 events. 30812/86383 cut-off events. For 2985656/2993952 co-relation queries the response was YES. Maximal size of possible extension queue 1592. Compared 1100714 event pairs, 4482 based on Foata normal form. 59/80024 useless extension candidates. Maximal degree in co-relation 326442. Up to 18264 conditions per place. [2025-03-14 22:14:39,248 INFO L140 encePairwiseOnDemand]: 234/250 looper letters, 6058 selfloop transitions, 666 changer transitions 596/9476 dead transitions. [2025-03-14 22:14:39,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1316 places, 9476 transitions, 322631 flow [2025-03-14 22:14:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 22:14:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 22:14:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2512 transitions. [2025-03-14 22:14:39,250 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8373333333333334 [2025-03-14 22:14:39,250 INFO L298 CegarLoopForPetriNet]: 240 programPoint places, 1076 predicate places. [2025-03-14 22:14:39,250 INFO L471 AbstractCegarLoop]: Abstraction has has 1316 places, 9476 transitions, 322631 flow [2025-03-14 22:14:39,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 0 states have call successors, (0), 0 states 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:39,250 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:39,251 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:39,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-14 22:14:39,251 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:14:39,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:39,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1941819195, now seen corresponding path program 11 times [2025-03-14 22:14:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505929635] [2025-03-14 22:14:39,252 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:39,265 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:14:39,266 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 22:14:39,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505929635] [2025-03-14 22:14:39,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505929635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:39,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662256612] [2025-03-14 22:14:39,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:39,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:39,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:39,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 22:14:39,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-14 22:14:39,824 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:14:39,824 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:39,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-14 22:14:39,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:40,489 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-14 22:14:40,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-14 22:14:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:40,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:14:41,015 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-14 22:14:41,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-14 22:14:41,034 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-14 22:14:41,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 4 [2025-03-14 22:14:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662256612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:14:41,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:14:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 32, 32] total 71 [2025-03-14 22:14:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879625704] [2025-03-14 22:14:41,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:14:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-03-14 22:14:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:41,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-03-14 22:14:41,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=4648, Unknown=0, NotChecked=0, Total=4970 [2025-03-14 22:14:41,679 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 250 [2025-03-14 22:14:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1316 places, 9476 transitions, 322631 flow. Second operand has 71 states, 71 states have (on average 86.80281690140845) internal successors, (6163), 71 states have internal predecessors, (6163), 0 states have call successors, (0), 0 states 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:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:41,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 250 [2025-03-14 22:14:41,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 22:15:37,216 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 22:15:37,216 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:15:37,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2025-03-14 22:15:37,364 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:15:37,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-14 22:15:37,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-14 22:15:37,568 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (71states, 82/250 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 309912 conditions, 18488 events (8056/18487 cut-off events. For 614702/617476 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 198378 event pairs, 450 based on Foata normal form. 113/18650 useless extension candidates. Maximal degree in co-relation 178686. Up to 7414 conditions per place.). [2025-03-14 22:15:37,571 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:15:37,571 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:15:37,571 INFO L422 BasicCegarLoop]: Path program histogram: [11, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:37,583 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:15:37,583 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:15:37,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:15:37 BasicIcfg [2025-03-14 22:15:37,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:15:37,597 INFO L158 Benchmark]: Toolchain (without parser) took 797522.25ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 43.9MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-14 22:15:37,597 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:15:37,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.96ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 31.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:15:37,601 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.64ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 29.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:15:37,601 INFO L158 Benchmark]: Boogie Preprocessor took 28.74ms. Allocated memory is still 71.3MB. Free memory was 29.6MB in the beginning and 28.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:15:37,601 INFO L158 Benchmark]: RCFGBuilder took 375.76ms. Allocated memory is still 71.3MB. Free memory was 28.3MB in the beginning and 35.7MB in the end (delta: -7.3MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2025-03-14 22:15:37,601 INFO L158 Benchmark]: TraceAbstraction took 796900.52ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 34.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-14 22:15:37,602 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 is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 171.96ms. Allocated memory is still 71.3MB. Free memory was 43.7MB in the beginning and 31.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.64ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 29.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.74ms. Allocated memory is still 71.3MB. Free memory was 29.6MB in the beginning and 28.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 375.76ms. Allocated memory is still 71.3MB. Free memory was 28.3MB in the beginning and 35.7MB in the end (delta: -7.3MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 796900.52ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.1GB). Free memory was 34.7MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (71states, 82/250 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 309912 conditions, 18488 events (8056/18487 cut-off events. For 614702/617476 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 198378 event pairs, 450 based on Foata normal form. 113/18650 useless extension candidates. Maximal degree in co-relation 178686. Up to 7414 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (71states, 82/250 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 309912 conditions, 18488 events (8056/18487 cut-off events. For 614702/617476 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 198378 event pairs, 450 based on Foata normal form. 113/18650 useless extension candidates. Maximal degree in co-relation 178686. Up to 7414 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (71states, 82/250 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 309912 conditions, 18488 events (8056/18487 cut-off events. For 614702/617476 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 198378 event pairs, 450 based on Foata normal form. 113/18650 useless extension candidates. Maximal degree in co-relation 178686. Up to 7414 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 330 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: 796.8s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 770.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21237 SdHoareTripleChecker+Valid, 24.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21237 mSDsluCounter, 82776 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79022 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67286 IncrementalHoareTripleChecker+Invalid, 67810 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 3754 mSDtfsCounter, 67286 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5038 GetRequests, 3056 SyntacticMatches, 5 SemanticMatches, 1977 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101219 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322631occurred in iteration=30, InterpolantAutomatonStates: 1175, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 6765 NumberOfCodeBlocks, 6588 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 8345 ConstructedInterpolants, 15 QuantifiedInterpolants, 41081 SizeOfPredicates, 244 NumberOfNonLiveVariables, 3247 ConjunctsInSsa, 377 ConjunctsInUnsatCore, 51 InterpolantComputations, 25 PerfectInterpolantSequences, 71/117 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