/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-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 22:14:36,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 22:14:36,579 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:14:36,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 22:14:36,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 22:14:36,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 22:14:36,614 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 22:14:36,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 22:14:36,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 22:14:36,616 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:36,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 22:14:36,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 22:14:36,616 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:14:36,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 22:14:36,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 22:14:36,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 22:14:36,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 22:14:36,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 22:14:36,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-03-14 22:14:38,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8781825b1/c537fb7438474c269a10a233d3106510/FLAG12a282b25 [2025-03-14 22:14:38,232 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 22:14:38,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-03-14 22:14:38,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8781825b1/c537fb7438474c269a10a233d3106510/FLAG12a282b25 [2025-03-14 22:14:38,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8781825b1/c537fb7438474c269a10a233d3106510 [2025-03-14 22:14:38,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 22:14:38,264 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 22:14:38,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:38,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 22:14:38,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 22:14:38,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@611dd4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38, skipping insertion in model container [2025-03-14 22:14:38,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 22:14:38,411 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-name-comparator-symm.wvr.c[3882,3895] [2025-03-14 22:14:38,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:38,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 22:14:38,439 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-name-comparator-symm.wvr.c[3882,3895] [2025-03-14 22:14:38,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 22:14:38,455 INFO L204 MainTranslator]: Completed translation [2025-03-14 22:14:38,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38 WrapperNode [2025-03-14 22:14:38,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 22:14:38,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:38,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 22:14:38,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 22:14:38,460 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:14:38" (1/1) ... [2025-03-14 22:14:38,471 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:14:38" (1/1) ... [2025-03-14 22:14:38,494 INFO L138 Inliner]: procedures = 24, calls = 24, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 214 [2025-03-14 22:14:38,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 22:14:38,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 22:14:38,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 22:14:38,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 22:14:38,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 22:14:38,530 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 22:14:38,530 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 22:14:38,530 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 22:14:38,531 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (1/1) ... [2025-03-14 22:14:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 22:14:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:38,558 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:14:38,560 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:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 22:14:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 22:14:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 22:14:38,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 22:14:38,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 22:14:38,579 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:14:38,665 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 22:14:38,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 22:14:38,927 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 22:14:38,927 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 22:14:38,936 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 22:14:38,937 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-14 22:14:38,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:38 BoogieIcfgContainer [2025-03-14 22:14:38,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 22:14:38,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 22:14:38,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 22:14:38,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 22:14:38,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 10:14:38" (1/3) ... [2025-03-14 22:14:38,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c4f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:38, skipping insertion in model container [2025-03-14 22:14:38,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 10:14:38" (2/3) ... [2025-03-14 22:14:38,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c4f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 10:14:38, skipping insertion in model container [2025-03-14 22:14:38,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 10:14:38" (3/3) ... [2025-03-14 22:14:38,947 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-14 22:14:38,956 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 22:14:38,958 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 261 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-14 22:14:38,958 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 22:14:39,028 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 22:14:39,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 22:14:39,075 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;@1bf8121a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 22:14:39,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-14 22:14:39,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 22:14:39,169 INFO L124 PetriNetUnfolderBase]: 18/270 cut-off events. [2025-03-14 22:14:39,172 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 22:14:39,172 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:39,173 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] [2025-03-14 22:14:39,173 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:14:39,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -381390950, now seen corresponding path program 1 times [2025-03-14 22:14:39,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:39,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569885318] [2025-03-14 22:14:39,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:39,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:39,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569885318] [2025-03-14 22:14:39,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569885318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:39,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 22:14:39,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984531826] [2025-03-14 22:14:39,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-14 22:14:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:39,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-14 22:14:39,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-14 22:14:39,467 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 278 [2025-03-14 22:14:39,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 278 transitions, 570 flow. Second operand has 2 states, 2 states have (on average 263.0) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:39,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 278 [2025-03-14 22:14:39,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:39,550 INFO L124 PetriNetUnfolderBase]: 5/258 cut-off events. [2025-03-14 22:14:39,550 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-14 22:14:39,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 258 events. 5/258 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 450 event pairs, 0 based on Foata normal form. 18/260 useless extension candidates. Maximal degree in co-relation 180. Up to 5 conditions per place. [2025-03-14 22:14:39,558 INFO L140 encePairwiseOnDemand]: 264/278 looper letters, 4 selfloop transitions, 0 changer transitions 3/258 dead transitions. [2025-03-14 22:14:39,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 536 flow [2025-03-14 22:14:39,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-14 22:14:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-14 22:14:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 538 transitions. [2025-03-14 22:14:39,571 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9676258992805755 [2025-03-14 22:14:39,574 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, -6 predicate places. [2025-03-14 22:14:39,574 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 258 transitions, 536 flow [2025-03-14 22:14:39,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 263.0) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:39,575 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] [2025-03-14 22:14:39,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 22:14:39,575 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:14:39,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash 905897899, now seen corresponding path program 1 times [2025-03-14 22:14:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734129561] [2025-03-14 22:14:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 22:14:39,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:39,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734129561] [2025-03-14 22:14:39,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734129561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:39,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:39,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 22:14:39,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943953196] [2025-03-14 22:14:39,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:39,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 22:14:39,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:39,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 22:14:39,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 22:14:39,855 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 278 [2025-03-14 22:14:39,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 258 transitions, 536 flow. Second operand has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:39,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 278 [2025-03-14 22:14:39,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:39,959 INFO L124 PetriNetUnfolderBase]: 5/265 cut-off events. [2025-03-14 22:14:39,959 INFO L125 PetriNetUnfolderBase]: For 14/17 co-relation queries the response was YES. [2025-03-14 22:14:39,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 265 events. 5/265 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 447 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 207. Up to 11 conditions per place. [2025-03-14 22:14:39,962 INFO L140 encePairwiseOnDemand]: 271/278 looper letters, 17 selfloop transitions, 6 changer transitions 3/262 dead transitions. [2025-03-14 22:14:39,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 262 transitions, 590 flow [2025-03-14 22:14:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 22:14:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 22:14:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1249 transitions. [2025-03-14 22:14:39,967 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8985611510791367 [2025-03-14 22:14:39,967 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, -2 predicate places. [2025-03-14 22:14:39,967 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 262 transitions, 590 flow [2025-03-14 22:14:39,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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,970 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:39,970 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] [2025-03-14 22:14:39,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 22:14:39,970 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:14:39,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash -208220074, now seen corresponding path program 1 times [2025-03-14 22:14:39,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:39,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473225251] [2025-03-14 22:14:39,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:39,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:40,191 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:14:40,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473225251] [2025-03-14 22:14:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473225251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:40,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026211951] [2025-03-14 22:14:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:14:40,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:40,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:40,196 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:14:40,198 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:14:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:40,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 22:14:40,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:40,428 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:14:40,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 22:14:40,519 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:14:40,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026211951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 22:14:40,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 22:14:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-14 22:14:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803012959] [2025-03-14 22:14:40,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 22:14:40,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-14 22:14:40,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:40,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-14 22:14:40,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-14 22:14:40,526 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 278 [2025-03-14 22:14:40,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 262 transitions, 590 flow. Second operand has 14 states, 14 states have (on average 246.85714285714286) internal successors, (3456), 14 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states 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:40,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:40,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 278 [2025-03-14 22:14:40,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:40,713 INFO L124 PetriNetUnfolderBase]: 5/275 cut-off events. [2025-03-14 22:14:40,713 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2025-03-14 22:14:40,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 275 events. 5/275 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 250. Up to 16 conditions per place. [2025-03-14 22:14:40,716 INFO L140 encePairwiseOnDemand]: 268/278 looper letters, 18 selfloop transitions, 13 changer transitions 3/269 dead transitions. [2025-03-14 22:14:40,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 269 transitions, 676 flow [2025-03-14 22:14:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 22:14:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 22:14:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2717 transitions. [2025-03-14 22:14:40,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8884892086330936 [2025-03-14 22:14:40,728 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 8 predicate places. [2025-03-14 22:14:40,728 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 269 transitions, 676 flow [2025-03-14 22:14:40,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 246.85714285714286) internal successors, (3456), 14 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states 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:40,729 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:40,730 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,741 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:14:40,930 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:14:40,931 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:14:40,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:40,931 INFO L85 PathProgramCache]: Analyzing trace with hash 263638846, now seen corresponding path program 2 times [2025-03-14 22:14:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860071477] [2025-03-14 22:14:40,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:14:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:40,960 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:14:40,960 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:41,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860071477] [2025-03-14 22:14:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860071477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326644504] [2025-03-14 22:14:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:41,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:41,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:41,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:41,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:41,364 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:41,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 269 transitions, 676 flow. Second operand has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:41,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:41,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:42,115 INFO L124 PetriNetUnfolderBase]: 430/2585 cut-off events. [2025-03-14 22:14:42,115 INFO L125 PetriNetUnfolderBase]: For 920/920 co-relation queries the response was YES. [2025-03-14 22:14:42,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3836 conditions, 2585 events. 430/2585 cut-off events. For 920/920 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 21248 event pairs, 153 based on Foata normal form. 0/2321 useless extension candidates. Maximal degree in co-relation 3177. Up to 312 conditions per place. [2025-03-14 22:14:42,126 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 142 selfloop transitions, 20 changer transitions 20/389 dead transitions. [2025-03-14 22:14:42,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 389 transitions, 1388 flow [2025-03-14 22:14:42,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:14:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:14:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3415 transitions. [2025-03-14 22:14:42,132 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7677607913669064 [2025-03-14 22:14:42,133 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 23 predicate places. [2025-03-14 22:14:42,133 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 389 transitions, 1388 flow [2025-03-14 22:14:42,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:42,134 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:42,134 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 22:14:42,134 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:14:42,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash -237255114, now seen corresponding path program 3 times [2025-03-14 22:14:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619961844] [2025-03-14 22:14:42,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:14:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:42,157 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:14:42,158 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:42,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:42,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619961844] [2025-03-14 22:14:42,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619961844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:42,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:42,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:14:42,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641174893] [2025-03-14 22:14:42,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:42,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:42,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:42,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:42,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:14:42,587 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 389 transitions, 1388 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:42,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:43,488 INFO L124 PetriNetUnfolderBase]: 895/5112 cut-off events. [2025-03-14 22:14:43,489 INFO L125 PetriNetUnfolderBase]: For 2510/2829 co-relation queries the response was YES. [2025-03-14 22:14:43,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 5112 events. 895/5112 cut-off events. For 2510/2829 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 50521 event pairs, 183 based on Foata normal form. 34/4668 useless extension candidates. Maximal degree in co-relation 8060. Up to 855 conditions per place. [2025-03-14 22:14:43,508 INFO L140 encePairwiseOnDemand]: 252/278 looper letters, 266 selfloop transitions, 92 changer transitions 69/638 dead transitions. [2025-03-14 22:14:43,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 638 transitions, 3328 flow [2025-03-14 22:14:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:14:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:14:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3200 transitions. [2025-03-14 22:14:43,513 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7673860911270983 [2025-03-14 22:14:43,515 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 37 predicate places. [2025-03-14 22:14:43,515 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 638 transitions, 3328 flow [2025-03-14 22:14:43,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:43,516 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:43,516 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 22:14:43,516 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:14:43,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1901488674, now seen corresponding path program 4 times [2025-03-14 22:14:43,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:43,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142373281] [2025-03-14 22:14:43,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:14:43,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:43,532 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:14:43,533 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:43,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:43,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142373281] [2025-03-14 22:14:43,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142373281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924178055] [2025-03-14 22:14:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:43,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:43,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 638 transitions, 3328 flow. Second operand has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:43,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:43,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:43,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:45,120 INFO L124 PetriNetUnfolderBase]: 1382/8080 cut-off events. [2025-03-14 22:14:45,120 INFO L125 PetriNetUnfolderBase]: For 5706/7326 co-relation queries the response was YES. [2025-03-14 22:14:45,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16593 conditions, 8080 events. 1382/8080 cut-off events. For 5706/7326 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 85924 event pairs, 259 based on Foata normal form. 109/7398 useless extension candidates. Maximal degree in co-relation 14071. Up to 1448 conditions per place. [2025-03-14 22:14:45,153 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 543 selfloop transitions, 128 changer transitions 104/986 dead transitions. [2025-03-14 22:14:45,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 986 transitions, 7211 flow [2025-03-14 22:14:45,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:14:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:14:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3413 transitions. [2025-03-14 22:14:45,158 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7673111510791367 [2025-03-14 22:14:45,159 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 52 predicate places. [2025-03-14 22:14:45,159 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 986 transitions, 7211 flow [2025-03-14 22:14:45,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:45,160 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:45,160 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 22:14:45,161 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:14:45,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:45,161 INFO L85 PathProgramCache]: Analyzing trace with hash -507208340, now seen corresponding path program 5 times [2025-03-14 22:14:45,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:45,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067399254] [2025-03-14 22:14:45,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:45,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:45,184 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:45,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:45,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-14 22:14:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067399254] [2025-03-14 22:14:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067399254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574888321] [2025-03-14 22:14:45,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:45,754 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:14:45,755 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:14:45,835 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:45,835 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:45,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 22:14:45,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:46,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:14:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574888321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:14:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 18 [2025-03-14 22:14:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594294309] [2025-03-14 22:14:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:46,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:46,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:46,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-14 22:14:46,315 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:46,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 986 transitions, 7211 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:46,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:46,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:46,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:47,735 INFO L124 PetriNetUnfolderBase]: 1541/8956 cut-off events. [2025-03-14 22:14:47,736 INFO L125 PetriNetUnfolderBase]: For 11720/16247 co-relation queries the response was YES. [2025-03-14 22:14:47,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22151 conditions, 8956 events. 1541/8956 cut-off events. For 11720/16247 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 98161 event pairs, 223 based on Foata normal form. 378/8522 useless extension candidates. Maximal degree in co-relation 20280. Up to 1785 conditions per place. [2025-03-14 22:14:47,783 INFO L140 encePairwiseOnDemand]: 251/278 looper letters, 636 selfloop transitions, 222 changer transitions 193/1262 dead transitions. [2025-03-14 22:14:47,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1262 transitions, 11803 flow [2025-03-14 22:14:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 22:14:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 22:14:47,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3854 transitions. [2025-03-14 22:14:47,790 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7701838529176659 [2025-03-14 22:14:47,791 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 69 predicate places. [2025-03-14 22:14:47,791 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 1262 transitions, 11803 flow [2025-03-14 22:14:47,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:47,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:47,792 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 22:14:47,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-14 22:14:47,992 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:14:47,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1564138418, now seen corresponding path program 6 times [2025-03-14 22:14:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:47,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947106593] [2025-03-14 22:14:47,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:14:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:48,012 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:14:48,012 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:48,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947106593] [2025-03-14 22:14:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947106593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824873252] [2025-03-14 22:14:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:48,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:48,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:48,307 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:48,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 1262 transitions, 11803 flow. Second operand has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:48,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:48,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:48,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:49,696 INFO L124 PetriNetUnfolderBase]: 1771/10216 cut-off events. [2025-03-14 22:14:49,696 INFO L125 PetriNetUnfolderBase]: For 18957/24220 co-relation queries the response was YES. [2025-03-14 22:14:49,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29167 conditions, 10216 events. 1771/10216 cut-off events. For 18957/24220 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 115667 event pairs, 213 based on Foata normal form. 304/9598 useless extension candidates. Maximal degree in co-relation 26636. Up to 2057 conditions per place. [2025-03-14 22:14:49,807 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 847 selfloop transitions, 170 changer transitions 303/1554 dead transitions. [2025-03-14 22:14:49,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 1554 transitions, 17650 flow [2025-03-14 22:14:49,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 22:14:49,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 22:14:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2997 transitions. [2025-03-14 22:14:49,811 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7700411099691675 [2025-03-14 22:14:49,812 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 82 predicate places. [2025-03-14 22:14:49,812 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 1554 transitions, 17650 flow [2025-03-14 22:14:49,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:49,813 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:49,813 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 22:14:49,814 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:14:49,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:49,814 INFO L85 PathProgramCache]: Analyzing trace with hash -341573214, now seen corresponding path program 7 times [2025-03-14 22:14:49,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:49,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021666537] [2025-03-14 22:14:49,814 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:14:49,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:14:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:50,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:50,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021666537] [2025-03-14 22:14:50,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021666537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:50,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:50,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 22:14:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496285230] [2025-03-14 22:14:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:50,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:14:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:50,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:14:50,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 22:14:50,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:50,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1554 transitions, 17650 flow. Second operand has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states 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:50,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:50,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:50,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:51,834 INFO L124 PetriNetUnfolderBase]: 1791/10229 cut-off events. [2025-03-14 22:14:51,835 INFO L125 PetriNetUnfolderBase]: For 24979/32375 co-relation queries the response was YES. [2025-03-14 22:14:51,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33205 conditions, 10229 events. 1791/10229 cut-off events. For 24979/32375 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 116019 event pairs, 210 based on Foata normal form. 373/9698 useless extension candidates. Maximal degree in co-relation 30554. Up to 2081 conditions per place. [2025-03-14 22:14:51,877 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 835 selfloop transitions, 159 changer transitions 398/1626 dead transitions. [2025-03-14 22:14:51,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1626 transitions, 21420 flow [2025-03-14 22:14:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:14:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:14:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3202 transitions. [2025-03-14 22:14:51,881 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7678657074340528 [2025-03-14 22:14:51,882 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 96 predicate places. [2025-03-14 22:14:51,882 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 1626 transitions, 21420 flow [2025-03-14 22:14:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.5) internal successors, (2065), 10 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:14:51,883 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:51,883 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:14:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 22:14:51,884 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:14:51,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 2106081310, now seen corresponding path program 8 times [2025-03-14 22:14:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:51,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112862997] [2025-03-14 22:14:51,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:14:51,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:51,900 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:14:51,900 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:52,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:52,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112862997] [2025-03-14 22:14:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112862997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:14:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905871184] [2025-03-14 22:14:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:52,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:52,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:52,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:52,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:14:52,123 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:52,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 1626 transitions, 21420 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:52,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:52,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:52,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:53,916 INFO L124 PetriNetUnfolderBase]: 1962/11368 cut-off events. [2025-03-14 22:14:53,916 INFO L125 PetriNetUnfolderBase]: For 37941/50444 co-relation queries the response was YES. [2025-03-14 22:14:53,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40818 conditions, 11368 events. 1962/11368 cut-off events. For 37941/50444 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 132332 event pairs, 256 based on Foata normal form. 440/10792 useless extension candidates. Maximal degree in co-relation 37506. Up to 2281 conditions per place. [2025-03-14 22:14:53,964 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 919 selfloop transitions, 234 changer transitions 461/1848 dead transitions. [2025-03-14 22:14:53,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1848 transitions, 27953 flow [2025-03-14 22:14:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:14:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:14:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3209 transitions. [2025-03-14 22:14:53,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7695443645083933 [2025-03-14 22:14:53,967 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 110 predicate places. [2025-03-14 22:14:53,967 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 1848 transitions, 27953 flow [2025-03-14 22:14:53,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:53,968 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:53,968 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 22:14:53,968 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:14:53,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 609263336, now seen corresponding path program 9 times [2025-03-14 22:14:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181314384] [2025-03-14 22:14:53,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:14:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:53,981 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:14:53,981 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:54,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181314384] [2025-03-14 22:14:54,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181314384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:54,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:54,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:14:54,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287798166] [2025-03-14 22:14:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:54,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:14:54,338 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:54,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 1848 transitions, 27953 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:54,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:54,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:54,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:56,367 INFO L124 PetriNetUnfolderBase]: 1980/11664 cut-off events. [2025-03-14 22:14:56,368 INFO L125 PetriNetUnfolderBase]: For 48832/62233 co-relation queries the response was YES. [2025-03-14 22:14:56,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45735 conditions, 11664 events. 1980/11664 cut-off events. For 48832/62233 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 136650 event pairs, 250 based on Foata normal form. 502/11139 useless extension candidates. Maximal degree in co-relation 41447. Up to 2308 conditions per place. [2025-03-14 22:14:56,428 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 907 selfloop transitions, 223 changer transitions 557/1920 dead transitions. [2025-03-14 22:14:56,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1920 transitions, 32599 flow [2025-03-14 22:14:56,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:14:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:14:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3414 transitions. [2025-03-14 22:14:56,431 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7675359712230215 [2025-03-14 22:14:56,431 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 125 predicate places. [2025-03-14 22:14:56,431 INFO L471 AbstractCegarLoop]: Abstraction has has 392 places, 1920 transitions, 32599 flow [2025-03-14 22:14:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:56,432 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:56,432 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 22:14:56,432 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:14:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 371047910, now seen corresponding path program 10 times [2025-03-14 22:14:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697778144] [2025-03-14 22:14:56,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:14:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:56,445 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:14:56,445 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:56,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697778144] [2025-03-14 22:14:56,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697778144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:56,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:14:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:14:56,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660435045] [2025-03-14 22:14:56,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:56,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:56,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:56,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:56,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:14:56,685 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:56,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1920 transitions, 32599 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:56,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:56,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:56,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:14:58,856 INFO L124 PetriNetUnfolderBase]: 2150/12026 cut-off events. [2025-03-14 22:14:58,856 INFO L125 PetriNetUnfolderBase]: For 68102/94429 co-relation queries the response was YES. [2025-03-14 22:14:58,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53430 conditions, 12026 events. 2150/12026 cut-off events. For 68102/94429 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 142310 event pairs, 294 based on Foata normal form. 401/11330 useless extension candidates. Maximal degree in co-relation 41539. Up to 2455 conditions per place. [2025-03-14 22:14:58,919 INFO L140 encePairwiseOnDemand]: 255/278 looper letters, 1048 selfloop transitions, 152 changer transitions 688/2107 dead transitions. [2025-03-14 22:14:58,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 2107 transitions, 39823 flow [2025-03-14 22:14:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:14:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:14:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3192 transitions. [2025-03-14 22:14:58,921 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7654676258992805 [2025-03-14 22:14:58,922 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 139 predicate places. [2025-03-14 22:14:58,922 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 2107 transitions, 39823 flow [2025-03-14 22:14:58,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:58,922 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:14:58,923 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 22:14:58,923 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:14:58,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:14:58,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1566804106, now seen corresponding path program 11 times [2025-03-14 22:14:58,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:14:58,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112545217] [2025-03-14 22:14:58,924 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:14:58,940 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:58,940 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-14 22:14:59,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:14:59,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112545217] [2025-03-14 22:14:59,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112545217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:14:59,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665482611] [2025-03-14 22:14:59,433 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:14:59,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:14:59,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:14:59,434 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:14:59,435 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:14:59,501 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:14:59,501 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:14:59,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-14 22:14:59,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:14:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:14:59,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:14:59,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665482611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:14:59,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:14:59,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [14] total 17 [2025-03-14 22:14:59,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491600501] [2025-03-14 22:14:59,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:14:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:14:59,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:14:59,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:14:59,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-14 22:14:59,681 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:14:59,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 2107 transitions, 39823 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:59,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:14:59,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:14:59,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:02,111 INFO L124 PetriNetUnfolderBase]: 2534/14487 cut-off events. [2025-03-14 22:15:02,111 INFO L125 PetriNetUnfolderBase]: For 91003/114385 co-relation queries the response was YES. [2025-03-14 22:15:02,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67075 conditions, 14487 events. 2534/14487 cut-off events. For 91003/114385 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 178419 event pairs, 310 based on Foata normal form. 414/13609 useless extension candidates. Maximal degree in co-relation 62100. Up to 3286 conditions per place. [2025-03-14 22:15:02,192 INFO L140 encePairwiseOnDemand]: 255/278 looper letters, 1272 selfloop transitions, 142 changer transitions 756/2411 dead transitions. [2025-03-14 22:15:02,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 2411 transitions, 50376 flow [2025-03-14 22:15:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 22:15:02,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 22:15:02,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2974 transitions. [2025-03-14 22:15:02,194 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7641315519013361 [2025-03-14 22:15:02,194 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 152 predicate places. [2025-03-14 22:15:02,194 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 2411 transitions, 50376 flow [2025-03-14 22:15:02,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:02,195 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:02,195 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:02,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 22:15:02,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:15:02,396 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:15:02,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1645606100, now seen corresponding path program 12 times [2025-03-14 22:15:02,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:02,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052251791] [2025-03-14 22:15:02,397 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:15:02,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:02,410 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:15:02,410 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:02,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:02,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052251791] [2025-03-14 22:15:02,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052251791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:02,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:02,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:15:02,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274583113] [2025-03-14 22:15:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:15:02,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:02,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:15:02,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:15:02,648 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:15:02,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 2411 transitions, 50376 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:02,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:02,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:15:02,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:05,895 INFO L124 PetriNetUnfolderBase]: 2573/14901 cut-off events. [2025-03-14 22:15:05,896 INFO L125 PetriNetUnfolderBase]: For 110301/135840 co-relation queries the response was YES. [2025-03-14 22:15:05,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74447 conditions, 14901 events. 2573/14901 cut-off events. For 110301/135840 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 184828 event pairs, 302 based on Foata normal form. 622/14216 useless extension candidates. Maximal degree in co-relation 62699. Up to 3369 conditions per place. [2025-03-14 22:15:05,971 INFO L140 encePairwiseOnDemand]: 256/278 looper letters, 1140 selfloop transitions, 337 changer transitions 938/2638 dead transitions. [2025-03-14 22:15:05,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 2638 transitions, 60668 flow [2025-03-14 22:15:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:15:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:15:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3412 transitions. [2025-03-14 22:15:05,973 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7670863309352518 [2025-03-14 22:15:05,973 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 167 predicate places. [2025-03-14 22:15:05,973 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 2638 transitions, 60668 flow [2025-03-14 22:15:05,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:05,974 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:05,974 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:05,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 22:15:05,975 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:15:05,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1608885084, now seen corresponding path program 13 times [2025-03-14 22:15:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:05,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280531496] [2025-03-14 22:15:05,975 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:15:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:15:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280531496] [2025-03-14 22:15:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280531496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:15:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353101972] [2025-03-14 22:15:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:15:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:15:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:15:06,187 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:15:06,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 2638 transitions, 60668 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:06,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:06,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:15:06,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:09,464 INFO L124 PetriNetUnfolderBase]: 2841/16321 cut-off events. [2025-03-14 22:15:09,464 INFO L125 PetriNetUnfolderBase]: For 137909/173513 co-relation queries the response was YES. [2025-03-14 22:15:09,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87501 conditions, 16321 events. 2841/16321 cut-off events. For 137909/173513 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 206770 event pairs, 314 based on Foata normal form. 698/15613 useless extension candidates. Maximal degree in co-relation 70065. Up to 3460 conditions per place. [2025-03-14 22:15:09,564 INFO L140 encePairwiseOnDemand]: 252/278 looper letters, 1332 selfloop transitions, 388 changer transitions 1025/2986 dead transitions. [2025-03-14 22:15:09,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 2986 transitions, 74576 flow [2025-03-14 22:15:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 22:15:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 22:15:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2996 transitions. [2025-03-14 22:15:09,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7697841726618705 [2025-03-14 22:15:09,566 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 180 predicate places. [2025-03-14 22:15:09,566 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 2986 transitions, 74576 flow [2025-03-14 22:15:09,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:09,567 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:09,568 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 22:15:09,568 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:15:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 304196734, now seen corresponding path program 14 times [2025-03-14 22:15:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742068168] [2025-03-14 22:15:09,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:15:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:09,577 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:15:09,578 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:09,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:09,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742068168] [2025-03-14 22:15:09,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742068168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:09,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:09,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 22:15:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427100246] [2025-03-14 22:15:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:09,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 22:15:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:09,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 22:15:09,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 22:15:09,730 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 278 [2025-03-14 22:15:09,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 2986 transitions, 74576 flow. Second operand has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:09,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:09,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 278 [2025-03-14 22:15:09,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:13,320 INFO L124 PetriNetUnfolderBase]: 2854/16347 cut-off events. [2025-03-14 22:15:13,320 INFO L125 PetriNetUnfolderBase]: For 161286/197036 co-relation queries the response was YES. [2025-03-14 22:15:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93979 conditions, 16347 events. 2854/16347 cut-off events. For 161286/197036 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 206806 event pairs, 309 based on Foata normal form. 733/15680 useless extension candidates. Maximal degree in co-relation 75153. Up to 3519 conditions per place. [2025-03-14 22:15:13,406 INFO L140 encePairwiseOnDemand]: 252/278 looper letters, 1315 selfloop transitions, 382 changer transitions 1105/3043 dead transitions. [2025-03-14 22:15:13,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 3043 transitions, 81728 flow [2025-03-14 22:15:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:15:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:15:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3201 transitions. [2025-03-14 22:15:13,408 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7676258992805756 [2025-03-14 22:15:13,409 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 194 predicate places. [2025-03-14 22:15:13,409 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 3043 transitions, 81728 flow [2025-03-14 22:15:13,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 206.0909090909091) internal successors, (2267), 11 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:13,409 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:13,409 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:13,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 22:15:13,409 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:15:13,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 270069978, now seen corresponding path program 1 times [2025-03-14 22:15:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647773265] [2025-03-14 22:15:13,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 22:15:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:15:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647773265] [2025-03-14 22:15:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647773265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:15:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542787738] [2025-03-14 22:15:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:15:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:13,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:15:13,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:15:13,555 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:15:13,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 3043 transitions, 81728 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:13,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:13,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:15:13,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:21,236 INFO L124 PetriNetUnfolderBase]: 6897/32939 cut-off events. [2025-03-14 22:15:21,236 INFO L125 PetriNetUnfolderBase]: For 359137/390071 co-relation queries the response was YES. [2025-03-14 22:15:21,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168916 conditions, 32939 events. 6897/32939 cut-off events. For 359137/390071 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 453059 event pairs, 1043 based on Foata normal form. 210/30058 useless extension candidates. Maximal degree in co-relation 149286. Up to 4995 conditions per place. [2025-03-14 22:15:21,479 INFO L140 encePairwiseOnDemand]: 265/278 looper letters, 1091 selfloop transitions, 192 changer transitions 1145/3481 dead transitions. [2025-03-14 22:15:21,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 3481 transitions, 93351 flow [2025-03-14 22:15:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 22:15:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 22:15:21,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2763 transitions. [2025-03-14 22:15:21,480 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7645268400664084 [2025-03-14 22:15:21,481 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 206 predicate places. [2025-03-14 22:15:21,481 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 3481 transitions, 93351 flow [2025-03-14 22:15:21,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:21,481 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:21,481 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 22:15:21,481 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:15:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash -675340966, now seen corresponding path program 2 times [2025-03-14 22:15:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407270145] [2025-03-14 22:15:21,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:15:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:21,501 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 22:15:21,501 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:21,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:21,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407270145] [2025-03-14 22:15:21,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407270145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:21,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:21,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:15:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625248866] [2025-03-14 22:15:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:21,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:15:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:21,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:15:21,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:15:21,613 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:15:21,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 3481 transitions, 93351 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:21,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:21,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:15:21,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:34,141 INFO L124 PetriNetUnfolderBase]: 9023/40058 cut-off events. [2025-03-14 22:15:34,141 INFO L125 PetriNetUnfolderBase]: For 524576/578946 co-relation queries the response was YES. [2025-03-14 22:15:34,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235834 conditions, 40058 events. 9023/40058 cut-off events. For 524576/578946 co-relation queries the response was YES. Maximal size of possible extension queue 1152. Compared 562822 event pairs, 1218 based on Foata normal form. 336/36665 useless extension candidates. Maximal degree in co-relation 208747. Up to 9034 conditions per place. [2025-03-14 22:15:34,457 INFO L140 encePairwiseOnDemand]: 260/278 looper letters, 1708 selfloop transitions, 177 changer transitions 1255/4193 dead transitions. [2025-03-14 22:15:34,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 4193 transitions, 114992 flow [2025-03-14 22:15:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:15:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:15:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2165 transitions. [2025-03-14 22:15:34,458 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7787769784172662 [2025-03-14 22:15:34,459 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 215 predicate places. [2025-03-14 22:15:34,459 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 4193 transitions, 114992 flow [2025-03-14 22:15:34,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:34,459 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:34,460 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:34,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 22:15:34,460 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:15:34,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 602555388, now seen corresponding path program 3 times [2025-03-14 22:15:34,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:34,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829488435] [2025-03-14 22:15:34,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:15:34,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:34,472 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:15:34,472 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:34,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:34,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829488435] [2025-03-14 22:15:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829488435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:34,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:15:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187242181] [2025-03-14 22:15:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:34,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:15:34,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:34,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:15:34,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:15:34,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:15:34,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 4193 transitions, 114992 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:34,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:34,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:15:34,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:15:51,659 INFO L124 PetriNetUnfolderBase]: 10416/43316 cut-off events. [2025-03-14 22:15:51,660 INFO L125 PetriNetUnfolderBase]: For 650644/711643 co-relation queries the response was YES. [2025-03-14 22:15:51,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281252 conditions, 43316 events. 10416/43316 cut-off events. For 650644/711643 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 610745 event pairs, 568 based on Foata normal form. 731/40291 useless extension candidates. Maximal degree in co-relation 250919. Up to 10491 conditions per place. [2025-03-14 22:15:52,021 INFO L140 encePairwiseOnDemand]: 259/278 looper letters, 2432 selfloop transitions, 590 changer transitions 1334/5409 dead transitions. [2025-03-14 22:15:52,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 5409 transitions, 151916 flow [2025-03-14 22:15:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 22:15:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 22:15:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2754 transitions. [2025-03-14 22:15:52,023 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7620365246264527 [2025-03-14 22:15:52,024 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 227 predicate places. [2025-03-14 22:15:52,024 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 5409 transitions, 151916 flow [2025-03-14 22:15:52,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:52,024 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:15:52,024 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:15:52,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-14 22:15:52,024 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:15:52,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:15:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1263524454, now seen corresponding path program 4 times [2025-03-14 22:15:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:15:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799362202] [2025-03-14 22:15:52,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:15:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:15:52,034 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:15:52,034 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:15:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:15:52,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:15:52,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799362202] [2025-03-14 22:15:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799362202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:15:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:15:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:15:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389152972] [2025-03-14 22:15:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:15:52,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:15:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:15:52,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:15:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:15:52,159 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:15:52,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 5409 transitions, 151916 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:15:52,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:15:52,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:15:52,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:16:16,770 INFO L124 PetriNetUnfolderBase]: 11711/51364 cut-off events. [2025-03-14 22:16:16,771 INFO L125 PetriNetUnfolderBase]: For 798673/868375 co-relation queries the response was YES. [2025-03-14 22:16:16,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345360 conditions, 51364 events. 11711/51364 cut-off events. For 798673/868375 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 749766 event pairs, 574 based on Foata normal form. 1187/48119 useless extension candidates. Maximal degree in co-relation 332643. Up to 11729 conditions per place. [2025-03-14 22:16:17,220 INFO L140 encePairwiseOnDemand]: 247/278 looper letters, 3118 selfloop transitions, 487 changer transitions 1321/5979 dead transitions. [2025-03-14 22:16:17,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 5979 transitions, 177231 flow [2025-03-14 22:16:17,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-14 22:16:17,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-14 22:16:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3349 transitions. [2025-03-14 22:16:17,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7529226618705036 [2025-03-14 22:16:17,223 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 242 predicate places. [2025-03-14 22:16:17,223 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 5979 transitions, 177231 flow [2025-03-14 22:16:17,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:16:17,223 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:16:17,224 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:16:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-14 22:16:17,224 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:16:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:16:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash -675138664, now seen corresponding path program 5 times [2025-03-14 22:16:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:16:17,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532192218] [2025-03-14 22:16:17,225 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:16:17,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:16:17,237 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:16:17,237 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:16:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-14 22:16:17,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:16:17,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532192218] [2025-03-14 22:16:17,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532192218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 22:16:17,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780271526] [2025-03-14 22:16:17,440 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 22:16:17,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:16:17,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 22:16:17,442 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:16:17,444 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:16:17,516 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-14 22:16:17,516 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:16:17,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-14 22:16:17,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 22:16:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:16:17,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 22:16:17,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780271526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:16:17,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 22:16:17,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2025-03-14 22:16:17,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611317076] [2025-03-14 22:16:17,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:16:17,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 22:16:17,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:16:17,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 22:16:17,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-03-14 22:16:17,750 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 278 [2025-03-14 22:16:17,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 5979 transitions, 177231 flow. Second operand has 10 states, 10 states have (on average 180.2) internal successors, (1802), 10 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:16:17,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:16:17,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 278 [2025-03-14 22:16:17,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:17:36,967 INFO L124 PetriNetUnfolderBase]: 44337/124053 cut-off events. [2025-03-14 22:17:36,967 INFO L125 PetriNetUnfolderBase]: For 2074001/2128614 co-relation queries the response was YES. [2025-03-14 22:17:37,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773489 conditions, 124053 events. 44337/124053 cut-off events. For 2074001/2128614 co-relation queries the response was YES. Maximal size of possible extension queue 2366. Compared 1667981 event pairs, 12581 based on Foata normal form. 1046/111550 useless extension candidates. Maximal degree in co-relation 704375. Up to 61779 conditions per place. [2025-03-14 22:17:38,424 INFO L140 encePairwiseOnDemand]: 243/278 looper letters, 3709 selfloop transitions, 318 changer transitions 1925/7016 dead transitions. [2025-03-14 22:17:38,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 7016 transitions, 208925 flow [2025-03-14 22:17:38,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-14 22:17:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-14 22:17:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5944 transitions. [2025-03-14 22:17:38,427 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.689719192388025 [2025-03-14 22:17:38,428 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 272 predicate places. [2025-03-14 22:17:38,428 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 7016 transitions, 208925 flow [2025-03-14 22:17:38,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 180.2) internal successors, (1802), 10 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:17:38,439 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:17:38,439 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:17:38,451 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:17:38,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 22:17:38,639 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:17:38,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:17:38,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1994834042, now seen corresponding path program 6 times [2025-03-14 22:17:38,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:17:38,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063797237] [2025-03-14 22:17:38,641 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 22:17:38,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:17:38,653 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 22:17:38,653 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:17:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:17:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:17:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063797237] [2025-03-14 22:17:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063797237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:17:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:17:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:17:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211273715] [2025-03-14 22:17:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:17:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:17:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:17:38,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:17:38,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:17:38,770 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:17:38,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 7016 transitions, 208925 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:17:38,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:17:38,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:17:38,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:19:05,171 INFO L124 PetriNetUnfolderBase]: 48339/134838 cut-off events. [2025-03-14 22:19:05,172 INFO L125 PetriNetUnfolderBase]: For 2503144/2569254 co-relation queries the response was YES. [2025-03-14 22:19:06,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902872 conditions, 134838 events. 48339/134838 cut-off events. For 2503144/2569254 co-relation queries the response was YES. Maximal size of possible extension queue 2552. Compared 1830532 event pairs, 13648 based on Foata normal form. 1820/121973 useless extension candidates. Maximal degree in co-relation 826305. Up to 66435 conditions per place. [2025-03-14 22:19:06,802 INFO L140 encePairwiseOnDemand]: 263/278 looper letters, 3777 selfloop transitions, 782 changer transitions 2078/7887 dead transitions. [2025-03-14 22:19:06,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 7887 transitions, 243578 flow [2025-03-14 22:19:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 22:19:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 22:19:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1936 transitions. [2025-03-14 22:19:06,804 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7737809752198241 [2025-03-14 22:19:06,808 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 280 predicate places. [2025-03-14 22:19:06,808 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 7887 transitions, 243578 flow [2025-03-14 22:19:06,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:19:06,808 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:19:06,808 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:19:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-14 22:19:06,809 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:19:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:19:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -709245976, now seen corresponding path program 7 times [2025-03-14 22:19:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:19:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595485862] [2025-03-14 22:19:06,810 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 22:19:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:19:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 22:19:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:19:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:19:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595485862] [2025-03-14 22:19:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595485862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:19:06,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:19:06,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:19:06,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396893727] [2025-03-14 22:19:06,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:19:06,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:19:06,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:19:06,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:19:06,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:19:06,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:19:06,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 7887 transitions, 243578 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:19:06,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:19:06,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:19:06,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:20:59,201 INFO L124 PetriNetUnfolderBase]: 55495/154329 cut-off events. [2025-03-14 22:20:59,201 INFO L125 PetriNetUnfolderBase]: For 3171862/3250112 co-relation queries the response was YES. [2025-03-14 22:21:00,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091188 conditions, 154329 events. 55495/154329 cut-off events. For 3171862/3250112 co-relation queries the response was YES. Maximal size of possible extension queue 2867. Compared 2122085 event pairs, 18619 based on Foata normal form. 2287/139687 useless extension candidates. Maximal degree in co-relation 1003648. Up to 76552 conditions per place. [2025-03-14 22:21:01,202 INFO L140 encePairwiseOnDemand]: 244/278 looper letters, 4422 selfloop transitions, 784 changer transitions 2173/8629 dead transitions. [2025-03-14 22:21:01,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 8629 transitions, 281585 flow [2025-03-14 22:21:01,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 22:21:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 22:21:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3177 transitions. [2025-03-14 22:21:01,204 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7618705035971223 [2025-03-14 22:21:01,204 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 294 predicate places. [2025-03-14 22:21:01,204 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 8629 transitions, 281585 flow [2025-03-14 22:21:01,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:21:01,204 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:21:01,205 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:21:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-14 22:21:01,205 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:21:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:21:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1537725480, now seen corresponding path program 8 times [2025-03-14 22:21:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:21:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850744248] [2025-03-14 22:21:01,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 22:21:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:21:01,217 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 22:21:01,217 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:21:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:21:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:21:01,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850744248] [2025-03-14 22:21:01,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850744248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:21:01,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:21:01,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:21:01,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880633237] [2025-03-14 22:21:01,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:21:01,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:21:01,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:21:01,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:21:01,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:21:01,332 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:21:01,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 8629 transitions, 281585 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:21:01,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:21:01,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:21:01,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:23:17,059 INFO L124 PetriNetUnfolderBase]: 57053/158841 cut-off events. [2025-03-14 22:23:17,059 INFO L125 PetriNetUnfolderBase]: For 3718007/3806422 co-relation queries the response was YES. [2025-03-14 22:23:18,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208567 conditions, 158841 events. 57053/158841 cut-off events. For 3718007/3806422 co-relation queries the response was YES. Maximal size of possible extension queue 2950. Compared 2190167 event pairs, 20143 based on Foata normal form. 1927/143613 useless extension candidates. Maximal degree in co-relation 1106920. Up to 79479 conditions per place. [2025-03-14 22:23:19,115 INFO L140 encePairwiseOnDemand]: 255/278 looper letters, 5067 selfloop transitions, 600 changer transitions 2189/9106 dead transitions. [2025-03-14 22:23:19,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 9106 transitions, 309939 flow [2025-03-14 22:23:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 22:23:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 22:23:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2613 transitions. [2025-03-14 22:23:19,117 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.783273381294964 [2025-03-14 22:23:19,117 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 305 predicate places. [2025-03-14 22:23:19,118 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 9106 transitions, 309939 flow [2025-03-14 22:23:19,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:23:19,118 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:23:19,118 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:23:19,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-14 22:23:19,118 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:23:19,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:23:19,119 INFO L85 PathProgramCache]: Analyzing trace with hash -325341096, now seen corresponding path program 9 times [2025-03-14 22:23:19,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:23:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202588593] [2025-03-14 22:23:19,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 22:23:19,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:23:19,131 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 22:23:19,131 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:23:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:23:19,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:23:19,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202588593] [2025-03-14 22:23:19,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202588593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:23:19,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:23:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:23:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480602514] [2025-03-14 22:23:19,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:23:19,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:23:19,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:23:19,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:23:19,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:23:19,247 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:23:19,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 9106 transitions, 309939 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 22:23:19,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:23:19,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:23:19,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 22:26:13,845 INFO L124 PetriNetUnfolderBase]: 60771/169574 cut-off events. [2025-03-14 22:26:13,845 INFO L125 PetriNetUnfolderBase]: For 4327442/4427734 co-relation queries the response was YES. [2025-03-14 22:26:15,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371902 conditions, 169574 events. 60771/169574 cut-off events. For 4327442/4427734 co-relation queries the response was YES. Maximal size of possible extension queue 3154. Compared 2364807 event pairs, 20414 based on Foata normal form. 2005/153336 useless extension candidates. Maximal degree in co-relation 1254261. Up to 84869 conditions per place. [2025-03-14 22:26:16,185 INFO L140 encePairwiseOnDemand]: 260/278 looper letters, 5237 selfloop transitions, 962 changer transitions 2318/9767 dead transitions. [2025-03-14 22:26:16,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 9767 transitions, 350827 flow [2025-03-14 22:26:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 22:26:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 22:26:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2257 transitions. [2025-03-14 22:26:16,187 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8118705035971223 [2025-03-14 22:26:16,187 INFO L298 CegarLoopForPetriNet]: 267 programPoint places, 314 predicate places. [2025-03-14 22:26:16,187 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 9767 transitions, 350827 flow [2025-03-14 22:26:16,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states 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:26:16,188 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 22:26:16,188 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 22:26:16,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-14 22:26:16,188 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:26:16,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 22:26:16,189 INFO L85 PathProgramCache]: Analyzing trace with hash 426446572, now seen corresponding path program 10 times [2025-03-14 22:26:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 22:26:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555015003] [2025-03-14 22:26:16,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 22:26:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 22:26:16,199 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 22:26:16,199 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 22:26:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-14 22:26:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 22:26:16,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555015003] [2025-03-14 22:26:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555015003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 22:26:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 22:26:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 22:26:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107118143] [2025-03-14 22:26:16,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 22:26:16,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 22:26:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 22:26:16,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 22:26:16,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-14 22:26:16,318 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 278 [2025-03-14 22:26:16,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 9767 transitions, 350827 flow. Second operand has 8 states, 8 states have (on average 201.375) internal successors, (1611), 8 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states 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:26:16,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 22:26:16,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 278 [2025-03-14 22:26:16,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-14 22:27:47,428 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:27:47,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 22:27:47,876 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-14 22:27:47,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-14 22:27:47,877 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 196/278 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 672839 conditions, 76234 events (29034/76233 cut-off events. For 2206406/2256969 co-relation queries the response was YES. Maximal size of possible extension queue 3078. Compared 1062301 event pairs, 7693 based on Foata normal form. 1016/70631 useless extension candidates. Maximal degree in co-relation 668045. Up to 35884 conditions per place.). [2025-03-14 22:27:47,879 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-14 22:27:47,879 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-14 22:27:47,879 INFO L422 BasicCegarLoop]: Path program histogram: [14, 10, 1, 1] [2025-03-14 22:27:47,883 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 22:27:47,883 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 22:27:47,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 10:27:47 BasicIcfg [2025-03-14 22:27:47,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 22:27:47,891 INFO L158 Benchmark]: Toolchain (without parser) took 789628.66ms. Allocated memory was 71.3MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 44.4MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. [2025-03-14 22:27:47,891 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:27:47,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-14 22:27:47,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 71.3MB. Free memory was 31.6MB in the beginning and 29.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-14 22:27:47,896 INFO L158 Benchmark]: Boogie Preprocessor took 35.08ms. Allocated memory is still 71.3MB. Free memory was 29.5MB in the beginning and 28.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 22:27:47,896 INFO L158 Benchmark]: RCFGBuilder took 407.06ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 33.9MB in the end (delta: -5.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2025-03-14 22:27:47,896 INFO L158 Benchmark]: TraceAbstraction took 788951.70ms. Allocated memory was 71.3MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 33.0MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. [2025-03-14 22:27:47,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.30ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.6MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 71.3MB. Free memory was 31.6MB in the beginning and 29.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.08ms. Allocated memory is still 71.3MB. Free memory was 29.5MB in the beginning and 28.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 407.06ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 33.9MB in the end (delta: -5.8MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * TraceAbstraction took 788951.70ms. Allocated memory was 71.3MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 33.0MB in the beginning and 2.9GB in the end (delta: -2.9GB). Peak memory consumption was 6.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 196/278 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 672839 conditions, 76234 events (29034/76233 cut-off events. For 2206406/2256969 co-relation queries the response was YES. Maximal size of possible extension queue 3078. Compared 1062301 event pairs, 7693 based on Foata normal form. 1016/70631 useless extension candidates. Maximal degree in co-relation 668045. Up to 35884 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 196/278 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 672839 conditions, 76234 events (29034/76233 cut-off events. For 2206406/2256969 co-relation queries the response was YES. Maximal size of possible extension queue 3078. Compared 1062301 event pairs, 7693 based on Foata normal form. 1016/70631 useless extension candidates. Maximal degree in co-relation 668045. Up to 35884 conditions per place.). - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (8states, 196/278 universal loopers) in iteration 26,while PetriNetUnfolder was constructing finite prefix that currently has 672839 conditions, 76234 events (29034/76233 cut-off events. For 2206406/2256969 co-relation queries the response was YES. Maximal size of possible extension queue 3078. Compared 1062301 event pairs, 7693 based on Foata normal form. 1016/70631 useless extension candidates. Maximal degree in co-relation 668045. Up to 35884 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 397 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: 788.8s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 779.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3668 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3668 mSDsluCounter, 9653 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7403 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11884 IncrementalHoareTripleChecker+Invalid, 12278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 2250 mSDtfsCounter, 11884 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1406 GetRequests, 970 SyntacticMatches, 1 SemanticMatches, 435 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350827occurred in iteration=25, InterpolantAutomatonStates: 346, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 5504 NumberOfCodeBlocks, 5162 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 5636 ConstructedInterpolants, 0 QuantifiedInterpolants, 15255 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 669/711 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