/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:51:15,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:51:15,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:51:15,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:51:15,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:51:15,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:51:15,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:51:15,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:51:15,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:51:15,406 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:51:15,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:51:15,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:51:15,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:51:15,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:51:15,408 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:51:15,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:51:15,409 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:51:15,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:15,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:15,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:51:15,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:51:15,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:51:15,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:51:15,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:51:15,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:51:15,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:51:15,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:51:15,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:51:15,643 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:51:15,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-14 00:51:16,945 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adf8f42/9482fadb94cd4e19ac1f181c7a02b568/FLAG66da7bd69 [2025-04-14 00:51:17,130 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:51:17,130 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c [2025-04-14 00:51:17,136 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adf8f42/9482fadb94cd4e19ac1f181c7a02b568/FLAG66da7bd69 [2025-04-14 00:51:17,995 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39adf8f42/9482fadb94cd4e19ac1f181c7a02b568 [2025-04-14 00:51:17,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:51:17,998 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:51:17,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:17,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:51:18,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:51:18,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:17" (1/1) ... [2025-04-14 00:51:18,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59140eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18, skipping insertion in model container [2025-04-14 00:51:18,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:51:17" (1/1) ... [2025-04-14 00:51:18,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:51:18,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[3633,3646] [2025-04-14 00:51:18,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:18,218 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:51:18,263 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-3.wvr.c[3633,3646] [2025-04-14 00:51:18,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:51:18,278 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:51:18,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18 WrapperNode [2025-04-14 00:51:18,278 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:51:18,279 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:18,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:51:18,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:51:18,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,318 INFO L138 Inliner]: procedures = 19, calls = 23, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 238 [2025-04-14 00:51:18,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:51:18,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:51:18,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:51:18,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:51:18,325 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,343 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-14 00:51:18,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:51:18,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:51:18,361 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:51:18,361 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:51:18,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (1/1) ... [2025-04-14 00:51:18,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:51:18,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:51:18,386 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:51:18,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:51:18,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:51:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:51:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:51:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:51:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:51:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:51:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:51:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:51:18,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:51:18,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:51:18,404 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:51:18,479 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:51:18,480 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:51:18,716 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:51:18,717 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:51:18,717 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:51:18,921 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:51:18,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:18 BoogieIcfgContainer [2025-04-14 00:51:18,922 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:51:18,923 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:51:18,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:51:18,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:51:18,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:51:17" (1/3) ... [2025-04-14 00:51:18,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21784e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:18, skipping insertion in model container [2025-04-14 00:51:18,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:51:18" (2/3) ... [2025-04-14 00:51:18,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21784e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:51:18, skipping insertion in model container [2025-04-14 00:51:18,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:51:18" (3/3) ... [2025-04-14 00:51:18,930 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2025-04-14 00:51:18,940 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:51:18,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bakery-3.wvr.c that has 4 procedures, 78 locations, 80 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:51:18,941 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:51:19,008 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:51:19,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 187 flow [2025-04-14 00:51:19,079 INFO L116 PetriNetUnfolderBase]: 6/80 cut-off events. [2025-04-14 00:51:19,081 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:51:19,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 80 events. 6/80 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2025-04-14 00:51:19,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 187 flow [2025-04-14 00:51:19,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 79 transitions, 176 flow [2025-04-14 00:51:19,096 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:51:19,103 INFO L340 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=LoopHeads, 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;@2034f66f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:51:19,103 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:51:19,124 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:51:19,124 INFO L116 PetriNetUnfolderBase]: 6/78 cut-off events. [2025-04-14 00:51:19,124 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:51:19,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:19,125 INFO L206 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] [2025-04-14 00:51:19,125 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:19,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:19,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1690654721, now seen corresponding path program 1 times [2025-04-14 00:51:19,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:19,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051058687] [2025-04-14 00:51:19,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:51:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:19,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:19,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:19,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:19,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:19,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:19,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051058687] [2025-04-14 00:51:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051058687] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:19,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:51:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689810858] [2025-04-14 00:51:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:19,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:51:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:19,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:51:19,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:51:19,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:19,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:19,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:19,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:19,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:21,920 INFO L116 PetriNetUnfolderBase]: 19487/27661 cut-off events. [2025-04-14 00:51:21,921 INFO L117 PetriNetUnfolderBase]: For 932/932 co-relation queries the response was YES. [2025-04-14 00:51:21,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55825 conditions, 27661 events. 19487/27661 cut-off events. For 932/932 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 148959 event pairs, 6595 based on Foata normal form. 1/24840 useless extension candidates. Maximal degree in co-relation 53139. Up to 9970 conditions per place. [2025-04-14 00:51:22,096 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 247 selfloop transitions, 18 changer transitions 29/297 dead transitions. [2025-04-14 00:51:22,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 297 transitions, 1254 flow [2025-04-14 00:51:22,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:51:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:51:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 361 transitions. [2025-04-14 00:51:22,106 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3953997809419496 [2025-04-14 00:51:22,107 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 176 flow. Second operand 11 states and 361 transitions. [2025-04-14 00:51:22,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 297 transitions, 1254 flow [2025-04-14 00:51:22,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 297 transitions, 1206 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:51:22,151 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 262 flow [2025-04-14 00:51:22,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=262, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2025-04-14 00:51:22,156 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-04-14 00:51:22,156 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 262 flow [2025-04-14 00:51:22,156 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:22,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:22,156 INFO L206 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] [2025-04-14 00:51:22,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:51:22,157 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:22,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash 540367859, now seen corresponding path program 2 times [2025-04-14 00:51:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:22,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984538425] [2025-04-14 00:51:22,157 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:51:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:22,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:22,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:22,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:51:22,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:22,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:22,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:22,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984538425] [2025-04-14 00:51:22,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984538425] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:22,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:22,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:51:22,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349008479] [2025-04-14 00:51:22,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:22,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:51:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:22,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:51:22,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:51:22,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:22,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:22,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:22,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:22,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:24,320 INFO L116 PetriNetUnfolderBase]: 31873/45678 cut-off events. [2025-04-14 00:51:24,320 INFO L117 PetriNetUnfolderBase]: For 3973/3973 co-relation queries the response was YES. [2025-04-14 00:51:24,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98687 conditions, 45678 events. 31873/45678 cut-off events. For 3973/3973 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 282113 event pairs, 6485 based on Foata normal form. 0/41742 useless extension candidates. Maximal degree in co-relation 98665. Up to 26494 conditions per place. [2025-04-14 00:51:24,586 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 200 selfloop transitions, 18 changer transitions 0/221 dead transitions. [2025-04-14 00:51:24,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 221 transitions, 1065 flow [2025-04-14 00:51:24,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:51:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:51:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2025-04-14 00:51:24,589 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5933734939759037 [2025-04-14 00:51:24,589 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 262 flow. Second operand 4 states and 197 transitions. [2025-04-14 00:51:24,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 221 transitions, 1065 flow [2025-04-14 00:51:24,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 221 transitions, 1063 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:51:24,612 INFO L231 Difference]: Finished difference. Result has 94 places, 110 transitions, 386 flow [2025-04-14 00:51:24,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=386, PETRI_PLACES=94, PETRI_TRANSITIONS=110} [2025-04-14 00:51:24,613 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2025-04-14 00:51:24,613 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 386 flow [2025-04-14 00:51:24,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:24,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:24,614 INFO L206 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] [2025-04-14 00:51:24,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:51:24,614 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:24,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:24,615 INFO L85 PathProgramCache]: Analyzing trace with hash 301122769, now seen corresponding path program 3 times [2025-04-14 00:51:24,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:24,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296039838] [2025-04-14 00:51:24,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:51:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:24,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:24,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:24,635 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:51:24,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:24,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:24,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296039838] [2025-04-14 00:51:24,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296039838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:24,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:24,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:51:24,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666560939] [2025-04-14 00:51:24,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:24,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:51:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:24,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:51:24,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:51:24,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:24,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:24,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:24,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:24,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:26,712 INFO L116 PetriNetUnfolderBase]: 29402/42322 cut-off events. [2025-04-14 00:51:26,712 INFO L117 PetriNetUnfolderBase]: For 13296/13296 co-relation queries the response was YES. [2025-04-14 00:51:26,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104542 conditions, 42322 events. 29402/42322 cut-off events. For 13296/13296 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 258961 event pairs, 14269 based on Foata normal form. 645/40103 useless extension candidates. Maximal degree in co-relation 63313. Up to 25736 conditions per place. [2025-04-14 00:51:26,988 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 147 selfloop transitions, 2 changer transitions 1/153 dead transitions. [2025-04-14 00:51:26,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 153 transitions, 831 flow [2025-04-14 00:51:26,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:51:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:51:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-04-14 00:51:26,989 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5140562248995983 [2025-04-14 00:51:26,989 INFO L175 Difference]: Start difference. First operand has 94 places, 110 transitions, 386 flow. Second operand 3 states and 128 transitions. [2025-04-14 00:51:26,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 153 transitions, 831 flow [2025-04-14 00:51:27,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 153 transitions, 831 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:51:27,010 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 396 flow [2025-04-14 00:51:27,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-04-14 00:51:27,010 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 14 predicate places. [2025-04-14 00:51:27,011 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 396 flow [2025-04-14 00:51:27,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:27,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:27,011 INFO L206 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] [2025-04-14 00:51:27,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:51:27,011 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:27,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1986748277, now seen corresponding path program 4 times [2025-04-14 00:51:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:27,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981112303] [2025-04-14 00:51:27,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:51:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:27,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-14 00:51:27,022 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 55 of 67 statements. [2025-04-14 00:51:27,022 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:51:27,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:27,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:27,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:27,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981112303] [2025-04-14 00:51:27,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981112303] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:27,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:27,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:51:27,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912811193] [2025-04-14 00:51:27,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:27,059 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:51:27,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:27,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:51:27,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:51:27,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:27,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:29,943 INFO L116 PetriNetUnfolderBase]: 43800/63672 cut-off events. [2025-04-14 00:51:29,943 INFO L117 PetriNetUnfolderBase]: For 29572/29572 co-relation queries the response was YES. [2025-04-14 00:51:30,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163077 conditions, 63672 events. 43800/63672 cut-off events. For 29572/29572 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 422904 event pairs, 10868 based on Foata normal form. 0/60325 useless extension candidates. Maximal degree in co-relation 92902. Up to 36234 conditions per place. [2025-04-14 00:51:30,219 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 235 selfloop transitions, 25 changer transitions 0/263 dead transitions. [2025-04-14 00:51:30,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 263 transitions, 1502 flow [2025-04-14 00:51:30,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:51:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:51:30,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-04-14 00:51:30,220 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6024096385542169 [2025-04-14 00:51:30,220 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 396 flow. Second operand 4 states and 200 transitions. [2025-04-14 00:51:30,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 263 transitions, 1502 flow [2025-04-14 00:51:30,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 263 transitions, 1490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:51:30,251 INFO L231 Difference]: Finished difference. Result has 101 places, 132 transitions, 596 flow [2025-04-14 00:51:30,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=596, PETRI_PLACES=101, PETRI_TRANSITIONS=132} [2025-04-14 00:51:30,252 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 18 predicate places. [2025-04-14 00:51:30,252 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 132 transitions, 596 flow [2025-04-14 00:51:30,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:30,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:30,252 INFO L206 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] [2025-04-14 00:51:30,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:51:30,252 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:30,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:30,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1589139227, now seen corresponding path program 5 times [2025-04-14 00:51:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:30,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609534095] [2025-04-14 00:51:30,253 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:51:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:30,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:30,270 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:30,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:51:30,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:30,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:30,319 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609534095] [2025-04-14 00:51:30,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609534095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:30,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:30,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:51:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310701003] [2025-04-14 00:51:30,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:30,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:51:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:30,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:51:30,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:51:30,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:30,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 132 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:30,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:30,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:30,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:33,345 INFO L116 PetriNetUnfolderBase]: 40543/59336 cut-off events. [2025-04-14 00:51:33,345 INFO L117 PetriNetUnfolderBase]: For 47697/47697 co-relation queries the response was YES. [2025-04-14 00:51:33,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169208 conditions, 59336 events. 40543/59336 cut-off events. For 47697/47697 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 393765 event pairs, 20553 based on Foata normal form. 875/58186 useless extension candidates. Maximal degree in co-relation 95297. Up to 39473 conditions per place. [2025-04-14 00:51:33,853 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 182 selfloop transitions, 2 changer transitions 0/187 dead transitions. [2025-04-14 00:51:33,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 187 transitions, 1240 flow [2025-04-14 00:51:33,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:51:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:51:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-04-14 00:51:33,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5100401606425703 [2025-04-14 00:51:33,855 INFO L175 Difference]: Start difference. First operand has 101 places, 132 transitions, 596 flow. Second operand 3 states and 127 transitions. [2025-04-14 00:51:33,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 187 transitions, 1240 flow [2025-04-14 00:51:33,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 187 transitions, 1240 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:51:33,895 INFO L231 Difference]: Finished difference. Result has 104 places, 132 transitions, 606 flow [2025-04-14 00:51:33,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=606, PETRI_PLACES=104, PETRI_TRANSITIONS=132} [2025-04-14 00:51:33,896 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 21 predicate places. [2025-04-14 00:51:33,896 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 132 transitions, 606 flow [2025-04-14 00:51:33,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:33,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:33,896 INFO L206 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] [2025-04-14 00:51:33,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:51:33,897 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:33,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2098939913, now seen corresponding path program 6 times [2025-04-14 00:51:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:33,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522022686] [2025-04-14 00:51:33,898 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:51:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:33,906 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:33,913 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:33,913 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:51:33,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:33,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522022686] [2025-04-14 00:51:33,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522022686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:33,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:33,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:51:33,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306973887] [2025-04-14 00:51:33,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:33,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:51:33,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:33,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:51:33,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:51:33,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:33,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 132 transitions, 606 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:33,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:33,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:33,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:38,825 INFO L116 PetriNetUnfolderBase]: 62512/91783 cut-off events. [2025-04-14 00:51:38,826 INFO L117 PetriNetUnfolderBase]: For 86461/86461 co-relation queries the response was YES. [2025-04-14 00:51:39,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273020 conditions, 91783 events. 62512/91783 cut-off events. For 86461/86461 co-relation queries the response was YES. Maximal size of possible extension queue 1940. Compared 654540 event pairs, 20502 based on Foata normal form. 0/89675 useless extension candidates. Maximal degree in co-relation 150365. Up to 57646 conditions per place. [2025-04-14 00:51:39,249 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 278 selfloop transitions, 45 changer transitions 0/326 dead transitions. [2025-04-14 00:51:39,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 326 transitions, 2212 flow [2025-04-14 00:51:39,250 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:51:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:51:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-04-14 00:51:39,250 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5963855421686747 [2025-04-14 00:51:39,250 INFO L175 Difference]: Start difference. First operand has 104 places, 132 transitions, 606 flow. Second operand 4 states and 198 transitions. [2025-04-14 00:51:39,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 326 transitions, 2212 flow [2025-04-14 00:51:39,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 326 transitions, 2200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:51:39,347 INFO L231 Difference]: Finished difference. Result has 108 places, 174 transitions, 1050 flow [2025-04-14 00:51:39,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1050, PETRI_PLACES=108, PETRI_TRANSITIONS=174} [2025-04-14 00:51:39,348 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 25 predicate places. [2025-04-14 00:51:39,348 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 174 transitions, 1050 flow [2025-04-14 00:51:39,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:39,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:39,348 INFO L206 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] [2025-04-14 00:51:39,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:51:39,349 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:39,349 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1714170295, now seen corresponding path program 7 times [2025-04-14 00:51:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:39,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368198029] [2025-04-14 00:51:39,349 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:51:39,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:39,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:39,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:39,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:51:39,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:39,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:39,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368198029] [2025-04-14 00:51:39,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368198029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:39,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:39,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:51:39,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592404613] [2025-04-14 00:51:39,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:39,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:51:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:39,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:51:39,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:51:39,486 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:39,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 174 transitions, 1050 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:39,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:39,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:39,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:46,067 INFO L116 PetriNetUnfolderBase]: 72768/106639 cut-off events. [2025-04-14 00:51:46,067 INFO L117 PetriNetUnfolderBase]: For 169721/169721 co-relation queries the response was YES. [2025-04-14 00:51:46,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356345 conditions, 106639 events. 72768/106639 cut-off events. For 169721/169721 co-relation queries the response was YES. Maximal size of possible extension queue 2133. Compared 765295 event pairs, 21244 based on Foata normal form. 1/106634 useless extension candidates. Maximal degree in co-relation 167560. Up to 39327 conditions per place. [2025-04-14 00:51:46,774 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 540 selfloop transitions, 29 changer transitions 75/647 dead transitions. [2025-04-14 00:51:46,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 647 transitions, 5294 flow [2025-04-14 00:51:46,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:51:46,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:51:46,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 375 transitions. [2025-04-14 00:51:46,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41073384446878425 [2025-04-14 00:51:46,777 INFO L175 Difference]: Start difference. First operand has 108 places, 174 transitions, 1050 flow. Second operand 11 states and 375 transitions. [2025-04-14 00:51:46,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 647 transitions, 5294 flow [2025-04-14 00:51:46,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 647 transitions, 5294 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:51:46,854 INFO L231 Difference]: Finished difference. Result has 124 places, 195 transitions, 1265 flow [2025-04-14 00:51:46,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1265, PETRI_PLACES=124, PETRI_TRANSITIONS=195} [2025-04-14 00:51:46,854 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 41 predicate places. [2025-04-14 00:51:46,854 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 195 transitions, 1265 flow [2025-04-14 00:51:46,855 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:46,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:46,855 INFO L206 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] [2025-04-14 00:51:46,855 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:51:46,855 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:46,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1025839181, now seen corresponding path program 8 times [2025-04-14 00:51:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:46,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539329474] [2025-04-14 00:51:46,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:51:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:46,865 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:46,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:46,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:51:46,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:46,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:46,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539329474] [2025-04-14 00:51:46,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539329474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:46,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:46,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:51:46,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861430581] [2025-04-14 00:51:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:46,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:51:46,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:46,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:51:46,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:51:46,983 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:46,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 195 transitions, 1265 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:46,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:46,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:46,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:51:53,700 INFO L116 PetriNetUnfolderBase]: 70410/104571 cut-off events. [2025-04-14 00:51:53,700 INFO L117 PetriNetUnfolderBase]: For 192448/192448 co-relation queries the response was YES. [2025-04-14 00:51:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370257 conditions, 104571 events. 70410/104571 cut-off events. For 192448/192448 co-relation queries the response was YES. Maximal size of possible extension queue 2206. Compared 771323 event pairs, 24383 based on Foata normal form. 778/105349 useless extension candidates. Maximal degree in co-relation 370191. Up to 87569 conditions per place. [2025-04-14 00:51:54,347 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 309 selfloop transitions, 27 changer transitions 4/343 dead transitions. [2025-04-14 00:51:54,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 343 transitions, 2860 flow [2025-04-14 00:51:54,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:51:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:51:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 197 transitions. [2025-04-14 00:51:54,349 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4746987951807229 [2025-04-14 00:51:54,349 INFO L175 Difference]: Start difference. First operand has 124 places, 195 transitions, 1265 flow. Second operand 5 states and 197 transitions. [2025-04-14 00:51:54,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 343 transitions, 2860 flow [2025-04-14 00:51:55,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 343 transitions, 2850 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:51:55,483 INFO L231 Difference]: Finished difference. Result has 128 places, 210 transitions, 1525 flow [2025-04-14 00:51:55,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1525, PETRI_PLACES=128, PETRI_TRANSITIONS=210} [2025-04-14 00:51:55,484 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 45 predicate places. [2025-04-14 00:51:55,484 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 210 transitions, 1525 flow [2025-04-14 00:51:55,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:55,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:51:55,484 INFO L206 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] [2025-04-14 00:51:55,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:51:55,484 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:51:55,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:51:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash 909995413, now seen corresponding path program 9 times [2025-04-14 00:51:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:51:55,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696294666] [2025-04-14 00:51:55,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:51:55,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:51:55,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:51:55,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:51:55,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:51:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:51:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:51:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:51:55,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696294666] [2025-04-14 00:51:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696294666] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:51:55,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:51:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:51:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805080042] [2025-04-14 00:51:55,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:51:55,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:51:55,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:51:55,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:51:55,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:51:55,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:51:55,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 210 transitions, 1525 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:51:55,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:51:55,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:51:55,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:02,847 INFO L116 PetriNetUnfolderBase]: 71813/106231 cut-off events. [2025-04-14 00:52:02,847 INFO L117 PetriNetUnfolderBase]: For 230028/230028 co-relation queries the response was YES. [2025-04-14 00:52:03,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388603 conditions, 106231 events. 71813/106231 cut-off events. For 230028/230028 co-relation queries the response was YES. Maximal size of possible extension queue 2141. Compared 778628 event pairs, 20661 based on Foata normal form. 1/106214 useless extension candidates. Maximal degree in co-relation 364090. Up to 39184 conditions per place. [2025-04-14 00:52:03,624 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 576 selfloop transitions, 31 changer transitions 93/703 dead transitions. [2025-04-14 00:52:03,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 703 transitions, 6475 flow [2025-04-14 00:52:03,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:52:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:52:03,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 371 transitions. [2025-04-14 00:52:03,626 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4063526834611172 [2025-04-14 00:52:03,626 INFO L175 Difference]: Start difference. First operand has 128 places, 210 transitions, 1525 flow. Second operand 11 states and 371 transitions. [2025-04-14 00:52:03,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 703 transitions, 6475 flow [2025-04-14 00:52:07,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 703 transitions, 6409 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:52:07,069 INFO L231 Difference]: Finished difference. Result has 141 places, 214 transitions, 1625 flow [2025-04-14 00:52:07,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1625, PETRI_PLACES=141, PETRI_TRANSITIONS=214} [2025-04-14 00:52:07,070 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 58 predicate places. [2025-04-14 00:52:07,070 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 214 transitions, 1625 flow [2025-04-14 00:52:07,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:07,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:07,070 INFO L206 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] [2025-04-14 00:52:07,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:52:07,071 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:52:07,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1685032645, now seen corresponding path program 10 times [2025-04-14 00:52:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:07,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557549610] [2025-04-14 00:52:07,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:52:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:07,076 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-14 00:52:07,083 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:52:07,084 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:52:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:07,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557549610] [2025-04-14 00:52:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557549610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172057489] [2025-04-14 00:52:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:07,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:07,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:07,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:07,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:52:07,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 214 transitions, 1625 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:07,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:07,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:52:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:14,098 INFO L116 PetriNetUnfolderBase]: 69624/104026 cut-off events. [2025-04-14 00:52:14,098 INFO L117 PetriNetUnfolderBase]: For 253931/253931 co-relation queries the response was YES. [2025-04-14 00:52:14,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388912 conditions, 104026 events. 69624/104026 cut-off events. For 253931/253931 co-relation queries the response was YES. Maximal size of possible extension queue 2108. Compared 775649 event pairs, 22348 based on Foata normal form. 816/104836 useless extension candidates. Maximal degree in co-relation 388833. Up to 91168 conditions per place. [2025-04-14 00:52:15,048 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 314 selfloop transitions, 29 changer transitions 2/348 dead transitions. [2025-04-14 00:52:15,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 348 transitions, 3174 flow [2025-04-14 00:52:15,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-04-14 00:52:15,050 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4650602409638554 [2025-04-14 00:52:15,050 INFO L175 Difference]: Start difference. First operand has 141 places, 214 transitions, 1625 flow. Second operand 5 states and 193 transitions. [2025-04-14 00:52:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 348 transitions, 3174 flow [2025-04-14 00:52:19,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 348 transitions, 3110 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-14 00:52:19,197 INFO L231 Difference]: Finished difference. Result has 141 places, 236 transitions, 1897 flow [2025-04-14 00:52:19,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1897, PETRI_PLACES=141, PETRI_TRANSITIONS=236} [2025-04-14 00:52:19,198 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 58 predicate places. [2025-04-14 00:52:19,198 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 236 transitions, 1897 flow [2025-04-14 00:52:19,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:19,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:19,198 INFO L206 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] [2025-04-14 00:52:19,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:52:19,198 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:52:19,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash -803868483, now seen corresponding path program 11 times [2025-04-14 00:52:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:19,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045393718] [2025-04-14 00:52:19,199 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:52:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:19,204 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:52:19,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:52:19,209 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:52:19,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:19,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045393718] [2025-04-14 00:52:19,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045393718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:19,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:19,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:19,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135223839] [2025-04-14 00:52:19,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:19,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:19,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:19,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:19,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:19,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:52:19,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 236 transitions, 1897 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:19,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:19,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:52:19,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:27,382 INFO L116 PetriNetUnfolderBase]: 74542/111454 cut-off events. [2025-04-14 00:52:27,382 INFO L117 PetriNetUnfolderBase]: For 283201/283201 co-relation queries the response was YES. [2025-04-14 00:52:27,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422505 conditions, 111454 events. 74542/111454 cut-off events. For 283201/283201 co-relation queries the response was YES. Maximal size of possible extension queue 2225. Compared 837843 event pairs, 25131 based on Foata normal form. 297/111745 useless extension candidates. Maximal degree in co-relation 407078. Up to 99806 conditions per place. [2025-04-14 00:52:28,223 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 317 selfloop transitions, 28 changer transitions 7/355 dead transitions. [2025-04-14 00:52:28,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 355 transitions, 3381 flow [2025-04-14 00:52:28,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-04-14 00:52:28,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4506024096385542 [2025-04-14 00:52:28,224 INFO L175 Difference]: Start difference. First operand has 141 places, 236 transitions, 1897 flow. Second operand 5 states and 187 transitions. [2025-04-14 00:52:28,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 355 transitions, 3381 flow [2025-04-14 00:52:33,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 355 transitions, 3365 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-04-14 00:52:33,475 INFO L231 Difference]: Finished difference. Result has 147 places, 250 transitions, 2128 flow [2025-04-14 00:52:33,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2128, PETRI_PLACES=147, PETRI_TRANSITIONS=250} [2025-04-14 00:52:33,476 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 64 predicate places. [2025-04-14 00:52:33,476 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 250 transitions, 2128 flow [2025-04-14 00:52:33,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:33,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:33,476 INFO L206 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] [2025-04-14 00:52:33,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:52:33,477 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:52:33,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1834088603, now seen corresponding path program 12 times [2025-04-14 00:52:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:33,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871598762] [2025-04-14 00:52:33,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:52:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:33,482 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:52:33,487 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:52:33,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:52:33,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:33,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871598762] [2025-04-14 00:52:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871598762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:33,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:52:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817650655] [2025-04-14 00:52:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:33,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:52:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:33,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:52:33,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:52:33,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:52:33,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 250 transitions, 2128 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:33,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:33,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:52:33,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:42,801 INFO L116 PetriNetUnfolderBase]: 80974/120654 cut-off events. [2025-04-14 00:52:42,801 INFO L117 PetriNetUnfolderBase]: For 348321/348321 co-relation queries the response was YES. [2025-04-14 00:52:43,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470286 conditions, 120654 events. 80974/120654 cut-off events. For 348321/348321 co-relation queries the response was YES. Maximal size of possible extension queue 2390. Compared 910507 event pairs, 21881 based on Foata normal form. 1/120649 useless extension candidates. Maximal degree in co-relation 454528. Up to 39992 conditions per place. [2025-04-14 00:52:43,860 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 635 selfloop transitions, 41 changer transitions 88/767 dead transitions. [2025-04-14 00:52:43,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 767 transitions, 7590 flow [2025-04-14 00:52:43,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:52:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:52:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 372 transitions. [2025-04-14 00:52:43,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40744797371303393 [2025-04-14 00:52:43,862 INFO L175 Difference]: Start difference. First operand has 147 places, 250 transitions, 2128 flow. Second operand 11 states and 372 transitions. [2025-04-14 00:52:43,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 767 transitions, 7590 flow [2025-04-14 00:52:49,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 767 transitions, 7538 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:52:49,458 INFO L231 Difference]: Finished difference. Result has 161 places, 270 transitions, 2405 flow [2025-04-14 00:52:49,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2091, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2405, PETRI_PLACES=161, PETRI_TRANSITIONS=270} [2025-04-14 00:52:49,458 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 78 predicate places. [2025-04-14 00:52:49,458 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 270 transitions, 2405 flow [2025-04-14 00:52:49,459 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:49,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:52:49,459 INFO L206 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] [2025-04-14 00:52:49,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:52:49,459 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:52:49,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:52:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1785229129, now seen corresponding path program 13 times [2025-04-14 00:52:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:52:49,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313751246] [2025-04-14 00:52:49,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:52:49,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:52:49,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:52:49,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:52:49,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:52:49,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:52:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:52:49,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:52:49,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313751246] [2025-04-14 00:52:49,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313751246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:52:49,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:52:49,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:52:49,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891838100] [2025-04-14 00:52:49,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:52:49,554 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:52:49,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:52:49,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:52:49,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:52:49,555 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:52:49,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 270 transitions, 2405 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:52:49,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:52:49,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:52:49,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:52:56,901 INFO L116 PetriNetUnfolderBase]: 58598/89476 cut-off events. [2025-04-14 00:52:56,902 INFO L117 PetriNetUnfolderBase]: For 257507/257507 co-relation queries the response was YES. [2025-04-14 00:52:57,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347486 conditions, 89476 events. 58598/89476 cut-off events. For 257507/257507 co-relation queries the response was YES. Maximal size of possible extension queue 1823. Compared 681030 event pairs, 17182 based on Foata normal form. 398/89874 useless extension candidates. Maximal degree in co-relation 347376. Up to 77520 conditions per place. [2025-04-14 00:52:57,663 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 337 selfloop transitions, 30 changer transitions 6/376 dead transitions. [2025-04-14 00:52:57,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 376 transitions, 3849 flow [2025-04-14 00:52:57,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:52:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:52:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2025-04-14 00:52:57,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4602409638554217 [2025-04-14 00:52:57,665 INFO L175 Difference]: Start difference. First operand has 161 places, 270 transitions, 2405 flow. Second operand 5 states and 191 transitions. [2025-04-14 00:52:57,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 376 transitions, 3849 flow [2025-04-14 00:53:01,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 376 transitions, 3780 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:01,711 INFO L231 Difference]: Finished difference. Result has 164 places, 275 transitions, 2560 flow [2025-04-14 00:53:01,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2560, PETRI_PLACES=164, PETRI_TRANSITIONS=275} [2025-04-14 00:53:01,712 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 81 predicate places. [2025-04-14 00:53:01,712 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 275 transitions, 2560 flow [2025-04-14 00:53:01,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:01,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:01,712 INFO L206 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] [2025-04-14 00:53:01,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:53:01,712 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:01,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2140121973, now seen corresponding path program 14 times [2025-04-14 00:53:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:01,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557127962] [2025-04-14 00:53:01,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:53:01,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:01,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:53:01,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:53:01,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:53:01,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:01,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557127962] [2025-04-14 00:53:01,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557127962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:01,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:01,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932897863] [2025-04-14 00:53:01,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:01,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:53:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:01,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:53:01,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:53:01,798 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:01,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 275 transitions, 2560 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:01,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:01,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:01,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:09,272 INFO L116 PetriNetUnfolderBase]: 60565/92522 cut-off events. [2025-04-14 00:53:09,272 INFO L117 PetriNetUnfolderBase]: For 268379/268379 co-relation queries the response was YES. [2025-04-14 00:53:09,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356867 conditions, 92522 events. 60565/92522 cut-off events. For 268379/268379 co-relation queries the response was YES. Maximal size of possible extension queue 1939. Compared 709313 event pairs, 18524 based on Foata normal form. 528/93050 useless extension candidates. Maximal degree in co-relation 344237. Up to 76744 conditions per place. [2025-04-14 00:53:10,162 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 399 selfloop transitions, 33 changer transitions 5/440 dead transitions. [2025-04-14 00:53:10,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 440 transitions, 4655 flow [2025-04-14 00:53:10,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:53:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:53:10,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2025-04-14 00:53:10,164 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46265060240963857 [2025-04-14 00:53:10,164 INFO L175 Difference]: Start difference. First operand has 164 places, 275 transitions, 2560 flow. Second operand 5 states and 192 transitions. [2025-04-14 00:53:10,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 440 transitions, 4655 flow [2025-04-14 00:53:14,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 440 transitions, 4627 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:14,604 INFO L231 Difference]: Finished difference. Result has 169 places, 284 transitions, 2705 flow [2025-04-14 00:53:14,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2705, PETRI_PLACES=169, PETRI_TRANSITIONS=284} [2025-04-14 00:53:14,604 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 86 predicate places. [2025-04-14 00:53:14,604 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 284 transitions, 2705 flow [2025-04-14 00:53:14,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:14,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:14,605 INFO L206 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] [2025-04-14 00:53:14,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:53:14,605 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:14,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:14,605 INFO L85 PathProgramCache]: Analyzing trace with hash -963610979, now seen corresponding path program 15 times [2025-04-14 00:53:14,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:14,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587582914] [2025-04-14 00:53:14,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:53:14,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:14,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:53:14,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:53:14,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:53:14,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:14,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587582914] [2025-04-14 00:53:14,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587582914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:14,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:14,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:53:14,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704819953] [2025-04-14 00:53:14,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:14,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:53:14,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:14,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:53:14,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:53:14,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:14,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 284 transitions, 2705 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:14,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:14,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:14,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:21,079 INFO L116 PetriNetUnfolderBase]: 51620/79775 cut-off events. [2025-04-14 00:53:21,079 INFO L117 PetriNetUnfolderBase]: For 263278/263278 co-relation queries the response was YES. [2025-04-14 00:53:21,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312886 conditions, 79775 events. 51620/79775 cut-off events. For 263278/263278 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 610262 event pairs, 26613 based on Foata normal form. 726/80501 useless extension candidates. Maximal degree in co-relation 301182. Up to 59178 conditions per place. [2025-04-14 00:53:21,782 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 389 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2025-04-14 00:53:21,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 394 transitions, 4548 flow [2025-04-14 00:53:21,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:53:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:53:21,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-04-14 00:53:21,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5180722891566265 [2025-04-14 00:53:21,783 INFO L175 Difference]: Start difference. First operand has 169 places, 284 transitions, 2705 flow. Second operand 3 states and 129 transitions. [2025-04-14 00:53:21,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 394 transitions, 4548 flow [2025-04-14 00:53:24,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 394 transitions, 4503 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-04-14 00:53:24,481 INFO L231 Difference]: Finished difference. Result has 171 places, 277 transitions, 2602 flow [2025-04-14 00:53:24,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2592, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2602, PETRI_PLACES=171, PETRI_TRANSITIONS=277} [2025-04-14 00:53:24,481 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 88 predicate places. [2025-04-14 00:53:24,481 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 277 transitions, 2602 flow [2025-04-14 00:53:24,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:24,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:24,481 INFO L206 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] [2025-04-14 00:53:24,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:53:24,482 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:24,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:24,482 INFO L85 PathProgramCache]: Analyzing trace with hash 532898043, now seen corresponding path program 16 times [2025-04-14 00:53:24,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:24,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083147411] [2025-04-14 00:53:24,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:53:24,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:24,486 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 67 statements into 2 equivalence classes. [2025-04-14 00:53:24,492 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:53:24,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:53:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:24,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:24,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:24,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083147411] [2025-04-14 00:53:24,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083147411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:24,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:24,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:53:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583523979] [2025-04-14 00:53:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:24,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:53:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:24,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:53:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:53:24,565 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:24,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 277 transitions, 2602 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:24,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:24,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:24,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:30,636 INFO L116 PetriNetUnfolderBase]: 47141/73115 cut-off events. [2025-04-14 00:53:30,637 INFO L117 PetriNetUnfolderBase]: For 233033/233033 co-relation queries the response was YES. [2025-04-14 00:53:31,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287754 conditions, 73115 events. 47141/73115 cut-off events. For 233033/233033 co-relation queries the response was YES. Maximal size of possible extension queue 1467. Compared 552131 event pairs, 16613 based on Foata normal form. 348/73463 useless extension candidates. Maximal degree in co-relation 277968. Up to 64648 conditions per place. [2025-04-14 00:53:31,273 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 340 selfloop transitions, 26 changer transitions 8/377 dead transitions. [2025-04-14 00:53:31,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 377 transitions, 3998 flow [2025-04-14 00:53:31,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:53:31,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:53:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2025-04-14 00:53:31,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4457831325301205 [2025-04-14 00:53:31,274 INFO L175 Difference]: Start difference. First operand has 171 places, 277 transitions, 2602 flow. Second operand 5 states and 185 transitions. [2025-04-14 00:53:31,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 377 transitions, 3998 flow [2025-04-14 00:53:33,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 377 transitions, 3988 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:33,607 INFO L231 Difference]: Finished difference. Result has 175 places, 285 transitions, 2753 flow [2025-04-14 00:53:33,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2753, PETRI_PLACES=175, PETRI_TRANSITIONS=285} [2025-04-14 00:53:33,608 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 92 predicate places. [2025-04-14 00:53:33,608 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 285 transitions, 2753 flow [2025-04-14 00:53:33,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:33,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:33,608 INFO L206 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] [2025-04-14 00:53:33,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:53:33,608 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:33,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash 232001549, now seen corresponding path program 17 times [2025-04-14 00:53:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:33,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948015435] [2025-04-14 00:53:33,609 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:53:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:33,615 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:53:33,619 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:53:33,619 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:53:33,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:33,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948015435] [2025-04-14 00:53:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948015435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:53:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294241210] [2025-04-14 00:53:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:33,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:53:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:33,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:53:33,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:53:33,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:33,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 285 transitions, 2753 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:33,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:33,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:33,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:40,303 INFO L116 PetriNetUnfolderBase]: 47027/72616 cut-off events. [2025-04-14 00:53:40,303 INFO L117 PetriNetUnfolderBase]: For 256765/256765 co-relation queries the response was YES. [2025-04-14 00:53:40,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293535 conditions, 72616 events. 47027/72616 cut-off events. For 256765/256765 co-relation queries the response was YES. Maximal size of possible extension queue 1433. Compared 544373 event pairs, 13731 based on Foata normal form. 1/72611 useless extension candidates. Maximal degree in co-relation 283387. Up to 25210 conditions per place. [2025-04-14 00:53:40,942 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 599 selfloop transitions, 41 changer transitions 73/716 dead transitions. [2025-04-14 00:53:40,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 716 transitions, 7711 flow [2025-04-14 00:53:40,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:53:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:53:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 368 transitions. [2025-04-14 00:53:40,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40306681270536693 [2025-04-14 00:53:40,944 INFO L175 Difference]: Start difference. First operand has 175 places, 285 transitions, 2753 flow. Second operand 11 states and 368 transitions. [2025-04-14 00:53:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 716 transitions, 7711 flow [2025-04-14 00:53:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 716 transitions, 7604 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-14 00:53:43,887 INFO L231 Difference]: Finished difference. Result has 185 places, 283 transitions, 2784 flow [2025-04-14 00:53:43,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2784, PETRI_PLACES=185, PETRI_TRANSITIONS=283} [2025-04-14 00:53:43,887 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 102 predicate places. [2025-04-14 00:53:43,887 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 283 transitions, 2784 flow [2025-04-14 00:53:43,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:43,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:43,890 INFO L206 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] [2025-04-14 00:53:43,890 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:53:43,890 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:43,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -299372851, now seen corresponding path program 18 times [2025-04-14 00:53:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:43,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366597157] [2025-04-14 00:53:43,890 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:53:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:43,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 67 statements into 1 equivalence classes. [2025-04-14 00:53:43,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 00:53:43,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:53:43,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:43,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:43,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366597157] [2025-04-14 00:53:43,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366597157] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:43,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:53:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975842769] [2025-04-14 00:53:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:43,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:53:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:43,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:53:43,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:53:43,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:43,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 283 transitions, 2784 flow. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:43,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:43,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:43,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:53:50,935 INFO L116 PetriNetUnfolderBase]: 43783/67905 cut-off events. [2025-04-14 00:53:50,935 INFO L117 PetriNetUnfolderBase]: For 252635/252635 co-relation queries the response was YES. [2025-04-14 00:53:51,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277376 conditions, 67905 events. 43783/67905 cut-off events. For 252635/252635 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 507024 event pairs, 13730 based on Foata normal form. 1/67900 useless extension candidates. Maximal degree in co-relation 277262. Up to 25669 conditions per place. [2025-04-14 00:53:51,717 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 595 selfloop transitions, 39 changer transitions 70/707 dead transitions. [2025-04-14 00:53:51,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 707 transitions, 7616 flow [2025-04-14 00:53:51,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 00:53:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 00:53:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 361 transitions. [2025-04-14 00:53:51,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3953997809419496 [2025-04-14 00:53:51,718 INFO L175 Difference]: Start difference. First operand has 185 places, 283 transitions, 2784 flow. Second operand 11 states and 361 transitions. [2025-04-14 00:53:51,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 707 transitions, 7616 flow [2025-04-14 00:53:54,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 707 transitions, 7528 flow, removed 19 selfloop flow, removed 8 redundant places. [2025-04-14 00:53:54,792 INFO L231 Difference]: Finished difference. Result has 186 places, 283 transitions, 2787 flow [2025-04-14 00:53:54,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2787, PETRI_PLACES=186, PETRI_TRANSITIONS=283} [2025-04-14 00:53:54,793 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 103 predicate places. [2025-04-14 00:53:54,793 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 283 transitions, 2787 flow [2025-04-14 00:53:54,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:54,793 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:53:54,793 INFO L206 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] [2025-04-14 00:53:54,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:53:54,793 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:53:54,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:53:54,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1645940428, now seen corresponding path program 1 times [2025-04-14 00:53:54,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:53:54,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051632108] [2025-04-14 00:53:54,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:53:54,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:53:54,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:53:54,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:53:54,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:53:54,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:53:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:53:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:53:54,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051632108] [2025-04-14 00:53:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051632108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:53:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:53:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:53:54,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106868660] [2025-04-14 00:53:54,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:53:54,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:53:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:53:54,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:53:54,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:53:54,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:53:54,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 283 transitions, 2787 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:53:54,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:53:54,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:53:54,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:01,184 INFO L116 PetriNetUnfolderBase]: 44458/70180 cut-off events. [2025-04-14 00:54:01,184 INFO L117 PetriNetUnfolderBase]: For 245149/245149 co-relation queries the response was YES. [2025-04-14 00:54:01,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277414 conditions, 70180 events. 44458/70180 cut-off events. For 245149/245149 co-relation queries the response was YES. Maximal size of possible extension queue 1510. Compared 544990 event pairs, 19049 based on Foata normal form. 352/70526 useless extension candidates. Maximal degree in co-relation 277304. Up to 30031 conditions per place. [2025-04-14 00:54:01,735 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 476 selfloop transitions, 75 changer transitions 35/589 dead transitions. [2025-04-14 00:54:01,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 589 transitions, 6576 flow [2025-04-14 00:54:01,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:54:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:54:01,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2025-04-14 00:54:01,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45266781411359724 [2025-04-14 00:54:01,736 INFO L175 Difference]: Start difference. First operand has 186 places, 283 transitions, 2787 flow. Second operand 7 states and 263 transitions. [2025-04-14 00:54:01,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 589 transitions, 6576 flow [2025-04-14 00:54:04,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 589 transitions, 6025 flow, removed 36 selfloop flow, removed 16 redundant places. [2025-04-14 00:54:04,495 INFO L231 Difference]: Finished difference. Result has 179 places, 298 transitions, 3009 flow [2025-04-14 00:54:04,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3009, PETRI_PLACES=179, PETRI_TRANSITIONS=298} [2025-04-14 00:54:04,496 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 96 predicate places. [2025-04-14 00:54:04,496 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 298 transitions, 3009 flow [2025-04-14 00:54:04,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:04,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:04,496 INFO L206 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] [2025-04-14 00:54:04,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:54:04,496 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:04,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash -763624545, now seen corresponding path program 1 times [2025-04-14 00:54:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:04,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329144441] [2025-04-14 00:54:04,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:04,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:54:04,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:04,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:04,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:04,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329144441] [2025-04-14 00:54:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329144441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:04,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:54:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129300736] [2025-04-14 00:54:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:04,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:54:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:04,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:54:04,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:54:04,602 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:04,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 298 transitions, 3009 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:04,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:04,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:04,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:10,926 INFO L116 PetriNetUnfolderBase]: 45504/71329 cut-off events. [2025-04-14 00:54:10,927 INFO L117 PetriNetUnfolderBase]: For 265149/265149 co-relation queries the response was YES. [2025-04-14 00:54:11,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282266 conditions, 71329 events. 45504/71329 cut-off events. For 265149/265149 co-relation queries the response was YES. Maximal size of possible extension queue 1630. Compared 549491 event pairs, 16466 based on Foata normal form. 162/71491 useless extension candidates. Maximal degree in co-relation 248111. Up to 57251 conditions per place. [2025-04-14 00:54:11,405 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 475 selfloop transitions, 107 changer transitions 47/632 dead transitions. [2025-04-14 00:54:11,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 632 transitions, 6491 flow [2025-04-14 00:54:11,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:54:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:54:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 448 transitions. [2025-04-14 00:54:11,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3175053153791637 [2025-04-14 00:54:11,406 INFO L175 Difference]: Start difference. First operand has 179 places, 298 transitions, 3009 flow. Second operand 17 states and 448 transitions. [2025-04-14 00:54:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 632 transitions, 6491 flow [2025-04-14 00:54:12,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 632 transitions, 6421 flow, removed 35 selfloop flow, removed 0 redundant places. [2025-04-14 00:54:12,874 INFO L231 Difference]: Finished difference. Result has 206 places, 372 transitions, 4250 flow [2025-04-14 00:54:12,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=2953, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4250, PETRI_PLACES=206, PETRI_TRANSITIONS=372} [2025-04-14 00:54:12,874 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 123 predicate places. [2025-04-14 00:54:12,874 INFO L485 AbstractCegarLoop]: Abstraction has has 206 places, 372 transitions, 4250 flow [2025-04-14 00:54:12,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:12,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:12,875 INFO L206 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] [2025-04-14 00:54:12,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 00:54:12,875 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:12,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:12,875 INFO L85 PathProgramCache]: Analyzing trace with hash -998691403, now seen corresponding path program 2 times [2025-04-14 00:54:12,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:12,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391817602] [2025-04-14 00:54:12,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:54:12,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:12,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:54:12,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:12,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:54:12,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:12,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:12,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391817602] [2025-04-14 00:54:12,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391817602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:12,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:12,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:54:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802423902] [2025-04-14 00:54:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:12,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:54:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:12,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:54:12,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:54:12,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:12,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 372 transitions, 4250 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:12,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:12,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:12,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:20,267 INFO L116 PetriNetUnfolderBase]: 45897/72051 cut-off events. [2025-04-14 00:54:20,267 INFO L117 PetriNetUnfolderBase]: For 325270/325270 co-relation queries the response was YES. [2025-04-14 00:54:20,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301504 conditions, 72051 events. 45897/72051 cut-off events. For 325270/325270 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 556194 event pairs, 16416 based on Foata normal form. 23/72074 useless extension candidates. Maximal degree in co-relation 299382. Up to 56658 conditions per place. [2025-04-14 00:54:20,912 INFO L140 encePairwiseOnDemand]: 64/83 looper letters, 500 selfloop transitions, 107 changer transitions 38/648 dead transitions. [2025-04-14 00:54:20,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 648 transitions, 7085 flow [2025-04-14 00:54:20,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:54:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:54:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 413 transitions. [2025-04-14 00:54:20,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3317269076305221 [2025-04-14 00:54:20,913 INFO L175 Difference]: Start difference. First operand has 206 places, 372 transitions, 4250 flow. Second operand 15 states and 413 transitions. [2025-04-14 00:54:20,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 648 transitions, 7085 flow [2025-04-14 00:54:22,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 648 transitions, 6981 flow, removed 52 selfloop flow, removed 2 redundant places. [2025-04-14 00:54:22,903 INFO L231 Difference]: Finished difference. Result has 223 places, 376 transitions, 4494 flow [2025-04-14 00:54:22,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4146, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4494, PETRI_PLACES=223, PETRI_TRANSITIONS=376} [2025-04-14 00:54:22,903 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 140 predicate places. [2025-04-14 00:54:22,904 INFO L485 AbstractCegarLoop]: Abstraction has has 223 places, 376 transitions, 4494 flow [2025-04-14 00:54:22,904 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:22,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:22,904 INFO L206 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] [2025-04-14 00:54:22,904 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:54:22,904 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:22,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -489509452, now seen corresponding path program 1 times [2025-04-14 00:54:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:22,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986154239] [2025-04-14 00:54:22,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:22,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:54:22,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:22,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:22,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:22,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986154239] [2025-04-14 00:54:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986154239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:22,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:54:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841832445] [2025-04-14 00:54:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:22,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:54:22,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:22,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:54:22,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:54:22,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:22,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 376 transitions, 4494 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:22,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:22,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:22,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:30,793 INFO L116 PetriNetUnfolderBase]: 47190/74788 cut-off events. [2025-04-14 00:54:30,793 INFO L117 PetriNetUnfolderBase]: For 402072/402072 co-relation queries the response was YES. [2025-04-14 00:54:31,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324152 conditions, 74788 events. 47190/74788 cut-off events. For 402072/402072 co-relation queries the response was YES. Maximal size of possible extension queue 1662. Compared 590227 event pairs, 20512 based on Foata normal form. 156/74938 useless extension candidates. Maximal degree in co-relation 321547. Up to 31582 conditions per place. [2025-04-14 00:54:31,523 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 582 selfloop transitions, 85 changer transitions 34/704 dead transitions. [2025-04-14 00:54:31,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 704 transitions, 8609 flow [2025-04-14 00:54:31,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:54:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:54:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2025-04-14 00:54:31,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4578313253012048 [2025-04-14 00:54:31,524 INFO L175 Difference]: Start difference. First operand has 223 places, 376 transitions, 4494 flow. Second operand 7 states and 266 transitions. [2025-04-14 00:54:31,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 704 transitions, 8609 flow [2025-04-14 00:54:34,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 704 transitions, 8486 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-04-14 00:54:34,280 INFO L231 Difference]: Finished difference. Result has 221 places, 396 transitions, 4882 flow [2025-04-14 00:54:34,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4384, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4882, PETRI_PLACES=221, PETRI_TRANSITIONS=396} [2025-04-14 00:54:34,281 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 138 predicate places. [2025-04-14 00:54:34,281 INFO L485 AbstractCegarLoop]: Abstraction has has 221 places, 396 transitions, 4882 flow [2025-04-14 00:54:34,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:34,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:34,281 INFO L206 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] [2025-04-14 00:54:34,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:54:34,281 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:34,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1051125963, now seen corresponding path program 3 times [2025-04-14 00:54:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:34,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702443778] [2025-04-14 00:54:34,282 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:54:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:34,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:54:34,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:34,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:54:34,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:34,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:34,367 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702443778] [2025-04-14 00:54:34,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702443778] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:34,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:34,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:54:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646357048] [2025-04-14 00:54:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:34,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:54:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:34,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:54:34,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:54:34,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:34,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 396 transitions, 4882 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:34,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:34,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:34,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:42,606 INFO L116 PetriNetUnfolderBase]: 44089/70363 cut-off events. [2025-04-14 00:54:42,606 INFO L117 PetriNetUnfolderBase]: For 428698/428698 co-relation queries the response was YES. [2025-04-14 00:54:43,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312758 conditions, 70363 events. 44089/70363 cut-off events. For 428698/428698 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 557100 event pairs, 19941 based on Foata normal form. 190/70553 useless extension candidates. Maximal degree in co-relation 298711. Up to 32993 conditions per place. [2025-04-14 00:54:43,216 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 625 selfloop transitions, 66 changer transitions 23/717 dead transitions. [2025-04-14 00:54:43,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 717 transitions, 9352 flow [2025-04-14 00:54:43,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:54:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:54:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-04-14 00:54:43,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45438898450946646 [2025-04-14 00:54:43,217 INFO L175 Difference]: Start difference. First operand has 221 places, 396 transitions, 4882 flow. Second operand 7 states and 264 transitions. [2025-04-14 00:54:43,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 717 transitions, 9352 flow [2025-04-14 00:54:45,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 717 transitions, 9226 flow, removed 55 selfloop flow, removed 1 redundant places. [2025-04-14 00:54:45,864 INFO L231 Difference]: Finished difference. Result has 229 places, 405 transitions, 5189 flow [2025-04-14 00:54:45,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4694, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5189, PETRI_PLACES=229, PETRI_TRANSITIONS=405} [2025-04-14 00:54:45,865 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 146 predicate places. [2025-04-14 00:54:45,865 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 405 transitions, 5189 flow [2025-04-14 00:54:45,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:45,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:45,865 INFO L206 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] [2025-04-14 00:54:45,865 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 00:54:45,865 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:45,866 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1144552561, now seen corresponding path program 4 times [2025-04-14 00:54:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:45,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909236620] [2025-04-14 00:54:45,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:54:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:45,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-14 00:54:45,874 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:45,874 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:54:45,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:45,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909236620] [2025-04-14 00:54:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909236620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:54:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101793688] [2025-04-14 00:54:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:45,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:54:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:45,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:54:45,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:54:45,899 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:45,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 405 transitions, 5189 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:45,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:45,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:45,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:54:54,088 INFO L116 PetriNetUnfolderBase]: 44689/71865 cut-off events. [2025-04-14 00:54:54,088 INFO L117 PetriNetUnfolderBase]: For 489534/489534 co-relation queries the response was YES. [2025-04-14 00:54:54,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321840 conditions, 71865 events. 44689/71865 cut-off events. For 489534/489534 co-relation queries the response was YES. Maximal size of possible extension queue 1535. Compared 576536 event pairs, 16572 based on Foata normal form. 151/72016 useless extension candidates. Maximal degree in co-relation 316362. Up to 28435 conditions per place. [2025-04-14 00:54:54,752 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 554 selfloop transitions, 100 changer transitions 8/665 dead transitions. [2025-04-14 00:54:54,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 665 transitions, 8983 flow [2025-04-14 00:54:54,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:54:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:54:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions. [2025-04-14 00:54:54,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5180722891566265 [2025-04-14 00:54:54,753 INFO L175 Difference]: Start difference. First operand has 229 places, 405 transitions, 5189 flow. Second operand 5 states and 215 transitions. [2025-04-14 00:54:54,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 665 transitions, 8983 flow [2025-04-14 00:54:57,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 665 transitions, 8901 flow, removed 37 selfloop flow, removed 1 redundant places. [2025-04-14 00:54:57,546 INFO L231 Difference]: Finished difference. Result has 235 places, 430 transitions, 5890 flow [2025-04-14 00:54:57,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=4948, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5890, PETRI_PLACES=235, PETRI_TRANSITIONS=430} [2025-04-14 00:54:57,547 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 152 predicate places. [2025-04-14 00:54:57,547 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 430 transitions, 5890 flow [2025-04-14 00:54:57,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:57,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:54:57,547 INFO L206 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] [2025-04-14 00:54:57,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 00:54:57,547 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:54:57,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:54:57,548 INFO L85 PathProgramCache]: Analyzing trace with hash 757734935, now seen corresponding path program 1 times [2025-04-14 00:54:57,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:54:57,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565517128] [2025-04-14 00:54:57,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:54:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:54:57,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:54:57,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:54:57,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:54:57,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:54:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:54:57,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:54:57,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565517128] [2025-04-14 00:54:57,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565517128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:54:57,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:54:57,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:54:57,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581106588] [2025-04-14 00:54:57,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:54:57,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:54:57,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:54:57,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:54:57,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:54:57,589 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:54:57,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 430 transitions, 5890 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:54:57,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:54:57,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:54:57,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:06,502 INFO L116 PetriNetUnfolderBase]: 46193/74912 cut-off events. [2025-04-14 00:55:06,502 INFO L117 PetriNetUnfolderBase]: For 578135/578135 co-relation queries the response was YES. [2025-04-14 00:55:07,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339539 conditions, 74912 events. 46193/74912 cut-off events. For 578135/578135 co-relation queries the response was YES. Maximal size of possible extension queue 1516. Compared 609644 event pairs, 17971 based on Foata normal form. 214/75126 useless extension candidates. Maximal degree in co-relation 334672. Up to 31525 conditions per place. [2025-04-14 00:55:07,193 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 522 selfloop transitions, 105 changer transitions 14/644 dead transitions. [2025-04-14 00:55:07,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 644 transitions, 9309 flow [2025-04-14 00:55:07,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:55:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:55:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-04-14 00:55:07,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5753012048192772 [2025-04-14 00:55:07,194 INFO L175 Difference]: Start difference. First operand has 235 places, 430 transitions, 5890 flow. Second operand 4 states and 191 transitions. [2025-04-14 00:55:07,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 644 transitions, 9309 flow [2025-04-14 00:55:09,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 644 transitions, 9248 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-14 00:55:09,676 INFO L231 Difference]: Finished difference. Result has 237 places, 436 transitions, 6371 flow [2025-04-14 00:55:09,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=5630, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6371, PETRI_PLACES=237, PETRI_TRANSITIONS=436} [2025-04-14 00:55:09,677 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 154 predicate places. [2025-04-14 00:55:09,677 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 436 transitions, 6371 flow [2025-04-14 00:55:09,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:09,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:09,677 INFO L206 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] [2025-04-14 00:55:09,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 00:55:09,677 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:55:09,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash -798229493, now seen corresponding path program 2 times [2025-04-14 00:55:09,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:09,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070263598] [2025-04-14 00:55:09,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:55:09,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:09,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:55:09,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:55:09,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:55:09,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:09,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070263598] [2025-04-14 00:55:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070263598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:55:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303292330] [2025-04-14 00:55:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:09,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:55:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:09,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:55:09,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:55:09,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:55:09,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 436 transitions, 6371 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:09,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:09,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:55:09,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:19,290 INFO L116 PetriNetUnfolderBase]: 47717/77144 cut-off events. [2025-04-14 00:55:19,291 INFO L117 PetriNetUnfolderBase]: For 682195/682195 co-relation queries the response was YES. [2025-04-14 00:55:19,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359443 conditions, 77144 events. 47717/77144 cut-off events. For 682195/682195 co-relation queries the response was YES. Maximal size of possible extension queue 1669. Compared 628191 event pairs, 18626 based on Foata normal form. 264/77408 useless extension candidates. Maximal degree in co-relation 357160. Up to 59920 conditions per place. [2025-04-14 00:55:20,049 INFO L140 encePairwiseOnDemand]: 61/83 looper letters, 640 selfloop transitions, 131 changer transitions 44/818 dead transitions. [2025-04-14 00:55:20,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 818 transitions, 11255 flow [2025-04-14 00:55:20,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:55:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:55:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 480 transitions. [2025-04-14 00:55:20,051 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3401842664776754 [2025-04-14 00:55:20,051 INFO L175 Difference]: Start difference. First operand has 237 places, 436 transitions, 6371 flow. Second operand 17 states and 480 transitions. [2025-04-14 00:55:20,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 818 transitions, 11255 flow [2025-04-14 00:55:22,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 818 transitions, 11199 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 00:55:22,793 INFO L231 Difference]: Finished difference. Result has 266 places, 519 transitions, 8228 flow [2025-04-14 00:55:22,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=6231, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8228, PETRI_PLACES=266, PETRI_TRANSITIONS=519} [2025-04-14 00:55:22,794 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 183 predicate places. [2025-04-14 00:55:22,794 INFO L485 AbstractCegarLoop]: Abstraction has has 266 places, 519 transitions, 8228 flow [2025-04-14 00:55:22,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:22,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:22,794 INFO L206 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] [2025-04-14 00:55:22,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 00:55:22,794 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:55:22,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1345895613, now seen corresponding path program 3 times [2025-04-14 00:55:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:22,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637000106] [2025-04-14 00:55:22,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:55:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:22,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:55:22,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:55:22,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:55:22,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:22,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637000106] [2025-04-14 00:55:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637000106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:55:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938386607] [2025-04-14 00:55:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:22,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:55:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:55:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:55:22,882 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:55:22,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 519 transitions, 8228 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:22,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:22,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:55:22,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:34,923 INFO L116 PetriNetUnfolderBase]: 48092/78061 cut-off events. [2025-04-14 00:55:34,923 INFO L117 PetriNetUnfolderBase]: For 831471/831471 co-relation queries the response was YES. [2025-04-14 00:55:35,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384989 conditions, 78061 events. 48092/78061 cut-off events. For 831471/831471 co-relation queries the response was YES. Maximal size of possible extension queue 1687. Compared 640622 event pairs, 17857 based on Foata normal form. 80/78141 useless extension candidates. Maximal degree in co-relation 382898. Up to 58457 conditions per place. [2025-04-14 00:55:35,847 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 688 selfloop transitions, 144 changer transitions 43/878 dead transitions. [2025-04-14 00:55:35,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 878 transitions, 12694 flow [2025-04-14 00:55:35,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-14 00:55:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-14 00:55:35,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 521 transitions. [2025-04-14 00:55:35,852 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3303741280913126 [2025-04-14 00:55:35,852 INFO L175 Difference]: Start difference. First operand has 266 places, 519 transitions, 8228 flow. Second operand 19 states and 521 transitions. [2025-04-14 00:55:35,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 878 transitions, 12694 flow [2025-04-14 00:55:39,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 878 transitions, 12450 flow, removed 122 selfloop flow, removed 3 redundant places. [2025-04-14 00:55:39,959 INFO L231 Difference]: Finished difference. Result has 287 places, 534 transitions, 8725 flow [2025-04-14 00:55:39,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=7981, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8725, PETRI_PLACES=287, PETRI_TRANSITIONS=534} [2025-04-14 00:55:39,960 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 204 predicate places. [2025-04-14 00:55:39,960 INFO L485 AbstractCegarLoop]: Abstraction has has 287 places, 534 transitions, 8725 flow [2025-04-14 00:55:39,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:39,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:55:39,960 INFO L206 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] [2025-04-14 00:55:39,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 00:55:39,960 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:55:39,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:55:39,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1079440605, now seen corresponding path program 4 times [2025-04-14 00:55:39,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:55:39,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835479132] [2025-04-14 00:55:39,961 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:55:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:55:39,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-14 00:55:39,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:55:39,972 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:55:39,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:55:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:55:40,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:55:40,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835479132] [2025-04-14 00:55:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835479132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:55:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:55:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:55:40,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043558872] [2025-04-14 00:55:40,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:55:40,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:55:40,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:55:40,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:55:40,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:55:40,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:55:40,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 534 transitions, 8725 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:55:40,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:55:40,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:55:40,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:55:54,724 INFO L116 PetriNetUnfolderBase]: 59637/96946 cut-off events. [2025-04-14 00:55:54,724 INFO L117 PetriNetUnfolderBase]: For 1252877/1252877 co-relation queries the response was YES. [2025-04-14 00:55:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502709 conditions, 96946 events. 59637/96946 cut-off events. For 1252877/1252877 co-relation queries the response was YES. Maximal size of possible extension queue 2053. Compared 820415 event pairs, 23713 based on Foata normal form. 188/97134 useless extension candidates. Maximal degree in co-relation 494826. Up to 38540 conditions per place. [2025-04-14 00:55:55,934 INFO L140 encePairwiseOnDemand]: 60/83 looper letters, 950 selfloop transitions, 270 changer transitions 35/1258 dead transitions. [2025-04-14 00:55:55,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1258 transitions, 19180 flow [2025-04-14 00:55:55,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 00:55:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 00:55:55,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 450 transitions. [2025-04-14 00:55:55,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4170528266913809 [2025-04-14 00:55:55,935 INFO L175 Difference]: Start difference. First operand has 287 places, 534 transitions, 8725 flow. Second operand 13 states and 450 transitions. [2025-04-14 00:55:55,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 1258 transitions, 19180 flow [2025-04-14 00:56:02,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 1258 transitions, 18848 flow, removed 101 selfloop flow, removed 7 redundant places. [2025-04-14 00:56:02,349 INFO L231 Difference]: Finished difference. Result has 302 places, 624 transitions, 11373 flow [2025-04-14 00:56:02,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=8348, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11373, PETRI_PLACES=302, PETRI_TRANSITIONS=624} [2025-04-14 00:56:02,349 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 219 predicate places. [2025-04-14 00:56:02,349 INFO L485 AbstractCegarLoop]: Abstraction has has 302 places, 624 transitions, 11373 flow [2025-04-14 00:56:02,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:02,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:02,350 INFO L206 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] [2025-04-14 00:56:02,350 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:56:02,350 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:02,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:02,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1236075828, now seen corresponding path program 1 times [2025-04-14 00:56:02,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:02,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858986839] [2025-04-14 00:56:02,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:56:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:02,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:56:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:56:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:56:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:02,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858986839] [2025-04-14 00:56:02,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858986839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:02,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:02,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:56:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872977516] [2025-04-14 00:56:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:02,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:56:02,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:02,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:56:02,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:56:02,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:56:02,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 624 transitions, 11373 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:02,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:02,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:56:02,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:17,758 INFO L116 PetriNetUnfolderBase]: 51475/84385 cut-off events. [2025-04-14 00:56:17,758 INFO L117 PetriNetUnfolderBase]: For 1331383/1331383 co-relation queries the response was YES. [2025-04-14 00:56:18,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461069 conditions, 84385 events. 51475/84385 cut-off events. For 1331383/1331383 co-relation queries the response was YES. Maximal size of possible extension queue 1878. Compared 709359 event pairs, 24192 based on Foata normal form. 222/84601 useless extension candidates. Maximal degree in co-relation 452101. Up to 36858 conditions per place. [2025-04-14 00:56:18,872 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 638 selfloop transitions, 144 changer transitions 54/839 dead transitions. [2025-04-14 00:56:18,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 839 transitions, 15241 flow [2025-04-14 00:56:18,872 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:56:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:56:18,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2025-04-14 00:56:18,873 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4440619621342513 [2025-04-14 00:56:18,873 INFO L175 Difference]: Start difference. First operand has 302 places, 624 transitions, 11373 flow. Second operand 7 states and 258 transitions. [2025-04-14 00:56:18,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 839 transitions, 15241 flow [2025-04-14 00:56:27,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 839 transitions, 14577 flow, removed 295 selfloop flow, removed 3 redundant places. [2025-04-14 00:56:27,149 INFO L231 Difference]: Finished difference. Result has 309 places, 596 transitions, 10510 flow [2025-04-14 00:56:27,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=10411, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10510, PETRI_PLACES=309, PETRI_TRANSITIONS=596} [2025-04-14 00:56:27,150 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 226 predicate places. [2025-04-14 00:56:27,150 INFO L485 AbstractCegarLoop]: Abstraction has has 309 places, 596 transitions, 10510 flow [2025-04-14 00:56:27,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:27,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:27,150 INFO L206 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] [2025-04-14 00:56:27,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 00:56:27,150 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:27,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash -672838156, now seen corresponding path program 2 times [2025-04-14 00:56:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:27,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45677996] [2025-04-14 00:56:27,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:27,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:27,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:56:27,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:56:27,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:27,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:27,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45677996] [2025-04-14 00:56:27,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45677996] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:27,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:27,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:56:27,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907145773] [2025-04-14 00:56:27,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:27,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:56:27,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:27,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:56:27,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:56:27,185 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:56:27,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 596 transitions, 10510 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:27,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:27,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:56:27,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:56:42,316 INFO L116 PetriNetUnfolderBase]: 49419/80801 cut-off events. [2025-04-14 00:56:42,316 INFO L117 PetriNetUnfolderBase]: For 1188843/1188843 co-relation queries the response was YES. [2025-04-14 00:56:43,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435875 conditions, 80801 events. 49419/80801 cut-off events. For 1188843/1188843 co-relation queries the response was YES. Maximal size of possible extension queue 1738. Compared 671617 event pairs, 19488 based on Foata normal form. 88/80883 useless extension candidates. Maximal degree in co-relation 435562. Up to 31244 conditions per place. [2025-04-14 00:56:43,457 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 638 selfloop transitions, 105 changer transitions 10/756 dead transitions. [2025-04-14 00:56:43,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 756 transitions, 13541 flow [2025-04-14 00:56:43,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:56:43,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:56:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-04-14 00:56:43,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5662650602409639 [2025-04-14 00:56:43,459 INFO L175 Difference]: Start difference. First operand has 309 places, 596 transitions, 10510 flow. Second operand 4 states and 188 transitions. [2025-04-14 00:56:43,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 756 transitions, 13541 flow [2025-04-14 00:56:50,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 756 transitions, 13106 flow, removed 60 selfloop flow, removed 7 redundant places. [2025-04-14 00:56:50,467 INFO L231 Difference]: Finished difference. Result has 304 places, 594 transitions, 10446 flow [2025-04-14 00:56:50,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=9879, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10446, PETRI_PLACES=304, PETRI_TRANSITIONS=594} [2025-04-14 00:56:50,468 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 221 predicate places. [2025-04-14 00:56:50,468 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 594 transitions, 10446 flow [2025-04-14 00:56:50,468 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:50,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:56:50,468 INFO L206 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] [2025-04-14 00:56:50,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 00:56:50,468 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:56:50,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:56:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 938649880, now seen corresponding path program 2 times [2025-04-14 00:56:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:56:50,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108041553] [2025-04-14 00:56:50,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:56:50,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:56:50,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:56:50,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:56:50,476 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:56:50,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:56:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:56:50,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:56:50,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108041553] [2025-04-14 00:56:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108041553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:56:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:56:50,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:56:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482750690] [2025-04-14 00:56:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:56:50,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:56:50,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:56:50,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:56:50,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:56:50,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:56:50,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 594 transitions, 10446 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:56:50,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:56:50,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:56:50,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:04,847 INFO L116 PetriNetUnfolderBase]: 50406/82929 cut-off events. [2025-04-14 00:57:04,848 INFO L117 PetriNetUnfolderBase]: For 1283590/1283590 co-relation queries the response was YES. [2025-04-14 00:57:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441847 conditions, 82929 events. 50406/82929 cut-off events. For 1283590/1283590 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 697242 event pairs, 19686 based on Foata normal form. 82/83005 useless extension candidates. Maximal degree in co-relation 436362. Up to 36159 conditions per place. [2025-04-14 00:57:06,186 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 592 selfloop transitions, 142 changer transitions 14/751 dead transitions. [2025-04-14 00:57:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 751 transitions, 13698 flow [2025-04-14 00:57:06,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:57:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:57:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-04-14 00:57:06,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5451807228915663 [2025-04-14 00:57:06,187 INFO L175 Difference]: Start difference. First operand has 304 places, 594 transitions, 10446 flow. Second operand 4 states and 181 transitions. [2025-04-14 00:57:06,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 751 transitions, 13698 flow [2025-04-14 00:57:13,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 751 transitions, 13596 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:13,038 INFO L231 Difference]: Finished difference. Result has 307 places, 588 transitions, 10807 flow [2025-04-14 00:57:13,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=10110, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10807, PETRI_PLACES=307, PETRI_TRANSITIONS=588} [2025-04-14 00:57:13,039 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 224 predicate places. [2025-04-14 00:57:13,039 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 588 transitions, 10807 flow [2025-04-14 00:57:13,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:13,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:13,039 INFO L206 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] [2025-04-14 00:57:13,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 00:57:13,039 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:57:13,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1584799078, now seen corresponding path program 3 times [2025-04-14 00:57:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:13,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591924348] [2025-04-14 00:57:13,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:57:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:13,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:57:13,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:57:13,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:57:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:13,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591924348] [2025-04-14 00:57:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591924348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:13,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:13,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:57:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721126101] [2025-04-14 00:57:13,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:13,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:57:13,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:13,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:57:13,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:57:13,093 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:57:13,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 588 transitions, 10807 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:13,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:13,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:57:13,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:28,624 INFO L116 PetriNetUnfolderBase]: 51200/84318 cut-off events. [2025-04-14 00:57:28,625 INFO L117 PetriNetUnfolderBase]: For 1364693/1364693 co-relation queries the response was YES. [2025-04-14 00:57:29,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458194 conditions, 84318 events. 51200/84318 cut-off events. For 1364693/1364693 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 712292 event pairs, 18919 based on Foata normal form. 76/84388 useless extension candidates. Maximal degree in co-relation 451986. Up to 62712 conditions per place. [2025-04-14 00:57:29,701 INFO L140 encePairwiseOnDemand]: 61/83 looper letters, 789 selfloop transitions, 171 changer transitions 24/987 dead transitions. [2025-04-14 00:57:29,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 987 transitions, 17226 flow [2025-04-14 00:57:29,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:57:29,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:57:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 428 transitions. [2025-04-14 00:57:29,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3683304647160069 [2025-04-14 00:57:29,702 INFO L175 Difference]: Start difference. First operand has 307 places, 588 transitions, 10807 flow. Second operand 14 states and 428 transitions. [2025-04-14 00:57:29,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 987 transitions, 17226 flow [2025-04-14 00:57:36,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 987 transitions, 17030 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:57:36,911 INFO L231 Difference]: Finished difference. Result has 331 places, 637 transitions, 12341 flow [2025-04-14 00:57:36,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=10547, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12341, PETRI_PLACES=331, PETRI_TRANSITIONS=637} [2025-04-14 00:57:36,912 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 248 predicate places. [2025-04-14 00:57:36,912 INFO L485 AbstractCegarLoop]: Abstraction has has 331 places, 637 transitions, 12341 flow [2025-04-14 00:57:36,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:36,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:57:36,913 INFO L206 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] [2025-04-14 00:57:36,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 00:57:36,913 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:57:36,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:57:36,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1887586267, now seen corresponding path program 1 times [2025-04-14 00:57:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:57:36,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956358625] [2025-04-14 00:57:36,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:57:36,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:57:36,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:57:36,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:57:36,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:57:36,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:57:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:57:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:57:37,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956358625] [2025-04-14 00:57:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956358625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:57:37,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:57:37,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:57:37,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904394674] [2025-04-14 00:57:37,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:57:37,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:57:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:57:37,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:57:37,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:57:37,025 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:57:37,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 637 transitions, 12341 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:57:37,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:57:37,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:57:37,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:57:52,312 INFO L116 PetriNetUnfolderBase]: 47076/77946 cut-off events. [2025-04-14 00:57:52,312 INFO L117 PetriNetUnfolderBase]: For 1330481/1330481 co-relation queries the response was YES. [2025-04-14 00:57:53,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428711 conditions, 77946 events. 47076/77946 cut-off events. For 1330481/1330481 co-relation queries the response was YES. Maximal size of possible extension queue 1696. Compared 656687 event pairs, 18659 based on Foata normal form. 170/78110 useless extension candidates. Maximal degree in co-relation 423623. Up to 65957 conditions per place. [2025-04-14 00:57:53,535 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 697 selfloop transitions, 131 changer transitions 32/863 dead transitions. [2025-04-14 00:57:53,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 863 transitions, 15818 flow [2025-04-14 00:57:53,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 00:57:53,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 00:57:53,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 416 transitions. [2025-04-14 00:57:53,537 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3132530120481928 [2025-04-14 00:57:53,537 INFO L175 Difference]: Start difference. First operand has 331 places, 637 transitions, 12341 flow. Second operand 16 states and 416 transitions. [2025-04-14 00:57:53,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 863 transitions, 15818 flow [2025-04-14 00:58:01,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 863 transitions, 15457 flow, removed 133 selfloop flow, removed 2 redundant places. [2025-04-14 00:58:01,575 INFO L231 Difference]: Finished difference. Result has 356 places, 658 transitions, 12819 flow [2025-04-14 00:58:01,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11202, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=12819, PETRI_PLACES=356, PETRI_TRANSITIONS=658} [2025-04-14 00:58:01,575 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 273 predicate places. [2025-04-14 00:58:01,576 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 658 transitions, 12819 flow [2025-04-14 00:58:01,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:01,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:01,576 INFO L206 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] [2025-04-14 00:58:01,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 00:58:01,576 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:58:01,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash 799122121, now seen corresponding path program 2 times [2025-04-14 00:58:01,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:01,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415805805] [2025-04-14 00:58:01,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:58:01,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:01,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:58:01,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:58:01,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:58:01,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:01,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:01,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415805805] [2025-04-14 00:58:01,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415805805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:01,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:01,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:58:01,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596536912] [2025-04-14 00:58:01,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:01,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:58:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:01,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:58:01,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:58:01,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:58:01,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 658 transitions, 12819 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:01,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:01,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:58:01,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:17,367 INFO L116 PetriNetUnfolderBase]: 46209/76461 cut-off events. [2025-04-14 00:58:17,367 INFO L117 PetriNetUnfolderBase]: For 1321178/1321178 co-relation queries the response was YES. [2025-04-14 00:58:18,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421629 conditions, 76461 events. 46209/76461 cut-off events. For 1321178/1321178 co-relation queries the response was YES. Maximal size of possible extension queue 1647. Compared 641214 event pairs, 18381 based on Foata normal form. 32/76487 useless extension candidates. Maximal degree in co-relation 421499. Up to 64961 conditions per place. [2025-04-14 00:58:18,834 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 662 selfloop transitions, 121 changer transitions 30/816 dead transitions. [2025-04-14 00:58:18,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 816 transitions, 15277 flow [2025-04-14 00:58:18,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:58:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:58:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 367 transitions. [2025-04-14 00:58:18,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29477911646586347 [2025-04-14 00:58:18,835 INFO L175 Difference]: Start difference. First operand has 356 places, 658 transitions, 12819 flow. Second operand 15 states and 367 transitions. [2025-04-14 00:58:18,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 816 transitions, 15277 flow [2025-04-14 00:58:27,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 816 transitions, 14888 flow, removed 189 selfloop flow, removed 2 redundant places. [2025-04-14 00:58:27,253 INFO L231 Difference]: Finished difference. Result has 368 places, 648 transitions, 12415 flow [2025-04-14 00:58:27,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=12292, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=532, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12415, PETRI_PLACES=368, PETRI_TRANSITIONS=648} [2025-04-14 00:58:27,254 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 285 predicate places. [2025-04-14 00:58:27,254 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 648 transitions, 12415 flow [2025-04-14 00:58:27,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:27,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:27,255 INFO L206 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] [2025-04-14 00:58:27,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-14 00:58:27,256 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:58:27,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1327627313, now seen corresponding path program 3 times [2025-04-14 00:58:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:27,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483883683] [2025-04-14 00:58:27,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:58:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:27,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:58:27,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:58:27,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:58:27,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:27,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483883683] [2025-04-14 00:58:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483883683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:58:27,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50152661] [2025-04-14 00:58:27,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:27,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:58:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:27,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:58:27,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:58:27,366 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:58:27,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 648 transitions, 12415 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:27,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:27,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:58:27,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:58:40,983 INFO L116 PetriNetUnfolderBase]: 39686/66422 cut-off events. [2025-04-14 00:58:40,984 INFO L117 PetriNetUnfolderBase]: For 1075365/1075365 co-relation queries the response was YES. [2025-04-14 00:58:41,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354177 conditions, 66422 events. 39686/66422 cut-off events. For 1075365/1075365 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 553855 event pairs, 21032 based on Foata normal form. 178/66594 useless extension candidates. Maximal degree in co-relation 354045. Up to 34486 conditions per place. [2025-04-14 00:58:42,132 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 710 selfloop transitions, 114 changer transitions 21/848 dead transitions. [2025-04-14 00:58:42,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 848 transitions, 15916 flow [2025-04-14 00:58:42,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:58:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:58:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 248 transitions. [2025-04-14 00:58:42,134 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4268502581755594 [2025-04-14 00:58:42,134 INFO L175 Difference]: Start difference. First operand has 368 places, 648 transitions, 12415 flow. Second operand 7 states and 248 transitions. [2025-04-14 00:58:42,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 848 transitions, 15916 flow [2025-04-14 00:58:48,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 848 transitions, 15613 flow, removed 62 selfloop flow, removed 13 redundant places. [2025-04-14 00:58:48,137 INFO L231 Difference]: Finished difference. Result has 359 places, 654 transitions, 12308 flow [2025-04-14 00:58:48,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11540, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12308, PETRI_PLACES=359, PETRI_TRANSITIONS=654} [2025-04-14 00:58:48,138 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 276 predicate places. [2025-04-14 00:58:48,138 INFO L485 AbstractCegarLoop]: Abstraction has has 359 places, 654 transitions, 12308 flow [2025-04-14 00:58:48,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:48,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:58:48,138 INFO L206 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] [2025-04-14 00:58:48,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 00:58:48,138 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:58:48,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:58:48,139 INFO L85 PathProgramCache]: Analyzing trace with hash -464094538, now seen corresponding path program 4 times [2025-04-14 00:58:48,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:58:48,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568427874] [2025-04-14 00:58:48,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:58:48,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:58:48,143 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 68 statements into 2 equivalence classes. [2025-04-14 00:58:48,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:58:48,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:58:48,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:58:48,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:58:48,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:58:48,226 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568427874] [2025-04-14 00:58:48,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568427874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:58:48,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:58:48,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:58:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379632541] [2025-04-14 00:58:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:58:48,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:58:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:58:48,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:58:48,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:58:48,227 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:58:48,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 654 transitions, 12308 flow. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:58:48,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:58:48,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:58:48,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:59:01,600 INFO L116 PetriNetUnfolderBase]: 39686/66282 cut-off events. [2025-04-14 00:59:01,600 INFO L117 PetriNetUnfolderBase]: For 1067270/1067270 co-relation queries the response was YES. [2025-04-14 00:59:02,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354712 conditions, 66282 events. 39686/66282 cut-off events. For 1067270/1067270 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 551716 event pairs, 17512 based on Foata normal form. 16/66292 useless extension candidates. Maximal degree in co-relation 354582. Up to 58887 conditions per place. [2025-04-14 00:59:02,650 INFO L140 encePairwiseOnDemand]: 65/83 looper letters, 690 selfloop transitions, 82 changer transitions 14/789 dead transitions. [2025-04-14 00:59:02,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 789 transitions, 14646 flow [2025-04-14 00:59:02,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 00:59:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 00:59:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 348 transitions. [2025-04-14 00:59:02,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27951807228915665 [2025-04-14 00:59:02,651 INFO L175 Difference]: Start difference. First operand has 359 places, 654 transitions, 12308 flow. Second operand 15 states and 348 transitions. [2025-04-14 00:59:02,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 789 transitions, 14646 flow [2025-04-14 00:59:08,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 789 transitions, 14302 flow, removed 66 selfloop flow, removed 5 redundant places. [2025-04-14 00:59:08,480 INFO L231 Difference]: Finished difference. Result has 370 places, 656 transitions, 12221 flow [2025-04-14 00:59:08,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=11895, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=12221, PETRI_PLACES=370, PETRI_TRANSITIONS=656} [2025-04-14 00:59:08,480 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 287 predicate places. [2025-04-14 00:59:08,480 INFO L485 AbstractCegarLoop]: Abstraction has has 370 places, 656 transitions, 12221 flow [2025-04-14 00:59:08,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:08,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:59:08,481 INFO L206 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] [2025-04-14 00:59:08,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 00:59:08,481 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 00:59:08,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:59:08,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1858940666, now seen corresponding path program 2 times [2025-04-14 00:59:08,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:59:08,481 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725095032] [2025-04-14 00:59:08,481 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:59:08,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:59:08,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 1 equivalence classes. [2025-04-14 00:59:08,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-14 00:59:08,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:59:08,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:59:08,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:59:08,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:59:08,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725095032] [2025-04-14 00:59:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725095032] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:59:08,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:59:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:59:08,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182782602] [2025-04-14 00:59:08,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:59:08,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:59:08,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:59:08,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:59:08,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:59:08,541 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 83 [2025-04-14 00:59:08,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 656 transitions, 12221 flow. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:59:08,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:59:08,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 83 [2025-04-14 00:59:08,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand