/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/chl-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:45:26,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:45:26,963 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:45:26,971 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:45:26,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:45:26,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:45:26,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:45:26,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:45:26,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:45:26,994 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:45:26,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:45:26,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:45:26,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:45:26,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:45:26,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:45:26,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:45:26,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:45:26,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:45:26,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:45:26,997 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:45:27,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:45:27,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:45:27,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:45:27,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:45:27,223 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:45:27,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2025-04-14 00:45:28,531 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed978fe90/abf2b11e83744958b92297e6ea739dcc/FLAGff9bdf481 [2025-04-14 00:45:28,763 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:45:28,763 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2025-04-14 00:45:28,772 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed978fe90/abf2b11e83744958b92297e6ea739dcc/FLAGff9bdf481 [2025-04-14 00:45:29,532 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed978fe90/abf2b11e83744958b92297e6ea739dcc [2025-04-14 00:45:29,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:45:29,535 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:45:29,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:45:29,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:45:29,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:45:29,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec3a06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29, skipping insertion in model container [2025-04-14 00:45:29,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:45:29,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3331,3344] [2025-04-14 00:45:29,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:45:29,763 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:45:29,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c[3331,3344] [2025-04-14 00:45:29,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:45:29,824 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:45:29,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29 WrapperNode [2025-04-14 00:45:29,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:45:29,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:45:29,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:45:29,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:45:29,831 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:45:29" (1/1) ... [2025-04-14 00:45:29,839 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:45:29" (1/1) ... [2025-04-14 00:45:29,861 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2025-04-14 00:45:29,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:45:29,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:45:29,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:45:29,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:45:29,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,887 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-14 00:45:29,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:45:29,901 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:45:29,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:45:29,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:45:29,902 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (1/1) ... [2025-04-14 00:45:29,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:45:29,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:45:29,935 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:45:29,938 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:45:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:45:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 00:45:29,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 00:45:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 00:45:29,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 00:45:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 00:45:29,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 00:45:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:45:29,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:45:29,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:45:29,961 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:45:30,051 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:45:30,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:45:30,339 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:45:30,340 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:45:30,340 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:45:30,647 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:45:30,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:45:30 BoogieIcfgContainer [2025-04-14 00:45:30,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:45:30,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:45:30,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:45:30,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:45:30,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:45:29" (1/3) ... [2025-04-14 00:45:30,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f59549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:45:30, skipping insertion in model container [2025-04-14 00:45:30,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:45:29" (2/3) ... [2025-04-14 00:45:30,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f59549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:45:30, skipping insertion in model container [2025-04-14 00:45:30,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:45:30" (3/3) ... [2025-04-14 00:45:30,654 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-04-14 00:45:30,664 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:45:30,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-trans.wvr.c that has 4 procedures, 25 locations, 30 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 00:45:30,665 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:45:30,713 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 00:45:30,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:45:30,764 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-14 00:45:30,766 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:45:30,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 9/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-14 00:45:30,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-14 00:45:30,771 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-14 00:45:30,778 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:45:30,790 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;@1627a568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:45:30,790 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:45:30,801 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:45:30,801 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-14 00:45:30,801 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 00:45:30,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:30,802 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:30,803 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:45:30,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:30,807 INFO L85 PathProgramCache]: Analyzing trace with hash -453327757, now seen corresponding path program 1 times [2025-04-14 00:45:30,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:30,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313711104] [2025-04-14 00:45:30,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:30,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:45:30,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:45:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:31,293 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:45:31,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:31,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313711104] [2025-04-14 00:45:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313711104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:31,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:31,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341948338] [2025-04-14 00:45:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:31,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:31,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:31,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:31,320 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 29 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:31,620 INFO L116 PetriNetUnfolderBase]: 333/473 cut-off events. [2025-04-14 00:45:31,621 INFO L117 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-04-14 00:45:31,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 473 events. 333/473 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1258 event pairs, 124 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 818. Up to 352 conditions per place. [2025-04-14 00:45:31,628 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 50 selfloop transitions, 4 changer transitions 3/57 dead transitions. [2025-04-14 00:45:31,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 57 transitions, 273 flow [2025-04-14 00:45:31,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 00:45:31,639 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-04-14 00:45:31,640 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 5 states and 73 transitions. [2025-04-14 00:45:31,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 57 transitions, 273 flow [2025-04-14 00:45:31,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 57 transitions, 243 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 00:45:31,649 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 95 flow [2025-04-14 00:45:31,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=32} [2025-04-14 00:45:31,654 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-04-14 00:45:31,654 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 95 flow [2025-04-14 00:45:31,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:31,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:31,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:31,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:45:31,655 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:45:31,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1806192109, now seen corresponding path program 2 times [2025-04-14 00:45:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:31,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303802369] [2025-04-14 00:45:31,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:45:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:31,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:45:31,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:45:31,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:31,887 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:45:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:31,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303802369] [2025-04-14 00:45:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303802369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:31,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:31,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032569096] [2025-04-14 00:45:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:31,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:31,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:31,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:31,889 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:31,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 32 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:31,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:31,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:32,161 INFO L116 PetriNetUnfolderBase]: 433/651 cut-off events. [2025-04-14 00:45:32,161 INFO L117 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-04-14 00:45:32,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1566 conditions, 651 events. 433/651 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2280 event pairs, 168 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 1352. Up to 409 conditions per place. [2025-04-14 00:45:32,165 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 59 selfloop transitions, 5 changer transitions 2/66 dead transitions. [2025-04-14 00:45:32,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 323 flow [2025-04-14 00:45:32,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:32,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 00:45:32,166 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-14 00:45:32,166 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 95 flow. Second operand 5 states and 79 transitions. [2025-04-14 00:45:32,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 323 flow [2025-04-14 00:45:32,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 314 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:32,169 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 128 flow [2025-04-14 00:45:32,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-04-14 00:45:32,169 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-04-14 00:45:32,169 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 128 flow [2025-04-14 00:45:32,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:32,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:32,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:32,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:45:32,170 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:45:32,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash 809158245, now seen corresponding path program 3 times [2025-04-14 00:45:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:32,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611163189] [2025-04-14 00:45:32,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:32,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:45:32,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:45:32,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:32,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:32,343 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:45:32,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:32,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611163189] [2025-04-14 00:45:32,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611163189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:32,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:32,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:32,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225308168] [2025-04-14 00:45:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:32,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:32,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:32,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:32,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:32,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:32,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:32,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:32,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:32,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:32,624 INFO L116 PetriNetUnfolderBase]: 508/794 cut-off events. [2025-04-14 00:45:32,624 INFO L117 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-04-14 00:45:32,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2143 conditions, 794 events. 508/794 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3034 event pairs, 244 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 1624. Up to 555 conditions per place. [2025-04-14 00:45:32,631 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 60 selfloop transitions, 6 changer transitions 2/68 dead transitions. [2025-04-14 00:45:32,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 68 transitions, 375 flow [2025-04-14 00:45:32,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:32,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:32,633 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 128 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:32,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 68 transitions, 375 flow [2025-04-14 00:45:32,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 68 transitions, 365 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:32,637 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 180 flow [2025-04-14 00:45:32,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-14 00:45:32,638 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-04-14 00:45:32,638 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 180 flow [2025-04-14 00:45:32,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:32,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:32,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:32,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:45:32,638 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:45:32,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash -874239013, now seen corresponding path program 4 times [2025-04-14 00:45:32,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:32,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962431441] [2025-04-14 00:45:32,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:32,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-14 00:45:32,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 17 statements. [2025-04-14 00:45:32,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:45:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:32,751 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:45:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:32,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962431441] [2025-04-14 00:45:32,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962431441] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:32,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:32,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345126334] [2025-04-14 00:45:32,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:32,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:32,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:32,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:32,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:32,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:32,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:32,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:32,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:32,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:32,989 INFO L116 PetriNetUnfolderBase]: 557/857 cut-off events. [2025-04-14 00:45:32,989 INFO L117 PetriNetUnfolderBase]: For 1323/1323 co-relation queries the response was YES. [2025-04-14 00:45:32,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2565 conditions, 857 events. 557/857 cut-off events. For 1323/1323 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3294 event pairs, 233 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 1917. Up to 501 conditions per place. [2025-04-14 00:45:32,993 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 58 selfloop transitions, 15 changer transitions 1/74 dead transitions. [2025-04-14 00:45:32,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 454 flow [2025-04-14 00:45:32,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-14 00:45:32,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-14 00:45:32,994 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 180 flow. Second operand 5 states and 81 transitions. [2025-04-14 00:45:32,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 454 flow [2025-04-14 00:45:32,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 441 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:32,998 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 288 flow [2025-04-14 00:45:32,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-04-14 00:45:33,003 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2025-04-14 00:45:33,003 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 288 flow [2025-04-14 00:45:33,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:33,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:33,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:33,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:45:33,003 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:45:33,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1030803285, now seen corresponding path program 5 times [2025-04-14 00:45:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:33,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855591872] [2025-04-14 00:45:33,004 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:33,010 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:45:33,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:45:33,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:33,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:33,130 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:45:33,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:33,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855591872] [2025-04-14 00:45:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855591872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:33,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:33,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:33,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344775379] [2025-04-14 00:45:33,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:33,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:33,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:33,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:33,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:33,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:33,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:33,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:33,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:33,356 INFO L116 PetriNetUnfolderBase]: 599/930 cut-off events. [2025-04-14 00:45:33,356 INFO L117 PetriNetUnfolderBase]: For 2640/2640 co-relation queries the response was YES. [2025-04-14 00:45:33,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 930 events. 599/930 cut-off events. For 2640/2640 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3682 event pairs, 244 based on Foata normal form. 1/878 useless extension candidates. Maximal degree in co-relation 2429. Up to 613 conditions per place. [2025-04-14 00:45:33,360 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 65 selfloop transitions, 14 changer transitions 2/81 dead transitions. [2025-04-14 00:45:33,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 604 flow [2025-04-14 00:45:33,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 00:45:33,362 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-14 00:45:33,362 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 288 flow. Second operand 5 states and 79 transitions. [2025-04-14 00:45:33,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 604 flow [2025-04-14 00:45:33,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 576 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:33,375 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 391 flow [2025-04-14 00:45:33,375 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2025-04-14 00:45:33,377 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2025-04-14 00:45:33,377 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 391 flow [2025-04-14 00:45:33,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:33,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:33,377 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:33,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:45:33,378 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:45:33,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -245307031, now seen corresponding path program 6 times [2025-04-14 00:45:33,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:33,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38930765] [2025-04-14 00:45:33,379 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:33,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:45:33,396 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:45:33,396 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:45:33,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:33,521 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:45:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:33,521 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38930765] [2025-04-14 00:45:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38930765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:33,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:33,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298650081] [2025-04-14 00:45:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:33,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:33,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:33,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:33,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:33,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 391 flow. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:33,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:33,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:33,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:33,744 INFO L116 PetriNetUnfolderBase]: 601/928 cut-off events. [2025-04-14 00:45:33,745 INFO L117 PetriNetUnfolderBase]: For 3639/3639 co-relation queries the response was YES. [2025-04-14 00:45:33,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3542 conditions, 928 events. 601/928 cut-off events. For 3639/3639 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3593 event pairs, 266 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 2771. Up to 721 conditions per place. [2025-04-14 00:45:33,750 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 73 selfloop transitions, 6 changer transitions 5/84 dead transitions. [2025-04-14 00:45:33,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 694 flow [2025-04-14 00:45:33,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 00:45:33,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-04-14 00:45:33,753 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 391 flow. Second operand 5 states and 73 transitions. [2025-04-14 00:45:33,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 694 flow [2025-04-14 00:45:33,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 667 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:33,761 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 403 flow [2025-04-14 00:45:33,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-04-14 00:45:33,761 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 31 predicate places. [2025-04-14 00:45:33,761 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 403 flow [2025-04-14 00:45:33,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:33,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:33,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:33,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:45:33,762 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:45:33,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash -271064167, now seen corresponding path program 1 times [2025-04-14 00:45:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:33,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668663] [2025-04-14 00:45:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:33,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:33,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:33,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:33,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:33,980 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:45:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:33,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34668663] [2025-04-14 00:45:33,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34668663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:33,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:33,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185945972] [2025-04-14 00:45:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:33,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:45:33,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:33,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:45:33,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:45:33,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:33,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:45:33,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:33,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:34,236 INFO L116 PetriNetUnfolderBase]: 960/1458 cut-off events. [2025-04-14 00:45:34,237 INFO L117 PetriNetUnfolderBase]: For 5652/5652 co-relation queries the response was YES. [2025-04-14 00:45:34,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 1458 events. 960/1458 cut-off events. For 5652/5652 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6274 event pairs, 239 based on Foata normal form. 57/1509 useless extension candidates. Maximal degree in co-relation 5593. Up to 637 conditions per place. [2025-04-14 00:45:34,243 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 85 selfloop transitions, 14 changer transitions 29/128 dead transitions. [2025-04-14 00:45:34,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 1147 flow [2025-04-14 00:45:34,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-04-14 00:45:34,246 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-04-14 00:45:34,246 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 403 flow. Second operand 6 states and 101 transitions. [2025-04-14 00:45:34,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 1147 flow [2025-04-14 00:45:34,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 128 transitions, 1126 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:34,259 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 506 flow [2025-04-14 00:45:34,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-04-14 00:45:34,259 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2025-04-14 00:45:34,259 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 506 flow [2025-04-14 00:45:34,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:45:34,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:34,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:34,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:45:34,260 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:45:34,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1519707169, now seen corresponding path program 1 times [2025-04-14 00:45:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:34,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408768517] [2025-04-14 00:45:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:34,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:34,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:34,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:34,420 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:45:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:34,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408768517] [2025-04-14 00:45:34,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408768517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:34,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:34,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:45:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771179976] [2025-04-14 00:45:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:34,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:45:34,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:34,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:45:34,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:45:34,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:34,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 506 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:45:34,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:34,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:34,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:34,733 INFO L116 PetriNetUnfolderBase]: 1171/1772 cut-off events. [2025-04-14 00:45:34,733 INFO L117 PetriNetUnfolderBase]: For 8147/8147 co-relation queries the response was YES. [2025-04-14 00:45:34,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7798 conditions, 1772 events. 1171/1772 cut-off events. For 8147/8147 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7842 event pairs, 214 based on Foata normal form. 78/1839 useless extension candidates. Maximal degree in co-relation 7575. Up to 651 conditions per place. [2025-04-14 00:45:34,744 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 90 selfloop transitions, 18 changer transitions 48/156 dead transitions. [2025-04-14 00:45:34,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 156 transitions, 1560 flow [2025-04-14 00:45:34,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:45:34,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:45:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-04-14 00:45:34,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-04-14 00:45:34,745 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 506 flow. Second operand 8 states and 117 transitions. [2025-04-14 00:45:34,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 156 transitions, 1560 flow [2025-04-14 00:45:34,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 156 transitions, 1492 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-14 00:45:34,761 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 609 flow [2025-04-14 00:45:34,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=609, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-04-14 00:45:34,763 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2025-04-14 00:45:34,763 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 609 flow [2025-04-14 00:45:34,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:45:34,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:34,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:34,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:45:34,763 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:45:34,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:34,764 INFO L85 PathProgramCache]: Analyzing trace with hash 273435633, now seen corresponding path program 1 times [2025-04-14 00:45:34,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:34,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606846963] [2025-04-14 00:45:34,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:34,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:34,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:34,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:34,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:34,865 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:45:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:34,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606846963] [2025-04-14 00:45:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606846963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162499771] [2025-04-14 00:45:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:34,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:34,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:34,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 609 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:34,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:34,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:35,092 INFO L116 PetriNetUnfolderBase]: 882/1363 cut-off events. [2025-04-14 00:45:35,092 INFO L117 PetriNetUnfolderBase]: For 7418/7418 co-relation queries the response was YES. [2025-04-14 00:45:35,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6085 conditions, 1363 events. 882/1363 cut-off events. For 7418/7418 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5565 event pairs, 213 based on Foata normal form. 1/1356 useless extension candidates. Maximal degree in co-relation 6021. Up to 636 conditions per place. [2025-04-14 00:45:35,100 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 96 selfloop transitions, 13 changer transitions 4/113 dead transitions. [2025-04-14 00:45:35,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 1155 flow [2025-04-14 00:45:35,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:35,101 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:35,101 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 609 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:35,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 1155 flow [2025-04-14 00:45:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 1115 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 00:45:35,113 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 723 flow [2025-04-14 00:45:35,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=723, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-04-14 00:45:35,114 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2025-04-14 00:45:35,114 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 723 flow [2025-04-14 00:45:35,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:35,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:35,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:45:35,115 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:45:35,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -157415681, now seen corresponding path program 2 times [2025-04-14 00:45:35,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:35,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831445612] [2025-04-14 00:45:35,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:45:35,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:35,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:35,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:35,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:35,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:35,214 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:45:35,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:35,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831445612] [2025-04-14 00:45:35,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831445612] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:35,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:35,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:35,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118694941] [2025-04-14 00:45:35,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:35,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:35,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:35,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:35,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:35,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:35,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 723 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:35,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:35,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:35,452 INFO L116 PetriNetUnfolderBase]: 863/1340 cut-off events. [2025-04-14 00:45:35,452 INFO L117 PetriNetUnfolderBase]: For 8960/8960 co-relation queries the response was YES. [2025-04-14 00:45:35,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6019 conditions, 1340 events. 863/1340 cut-off events. For 8960/8960 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5495 event pairs, 326 based on Foata normal form. 1/1335 useless extension candidates. Maximal degree in co-relation 5692. Up to 837 conditions per place. [2025-04-14 00:45:35,460 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 79 selfloop transitions, 16 changer transitions 9/104 dead transitions. [2025-04-14 00:45:35,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 1036 flow [2025-04-14 00:45:35,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-14 00:45:35,460 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-14 00:45:35,461 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 723 flow. Second operand 5 states and 78 transitions. [2025-04-14 00:45:35,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 1036 flow [2025-04-14 00:45:35,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 104 transitions, 1009 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:35,473 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 704 flow [2025-04-14 00:45:35,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=704, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2025-04-14 00:45:35,473 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-04-14 00:45:35,473 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 704 flow [2025-04-14 00:45:35,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:35,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:35,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:45:35,474 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:45:35,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1169392979, now seen corresponding path program 3 times [2025-04-14 00:45:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:35,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280082732] [2025-04-14 00:45:35,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:35,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:35,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:35,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:35,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:35,555 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:45:35,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:35,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280082732] [2025-04-14 00:45:35,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280082732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:35,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:35,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:35,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161198785] [2025-04-14 00:45:35,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:35,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:35,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:35,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:35,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:35,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:35,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 704 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:35,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:35,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:35,792 INFO L116 PetriNetUnfolderBase]: 858/1328 cut-off events. [2025-04-14 00:45:35,792 INFO L117 PetriNetUnfolderBase]: For 8976/8976 co-relation queries the response was YES. [2025-04-14 00:45:35,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 1328 events. 858/1328 cut-off events. For 8976/8976 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5377 event pairs, 313 based on Foata normal form. 1/1323 useless extension candidates. Maximal degree in co-relation 5963. Up to 837 conditions per place. [2025-04-14 00:45:35,799 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 82 selfloop transitions, 18 changer transitions 8/108 dead transitions. [2025-04-14 00:45:35,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 108 transitions, 1100 flow [2025-04-14 00:45:35,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-14 00:45:35,801 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-14 00:45:35,801 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 704 flow. Second operand 5 states and 81 transitions. [2025-04-14 00:45:35,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 108 transitions, 1100 flow [2025-04-14 00:45:35,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 108 transitions, 1062 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:45:35,811 INFO L231 Difference]: Finished difference. Result has 83 places, 73 transitions, 688 flow [2025-04-14 00:45:35,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=688, PETRI_PLACES=83, PETRI_TRANSITIONS=73} [2025-04-14 00:45:35,812 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-04-14 00:45:35,812 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 73 transitions, 688 flow [2025-04-14 00:45:35,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:35,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:35,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:45:35,813 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:45:35,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -372234101, now seen corresponding path program 4 times [2025-04-14 00:45:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:35,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770367943] [2025-04-14 00:45:35,813 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:35,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 00:45:35,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-04-14 00:45:35,821 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:45:35,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:35,868 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:45:35,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:35,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770367943] [2025-04-14 00:45:35,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770367943] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:35,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:35,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:35,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979363236] [2025-04-14 00:45:35,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:35,869 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:35,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:35,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:35,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:35,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:35,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 73 transitions, 688 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:35,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:35,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:35,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:36,107 INFO L116 PetriNetUnfolderBase]: 831/1285 cut-off events. [2025-04-14 00:45:36,107 INFO L117 PetriNetUnfolderBase]: For 9063/9063 co-relation queries the response was YES. [2025-04-14 00:45:36,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5893 conditions, 1285 events. 831/1285 cut-off events. For 9063/9063 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5161 event pairs, 340 based on Foata normal form. 1/1280 useless extension candidates. Maximal degree in co-relation 5602. Up to 956 conditions per place. [2025-04-14 00:45:36,117 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 81 selfloop transitions, 8 changer transitions 11/100 dead transitions. [2025-04-14 00:45:36,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 988 flow [2025-04-14 00:45:36,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-14 00:45:36,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-04-14 00:45:36,119 INFO L175 Difference]: Start difference. First operand has 83 places, 73 transitions, 688 flow. Second operand 5 states and 76 transitions. [2025-04-14 00:45:36,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 988 flow [2025-04-14 00:45:36,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 100 transitions, 950 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-04-14 00:45:36,134 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 602 flow [2025-04-14 00:45:36,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=602, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2025-04-14 00:45:36,135 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2025-04-14 00:45:36,135 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 602 flow [2025-04-14 00:45:36,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:36,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:36,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:36,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:45:36,137 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:45:36,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 369662911, now seen corresponding path program 5 times [2025-04-14 00:45:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:36,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037336927] [2025-04-14 00:45:36,138 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:36,145 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:36,152 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:36,152 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:36,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:45:36,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:36,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037336927] [2025-04-14 00:45:36,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037336927] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:36,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:36,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345585645] [2025-04-14 00:45:36,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:36,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:36,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:36,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:36,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:36,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:36,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 602 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:36,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:36,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:36,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:36,520 INFO L116 PetriNetUnfolderBase]: 829/1289 cut-off events. [2025-04-14 00:45:36,520 INFO L117 PetriNetUnfolderBase]: For 8236/8236 co-relation queries the response was YES. [2025-04-14 00:45:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5809 conditions, 1289 events. 829/1289 cut-off events. For 8236/8236 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5198 event pairs, 227 based on Foata normal form. 1/1284 useless extension candidates. Maximal degree in co-relation 5746. Up to 608 conditions per place. [2025-04-14 00:45:36,530 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 92 selfloop transitions, 7 changer transitions 5/104 dead transitions. [2025-04-14 00:45:36,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 104 transitions, 1030 flow [2025-04-14 00:45:36,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:36,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:36,535 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 602 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:36,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 104 transitions, 1030 flow [2025-04-14 00:45:36,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 992 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-14 00:45:36,547 INFO L231 Difference]: Finished difference. Result has 84 places, 73 transitions, 657 flow [2025-04-14 00:45:36,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=657, PETRI_PLACES=84, PETRI_TRANSITIONS=73} [2025-04-14 00:45:36,548 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2025-04-14 00:45:36,548 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 73 transitions, 657 flow [2025-04-14 00:45:36,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:36,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:36,548 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:36,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:45:36,548 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:45:36,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1002391083, now seen corresponding path program 6 times [2025-04-14 00:45:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:36,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-14 00:45:36,549 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:36,555 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:45:36,564 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:45:36,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:45:36,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:36,646 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:45:36,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:36,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032185133] [2025-04-14 00:45:36,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032185133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:36,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:36,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250273194] [2025-04-14 00:45:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:36,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:36,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:36,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:36,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:36,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 73 transitions, 657 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:36,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:36,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:36,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:36,903 INFO L116 PetriNetUnfolderBase]: 818/1270 cut-off events. [2025-04-14 00:45:36,903 INFO L117 PetriNetUnfolderBase]: For 9077/9077 co-relation queries the response was YES. [2025-04-14 00:45:36,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 1270 events. 818/1270 cut-off events. For 9077/9077 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5064 event pairs, 341 based on Foata normal form. 1/1265 useless extension candidates. Maximal degree in co-relation 4621. Up to 956 conditions per place. [2025-04-14 00:45:36,909 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 85 selfloop transitions, 11 changer transitions 7/103 dead transitions. [2025-04-14 00:45:36,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 103 transitions, 993 flow [2025-04-14 00:45:36,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-14 00:45:36,910 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-14 00:45:36,910 INFO L175 Difference]: Start difference. First operand has 84 places, 73 transitions, 657 flow. Second operand 5 states and 78 transitions. [2025-04-14 00:45:36,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 103 transitions, 993 flow [2025-04-14 00:45:36,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 103 transitions, 976 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:36,921 INFO L231 Difference]: Finished difference. Result has 89 places, 73 transitions, 637 flow [2025-04-14 00:45:36,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=637, PETRI_PLACES=89, PETRI_TRANSITIONS=73} [2025-04-14 00:45:36,922 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2025-04-14 00:45:36,922 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 73 transitions, 637 flow [2025-04-14 00:45:36,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:45:36,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:36,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:36,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:45:36,923 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:45:36,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1345399367, now seen corresponding path program 1 times [2025-04-14 00:45:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:36,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729182315] [2025-04-14 00:45:36,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:36,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:36,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:45:36,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:45:36,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:36,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:37,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729182315] [2025-04-14 00:45:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729182315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378062091] [2025-04-14 00:45:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:37,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:37,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:37,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:37,018 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:37,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 73 transitions, 637 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:37,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:37,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:37,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:37,246 INFO L116 PetriNetUnfolderBase]: 845/1335 cut-off events. [2025-04-14 00:45:37,246 INFO L117 PetriNetUnfolderBase]: For 9884/9884 co-relation queries the response was YES. [2025-04-14 00:45:37,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 1335 events. 845/1335 cut-off events. For 9884/9884 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5752 event pairs, 206 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 4960. Up to 670 conditions per place. [2025-04-14 00:45:37,253 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 103 selfloop transitions, 14 changer transitions 2/119 dead transitions. [2025-04-14 00:45:37,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 1199 flow [2025-04-14 00:45:37,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-14 00:45:37,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-04-14 00:45:37,254 INFO L175 Difference]: Start difference. First operand has 89 places, 73 transitions, 637 flow. Second operand 5 states and 83 transitions. [2025-04-14 00:45:37,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 1199 flow [2025-04-14 00:45:37,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 119 transitions, 1161 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:37,268 INFO L231 Difference]: Finished difference. Result has 93 places, 81 transitions, 805 flow [2025-04-14 00:45:37,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=805, PETRI_PLACES=93, PETRI_TRANSITIONS=81} [2025-04-14 00:45:37,269 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-14 00:45:37,269 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 81 transitions, 805 flow [2025-04-14 00:45:37,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:37,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:37,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:37,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:45:37,269 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:45:37,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash 41889491, now seen corresponding path program 2 times [2025-04-14 00:45:37,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:37,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74024534] [2025-04-14 00:45:37,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:45:37,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:37,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:37,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:37,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:37,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:37,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74024534] [2025-04-14 00:45:37,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74024534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:37,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:37,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:37,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407314297] [2025-04-14 00:45:37,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:37,370 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:37,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:37,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:37,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:37,371 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:37,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 81 transitions, 805 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:37,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:37,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:37,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:37,606 INFO L116 PetriNetUnfolderBase]: 843/1335 cut-off events. [2025-04-14 00:45:37,606 INFO L117 PetriNetUnfolderBase]: For 10682/10682 co-relation queries the response was YES. [2025-04-14 00:45:37,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6397 conditions, 1335 events. 843/1335 cut-off events. For 10682/10682 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5595 event pairs, 344 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 6041. Up to 956 conditions per place. [2025-04-14 00:45:37,613 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 93 selfloop transitions, 20 changer transitions 2/115 dead transitions. [2025-04-14 00:45:37,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 1209 flow [2025-04-14 00:45:37,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-14 00:45:37,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-14 00:45:37,614 INFO L175 Difference]: Start difference. First operand has 93 places, 81 transitions, 805 flow. Second operand 5 states and 80 transitions. [2025-04-14 00:45:37,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 1209 flow [2025-04-14 00:45:37,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 115 transitions, 1184 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:37,630 INFO L231 Difference]: Finished difference. Result has 99 places, 84 transitions, 900 flow [2025-04-14 00:45:37,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=900, PETRI_PLACES=99, PETRI_TRANSITIONS=84} [2025-04-14 00:45:37,631 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-04-14 00:45:37,631 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 900 flow [2025-04-14 00:45:37,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:37,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:37,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:37,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:45:37,631 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:45:37,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1646586377, now seen corresponding path program 3 times [2025-04-14 00:45:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:37,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663005676] [2025-04-14 00:45:37,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:37,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:37,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:37,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:37,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:37,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663005676] [2025-04-14 00:45:37,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663005676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:37,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:37,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:37,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193534393] [2025-04-14 00:45:37,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:37,708 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:37,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:37,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:37,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:37,709 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:37,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 900 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:37,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:37,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:37,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:38,012 INFO L116 PetriNetUnfolderBase]: 985/1581 cut-off events. [2025-04-14 00:45:38,012 INFO L117 PetriNetUnfolderBase]: For 13826/13826 co-relation queries the response was YES. [2025-04-14 00:45:38,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7674 conditions, 1581 events. 985/1581 cut-off events. For 13826/13826 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7269 event pairs, 127 based on Foata normal form. 1/1576 useless extension candidates. Maximal degree in co-relation 7329. Up to 464 conditions per place. [2025-04-14 00:45:38,020 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 121 selfloop transitions, 30 changer transitions 3/154 dead transitions. [2025-04-14 00:45:38,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 154 transitions, 1727 flow [2025-04-14 00:45:38,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:38,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-14 00:45:38,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-04-14 00:45:38,021 INFO L175 Difference]: Start difference. First operand has 99 places, 84 transitions, 900 flow. Second operand 6 states and 105 transitions. [2025-04-14 00:45:38,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 154 transitions, 1727 flow [2025-04-14 00:45:38,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 154 transitions, 1699 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:38,040 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 1177 flow [2025-04-14 00:45:38,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1177, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2025-04-14 00:45:38,040 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2025-04-14 00:45:38,040 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 1177 flow [2025-04-14 00:45:38,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:38,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:38,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 00:45:38,041 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:45:38,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1611471297, now seen corresponding path program 4 times [2025-04-14 00:45:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:38,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025643237] [2025-04-14 00:45:38,041 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:38,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:38,047 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:38,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-14 00:45:38,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:45:38,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:38,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025643237] [2025-04-14 00:45:38,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025643237] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:38,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:38,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:38,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551803533] [2025-04-14 00:45:38,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:38,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:38,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:38,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:38,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:38,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 1177 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:38,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:38,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:38,400 INFO L116 PetriNetUnfolderBase]: 987/1588 cut-off events. [2025-04-14 00:45:38,400 INFO L117 PetriNetUnfolderBase]: For 15734/15734 co-relation queries the response was YES. [2025-04-14 00:45:38,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8197 conditions, 1588 events. 987/1588 cut-off events. For 15734/15734 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7243 event pairs, 111 based on Foata normal form. 1/1583 useless extension candidates. Maximal degree in co-relation 7888. Up to 545 conditions per place. [2025-04-14 00:45:38,409 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 115 selfloop transitions, 47 changer transitions 3/165 dead transitions. [2025-04-14 00:45:38,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 165 transitions, 2107 flow [2025-04-14 00:45:38,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-04-14 00:45:38,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:45:38,410 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 1177 flow. Second operand 6 states and 99 transitions. [2025-04-14 00:45:38,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 165 transitions, 2107 flow [2025-04-14 00:45:38,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 165 transitions, 2028 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:38,444 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 1462 flow [2025-04-14 00:45:38,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2025-04-14 00:45:38,445 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-14 00:45:38,445 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 1462 flow [2025-04-14 00:45:38,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:38,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:38,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 00:45:38,445 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:45:38,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -651940551, now seen corresponding path program 5 times [2025-04-14 00:45:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:38,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198696392] [2025-04-14 00:45:38,447 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:38,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:38,466 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:45:38,466 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:45:38,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:38,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:38,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198696392] [2025-04-14 00:45:38,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198696392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042660995] [2025-04-14 00:45:38,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:38,544 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:38,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:38,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:38,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:38,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 1462 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:38,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:38,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:38,781 INFO L116 PetriNetUnfolderBase]: 975/1568 cut-off events. [2025-04-14 00:45:38,782 INFO L117 PetriNetUnfolderBase]: For 16597/16597 co-relation queries the response was YES. [2025-04-14 00:45:38,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8353 conditions, 1568 events. 975/1568 cut-off events. For 16597/16597 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7086 event pairs, 331 based on Foata normal form. 1/1563 useless extension candidates. Maximal degree in co-relation 8025. Up to 1195 conditions per place. [2025-04-14 00:45:38,790 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 106 selfloop transitions, 23 changer transitions 4/133 dead transitions. [2025-04-14 00:45:38,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 133 transitions, 1829 flow [2025-04-14 00:45:38,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 00:45:38,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-14 00:45:38,791 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 1462 flow. Second operand 5 states and 75 transitions. [2025-04-14 00:45:38,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 133 transitions, 1829 flow [2025-04-14 00:45:38,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 133 transitions, 1790 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:38,825 INFO L231 Difference]: Finished difference. Result has 119 places, 106 transitions, 1426 flow [2025-04-14 00:45:38,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1426, PETRI_PLACES=119, PETRI_TRANSITIONS=106} [2025-04-14 00:45:38,826 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-04-14 00:45:38,826 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 106 transitions, 1426 flow [2025-04-14 00:45:38,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:38,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:38,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 00:45:38,826 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:45:38,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:38,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1556654683, now seen corresponding path program 6 times [2025-04-14 00:45:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:38,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958262952] [2025-04-14 00:45:38,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:38,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:38,834 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:38,839 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:38,839 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:45:38,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:38,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958262952] [2025-04-14 00:45:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958262952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437556818] [2025-04-14 00:45:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:38,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:38,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:38,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:38,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 106 transitions, 1426 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:38,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:38,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:38,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:39,156 INFO L116 PetriNetUnfolderBase]: 969/1550 cut-off events. [2025-04-14 00:45:39,156 INFO L117 PetriNetUnfolderBase]: For 16872/16872 co-relation queries the response was YES. [2025-04-14 00:45:39,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 1550 events. 969/1550 cut-off events. For 16872/16872 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6916 event pairs, 204 based on Foata normal form. 1/1545 useless extension candidates. Maximal degree in co-relation 8041. Up to 787 conditions per place. [2025-04-14 00:45:39,164 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 93 selfloop transitions, 38 changer transitions 5/136 dead transitions. [2025-04-14 00:45:39,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 136 transitions, 1907 flow [2025-04-14 00:45:39,164 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:45:39,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:45:39,165 INFO L175 Difference]: Start difference. First operand has 119 places, 106 transitions, 1426 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:45:39,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 136 transitions, 1907 flow [2025-04-14 00:45:39,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 136 transitions, 1836 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:45:39,196 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 1480 flow [2025-04-14 00:45:39,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1480, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2025-04-14 00:45:39,196 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 91 predicate places. [2025-04-14 00:45:39,196 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 1480 flow [2025-04-14 00:45:39,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:39,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:39,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:39,197 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 00:45:39,197 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:45:39,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:39,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1019373818, now seen corresponding path program 1 times [2025-04-14 00:45:39,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:39,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559619424] [2025-04-14 00:45:39,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:39,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:39,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 00:45:39,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:45:39,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:39,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:39,269 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559619424] [2025-04-14 00:45:39,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559619424] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:39,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:39,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027301764] [2025-04-14 00:45:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:39,270 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:39,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:39,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:39,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:39,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 1480 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:39,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:39,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:39,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:39,544 INFO L116 PetriNetUnfolderBase]: 1018/1649 cut-off events. [2025-04-14 00:45:39,545 INFO L117 PetriNetUnfolderBase]: For 18749/18749 co-relation queries the response was YES. [2025-04-14 00:45:39,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 1649 events. 1018/1649 cut-off events. For 18749/18749 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7665 event pairs, 300 based on Foata normal form. 1/1644 useless extension candidates. Maximal degree in co-relation 8602. Up to 1084 conditions per place. [2025-04-14 00:45:39,553 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 126 selfloop transitions, 15 changer transitions 2/143 dead transitions. [2025-04-14 00:45:39,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 143 transitions, 2002 flow [2025-04-14 00:45:39,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-14 00:45:39,554 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2025-04-14 00:45:39,554 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 1480 flow. Second operand 5 states and 82 transitions. [2025-04-14 00:45:39,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 143 transitions, 2002 flow [2025-04-14 00:45:39,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 143 transitions, 1930 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-14 00:45:39,587 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 1532 flow [2025-04-14 00:45:39,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1532, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-04-14 00:45:39,587 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2025-04-14 00:45:39,587 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 1532 flow [2025-04-14 00:45:39,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:39,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:39,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:39,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 00:45:39,588 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:45:39,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:39,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1009490086, now seen corresponding path program 2 times [2025-04-14 00:45:39,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:39,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009475150] [2025-04-14 00:45:39,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:45:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:39,594 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:39,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:39,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:39,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:39,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:39,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009475150] [2025-04-14 00:45:39,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009475150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:39,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:39,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:39,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912431189] [2025-04-14 00:45:39,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:39,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:39,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:39,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:39,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:39,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:39,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 109 transitions, 1532 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:39,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:39,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:39,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:39,956 INFO L116 PetriNetUnfolderBase]: 1007/1629 cut-off events. [2025-04-14 00:45:39,957 INFO L117 PetriNetUnfolderBase]: For 18086/18086 co-relation queries the response was YES. [2025-04-14 00:45:39,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 1629 events. 1007/1629 cut-off events. For 18086/18086 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7484 event pairs, 225 based on Foata normal form. 1/1624 useless extension candidates. Maximal degree in co-relation 8286. Up to 749 conditions per place. [2025-04-14 00:45:39,964 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 124 selfloop transitions, 20 changer transitions 2/146 dead transitions. [2025-04-14 00:45:39,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 146 transitions, 2091 flow [2025-04-14 00:45:39,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:39,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-14 00:45:39,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-14 00:45:39,965 INFO L175 Difference]: Start difference. First operand has 122 places, 109 transitions, 1532 flow. Second operand 5 states and 81 transitions. [2025-04-14 00:45:39,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 146 transitions, 2091 flow [2025-04-14 00:45:39,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 146 transitions, 2071 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:39,998 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 1690 flow [2025-04-14 00:45:39,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1690, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2025-04-14 00:45:39,999 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2025-04-14 00:45:39,999 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 1690 flow [2025-04-14 00:45:39,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:39,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:39,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:39,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 00:45:39,999 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:45:39,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2121111696, now seen corresponding path program 3 times [2025-04-14 00:45:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:40,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455963292] [2025-04-14 00:45:40,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:40,005 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:40,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:40,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:40,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:40,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455963292] [2025-04-14 00:45:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455963292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:40,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:40,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146046342] [2025-04-14 00:45:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:40,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:40,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:40,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:40,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:40,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 1690 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:40,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:40,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:40,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:40,333 INFO L116 PetriNetUnfolderBase]: 996/1609 cut-off events. [2025-04-14 00:45:40,334 INFO L117 PetriNetUnfolderBase]: For 18959/18959 co-relation queries the response was YES. [2025-04-14 00:45:40,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8762 conditions, 1609 events. 996/1609 cut-off events. For 18959/18959 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7390 event pairs, 305 based on Foata normal form. 1/1604 useless extension candidates. Maximal degree in co-relation 8430. Up to 1084 conditions per place. [2025-04-14 00:45:40,343 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 116 selfloop transitions, 21 changer transitions 4/141 dead transitions. [2025-04-14 00:45:40,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 141 transitions, 2081 flow [2025-04-14 00:45:40,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:40,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:40,344 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 1690 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:40,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 141 transitions, 2081 flow [2025-04-14 00:45:40,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 141 transitions, 2044 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-14 00:45:40,384 INFO L231 Difference]: Finished difference. Result has 130 places, 112 transitions, 1655 flow [2025-04-14 00:45:40,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1655, PETRI_PLACES=130, PETRI_TRANSITIONS=112} [2025-04-14 00:45:40,385 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 100 predicate places. [2025-04-14 00:45:40,385 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 112 transitions, 1655 flow [2025-04-14 00:45:40,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:40,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:40,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:40,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 00:45:40,385 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:45:40,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash -797676076, now seen corresponding path program 4 times [2025-04-14 00:45:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:40,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47877532] [2025-04-14 00:45:40,386 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:40,392 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:40,394 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-14 00:45:40,394 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:45:40,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:40,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47877532] [2025-04-14 00:45:40,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47877532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:40,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:40,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:40,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465238379] [2025-04-14 00:45:40,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:40,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:40,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:40,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:40,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:40,434 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:40,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 112 transitions, 1655 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:40,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:40,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:40,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:40,800 INFO L116 PetriNetUnfolderBase]: 1102/1788 cut-off events. [2025-04-14 00:45:40,800 INFO L117 PetriNetUnfolderBase]: For 19974/19974 co-relation queries the response was YES. [2025-04-14 00:45:40,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9635 conditions, 1788 events. 1102/1788 cut-off events. For 19974/19974 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8479 event pairs, 148 based on Foata normal form. 1/1783 useless extension candidates. Maximal degree in co-relation 9314. Up to 549 conditions per place. [2025-04-14 00:45:40,812 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 123 selfloop transitions, 43 changer transitions 3/169 dead transitions. [2025-04-14 00:45:40,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 169 transitions, 2399 flow [2025-04-14 00:45:40,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-14 00:45:40,814 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-04-14 00:45:40,814 INFO L175 Difference]: Start difference. First operand has 130 places, 112 transitions, 1655 flow. Second operand 6 states and 105 transitions. [2025-04-14 00:45:40,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 169 transitions, 2399 flow [2025-04-14 00:45:40,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 169 transitions, 2316 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-14 00:45:40,859 INFO L231 Difference]: Finished difference. Result has 133 places, 122 transitions, 1913 flow [2025-04-14 00:45:40,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1913, PETRI_PLACES=133, PETRI_TRANSITIONS=122} [2025-04-14 00:45:40,860 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2025-04-14 00:45:40,860 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 122 transitions, 1913 flow [2025-04-14 00:45:40,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:40,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:40,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:40,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 00:45:40,860 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:45:40,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -536054308, now seen corresponding path program 5 times [2025-04-14 00:45:40,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:40,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519364039] [2025-04-14 00:45:40,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:40,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:40,867 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:40,874 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 00:45:40,874 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:45:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:40,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:40,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519364039] [2025-04-14 00:45:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519364039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:40,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:40,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308139530] [2025-04-14 00:45:40,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:40,929 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:40,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:40,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:40,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:40,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:40,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 122 transitions, 1913 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:40,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:40,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:40,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:41,246 INFO L116 PetriNetUnfolderBase]: 1090/1767 cut-off events. [2025-04-14 00:45:41,246 INFO L117 PetriNetUnfolderBase]: For 21273/21273 co-relation queries the response was YES. [2025-04-14 00:45:41,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9757 conditions, 1767 events. 1090/1767 cut-off events. For 21273/21273 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8353 event pairs, 168 based on Foata normal form. 1/1762 useless extension candidates. Maximal degree in co-relation 9422. Up to 665 conditions per place. [2025-04-14 00:45:41,254 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 116 selfloop transitions, 54 changer transitions 3/173 dead transitions. [2025-04-14 00:45:41,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 173 transitions, 2600 flow [2025-04-14 00:45:41,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:41,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-04-14 00:45:41,255 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-04-14 00:45:41,255 INFO L175 Difference]: Start difference. First operand has 133 places, 122 transitions, 1913 flow. Second operand 6 states and 101 transitions. [2025-04-14 00:45:41,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 173 transitions, 2600 flow [2025-04-14 00:45:41,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 173 transitions, 2573 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:41,299 INFO L231 Difference]: Finished difference. Result has 140 places, 124 transitions, 2107 flow [2025-04-14 00:45:41,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2107, PETRI_PLACES=140, PETRI_TRANSITIONS=124} [2025-04-14 00:45:41,299 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2025-04-14 00:45:41,299 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 124 transitions, 2107 flow [2025-04-14 00:45:41,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:41,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:41,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:45:41,300 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 00:45:41,300 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:45:41,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1470964188, now seen corresponding path program 6 times [2025-04-14 00:45:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:41,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132062480] [2025-04-14 00:45:41,300 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:45:41,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:41,306 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-14 00:45:41,310 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-14 00:45:41,310 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:45:41,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:41,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:41,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132062480] [2025-04-14 00:45:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132062480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:41,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763351551] [2025-04-14 00:45:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:41,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:41,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:41,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:41,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:41,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:41,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 124 transitions, 2107 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:41,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:41,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:41,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:41,634 INFO L116 PetriNetUnfolderBase]: 1078/1746 cut-off events. [2025-04-14 00:45:41,634 INFO L117 PetriNetUnfolderBase]: For 24465/24465 co-relation queries the response was YES. [2025-04-14 00:45:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10159 conditions, 1746 events. 1078/1746 cut-off events. For 24465/24465 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8135 event pairs, 267 based on Foata normal form. 1/1741 useless extension candidates. Maximal degree in co-relation 9810. Up to 972 conditions per place. [2025-04-14 00:45:41,644 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 101 selfloop transitions, 45 changer transitions 5/151 dead transitions. [2025-04-14 00:45:41,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 151 transitions, 2579 flow [2025-04-14 00:45:41,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:45:41,646 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:45:41,646 INFO L175 Difference]: Start difference. First operand has 140 places, 124 transitions, 2107 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:45:41,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 151 transitions, 2579 flow [2025-04-14 00:45:41,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 151 transitions, 2490 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-14 00:45:41,700 INFO L231 Difference]: Finished difference. Result has 141 places, 124 transitions, 2170 flow [2025-04-14 00:45:41,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2170, PETRI_PLACES=141, PETRI_TRANSITIONS=124} [2025-04-14 00:45:41,700 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 111 predicate places. [2025-04-14 00:45:41,700 INFO L485 AbstractCegarLoop]: Abstraction has has 141 places, 124 transitions, 2170 flow [2025-04-14 00:45:41,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 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:45:41,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:41,700 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] [2025-04-14 00:45:41,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 00:45:41,701 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:45:41,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:41,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2006053525, now seen corresponding path program 1 times [2025-04-14 00:45:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:41,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040147821] [2025-04-14 00:45:41,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:45:41,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:41,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:45:41,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:45:41,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:45:41,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:41,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040147821] [2025-04-14 00:45:41,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040147821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:41,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:41,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933882335] [2025-04-14 00:45:41,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:41,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:45:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:41,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:45:41,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:45:41,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:41,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 124 transitions, 2170 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:41,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:41,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:41,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:41,995 INFO L116 PetriNetUnfolderBase]: 1014/1638 cut-off events. [2025-04-14 00:45:41,995 INFO L117 PetriNetUnfolderBase]: For 24747/24747 co-relation queries the response was YES. [2025-04-14 00:45:41,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9618 conditions, 1638 events. 1014/1638 cut-off events. For 24747/24747 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7491 event pairs, 147 based on Foata normal form. 13/1645 useless extension candidates. Maximal degree in co-relation 9295. Up to 889 conditions per place. [2025-04-14 00:45:42,003 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 106 selfloop transitions, 32 changer transitions 6/144 dead transitions. [2025-04-14 00:45:42,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 2492 flow [2025-04-14 00:45:42,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:42,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:42,004 INFO L175 Difference]: Start difference. First operand has 141 places, 124 transitions, 2170 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:42,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 2492 flow [2025-04-14 00:45:42,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 144 transitions, 2377 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-04-14 00:45:42,053 INFO L231 Difference]: Finished difference. Result has 136 places, 118 transitions, 1995 flow [2025-04-14 00:45:42,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1995, PETRI_PLACES=136, PETRI_TRANSITIONS=118} [2025-04-14 00:45:42,054 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2025-04-14 00:45:42,054 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 118 transitions, 1995 flow [2025-04-14 00:45:42,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:42,054 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:42,054 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] [2025-04-14 00:45:42,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 00:45:42,054 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:45:42,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1632655077, now seen corresponding path program 2 times [2025-04-14 00:45:42,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:42,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980363101] [2025-04-14 00:45:42,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:45:42,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:42,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:45:42,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 00:45:42,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:45:42,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:42,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:42,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980363101] [2025-04-14 00:45:42,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980363101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094878130] [2025-04-14 00:45:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:42,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:42,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:42,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:42,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:42,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 118 transitions, 1995 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:45:42,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:42,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:42,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:42,398 INFO L116 PetriNetUnfolderBase]: 1066/1736 cut-off events. [2025-04-14 00:45:42,398 INFO L117 PetriNetUnfolderBase]: For 21919/21919 co-relation queries the response was YES. [2025-04-14 00:45:42,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9630 conditions, 1736 events. 1066/1736 cut-off events. For 21919/21919 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8132 event pairs, 107 based on Foata normal form. 2/1732 useless extension candidates. Maximal degree in co-relation 8733. Up to 891 conditions per place. [2025-04-14 00:45:42,406 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 119 selfloop transitions, 31 changer transitions 12/162 dead transitions. [2025-04-14 00:45:42,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 162 transitions, 2633 flow [2025-04-14 00:45:42,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-04-14 00:45:42,407 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-14 00:45:42,407 INFO L175 Difference]: Start difference. First operand has 136 places, 118 transitions, 1995 flow. Second operand 6 states and 96 transitions. [2025-04-14 00:45:42,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 162 transitions, 2633 flow [2025-04-14 00:45:42,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 162 transitions, 2609 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-04-14 00:45:42,453 INFO L231 Difference]: Finished difference. Result has 145 places, 123 transitions, 2184 flow [2025-04-14 00:45:42,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2184, PETRI_PLACES=145, PETRI_TRANSITIONS=123} [2025-04-14 00:45:42,458 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-04-14 00:45:42,458 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 123 transitions, 2184 flow [2025-04-14 00:45:42,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:45:42,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:42,458 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] [2025-04-14 00:45:42,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 00:45:42,459 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:45:42,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1329612333, now seen corresponding path program 3 times [2025-04-14 00:45:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:42,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183220121] [2025-04-14 00:45:42,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:45:42,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:42,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:45:42,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 00:45:42,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:45:42,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:42,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183220121] [2025-04-14 00:45:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183220121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:42,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358502500] [2025-04-14 00:45:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:42,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:45:42,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:42,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:45:42,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:45:42,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:42,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 123 transitions, 2184 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:45:42,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:42,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:42,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:42,815 INFO L116 PetriNetUnfolderBase]: 1037/1709 cut-off events. [2025-04-14 00:45:42,815 INFO L117 PetriNetUnfolderBase]: For 22994/22994 co-relation queries the response was YES. [2025-04-14 00:45:42,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9673 conditions, 1709 events. 1037/1709 cut-off events. For 22994/22994 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8174 event pairs, 115 based on Foata normal form. 1/1704 useless extension candidates. Maximal degree in co-relation 9555. Up to 780 conditions per place. [2025-04-14 00:45:42,824 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 114 selfloop transitions, 34 changer transitions 12/160 dead transitions. [2025-04-14 00:45:42,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 160 transitions, 2671 flow [2025-04-14 00:45:42,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:45:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:45:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-04-14 00:45:42,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:45:42,826 INFO L175 Difference]: Start difference. First operand has 145 places, 123 transitions, 2184 flow. Second operand 6 states and 99 transitions. [2025-04-14 00:45:42,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 160 transitions, 2671 flow [2025-04-14 00:45:42,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 160 transitions, 2618 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-04-14 00:45:42,887 INFO L231 Difference]: Finished difference. Result has 148 places, 119 transitions, 2122 flow [2025-04-14 00:45:42,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2135, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2122, PETRI_PLACES=148, PETRI_TRANSITIONS=119} [2025-04-14 00:45:42,888 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2025-04-14 00:45:42,888 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 119 transitions, 2122 flow [2025-04-14 00:45:42,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:45:42,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:42,888 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] [2025-04-14 00:45:42,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 00:45:42,889 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:45:42,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1612238301, now seen corresponding path program 4 times [2025-04-14 00:45:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:42,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613464635] [2025-04-14 00:45:42,889 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:45:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:42,894 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:45:42,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 20 statements. [2025-04-14 00:45:42,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:45:42,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:45:42,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:42,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613464635] [2025-04-14 00:45:42,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613464635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:45:42,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:45:42,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:45:42,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728608428] [2025-04-14 00:45:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:42,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:45:42,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:42,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:45:42,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:45:42,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:42,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 119 transitions, 2122 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:42,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:42,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:42,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:43,135 INFO L116 PetriNetUnfolderBase]: 960/1592 cut-off events. [2025-04-14 00:45:43,135 INFO L117 PetriNetUnfolderBase]: For 23690/23690 co-relation queries the response was YES. [2025-04-14 00:45:43,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8972 conditions, 1592 events. 960/1592 cut-off events. For 23690/23690 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7513 event pairs, 322 based on Foata normal form. 11/1597 useless extension candidates. Maximal degree in co-relation 8858. Up to 1159 conditions per place. [2025-04-14 00:45:43,143 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 121 selfloop transitions, 16 changer transitions 4/141 dead transitions. [2025-04-14 00:45:43,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 141 transitions, 2411 flow [2025-04-14 00:45:43,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:45:43,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:45:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 00:45:43,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-14 00:45:43,145 INFO L175 Difference]: Start difference. First operand has 148 places, 119 transitions, 2122 flow. Second operand 5 states and 77 transitions. [2025-04-14 00:45:43,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 141 transitions, 2411 flow [2025-04-14 00:45:43,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 2317 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-14 00:45:43,194 INFO L231 Difference]: Finished difference. Result has 143 places, 114 transitions, 1937 flow [2025-04-14 00:45:43,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1937, PETRI_PLACES=143, PETRI_TRANSITIONS=114} [2025-04-14 00:45:43,195 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2025-04-14 00:45:43,195 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 114 transitions, 1937 flow [2025-04-14 00:45:43,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:45:43,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:45:43,195 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] [2025-04-14 00:45:43,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 00:45:43,195 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:45:43,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:45:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -367257239, now seen corresponding path program 5 times [2025-04-14 00:45:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:45:43,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306742199] [2025-04-14 00:45:43,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:45:43,201 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:45:43,206 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:45:43,206 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:45:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:45:43,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:45:43,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306742199] [2025-04-14 00:45:43,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306742199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:45:43,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930323246] [2025-04-14 00:45:43,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:45:43,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:45:43,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:45:43,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:45:43,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:45:43,392 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:45:43,414 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:45:43,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:45:43,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:45:43,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 00:45:43,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:45:43,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:45:43,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 81 [2025-04-14 00:45:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:45:43,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:45:44,154 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:45:44,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 183 [2025-04-14 00:45:44,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:45:44,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930323246] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 00:45:44,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 00:45:44,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 23 [2025-04-14 00:45:44,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502330257] [2025-04-14 00:45:44,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:45:44,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:45:44,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:45:44,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:45:44,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-04-14 00:45:44,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:45:44,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 114 transitions, 1937 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:45:44,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:45:44,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:45:44,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:45:49,335 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:45:57,414 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:01,498 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:05,515 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:09,535 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:13,542 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:17,846 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:21,864 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:25,938 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:46:26,100 INFO L116 PetriNetUnfolderBase]: 1989/3510 cut-off events. [2025-04-14 00:46:26,100 INFO L117 PetriNetUnfolderBase]: For 42973/42973 co-relation queries the response was YES. [2025-04-14 00:46:26,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18856 conditions, 3510 events. 1989/3510 cut-off events. For 42973/42973 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 21711 event pairs, 245 based on Foata normal form. 125/3628 useless extension candidates. Maximal degree in co-relation 17641. Up to 1077 conditions per place. [2025-04-14 00:46:26,117 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 243 selfloop transitions, 65 changer transitions 111/419 dead transitions. [2025-04-14 00:46:26,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 419 transitions, 6825 flow [2025-04-14 00:46:26,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 00:46:26,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-14 00:46:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 292 transitions. [2025-04-14 00:46:26,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2025-04-14 00:46:26,119 INFO L175 Difference]: Start difference. First operand has 143 places, 114 transitions, 1937 flow. Second operand 24 states and 292 transitions. [2025-04-14 00:46:26,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 419 transitions, 6825 flow [2025-04-14 00:46:26,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 419 transitions, 6746 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-04-14 00:46:26,225 INFO L231 Difference]: Finished difference. Result has 177 places, 157 transitions, 2958 flow [2025-04-14 00:46:26,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2958, PETRI_PLACES=177, PETRI_TRANSITIONS=157} [2025-04-14 00:46:26,225 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2025-04-14 00:46:26,225 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 157 transitions, 2958 flow [2025-04-14 00:46:26,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:46:26,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:26,226 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] [2025-04-14 00:46:26,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:46:26,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:26,426 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:46:26,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:26,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1625412226, now seen corresponding path program 1 times [2025-04-14 00:46:26,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:26,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858446987] [2025-04-14 00:46:26,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:26,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:46:26,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:46:26,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:26,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:46:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:26,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858446987] [2025-04-14 00:46:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858446987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:26,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867872397] [2025-04-14 00:46:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:26,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:46:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:26,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:46:26,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:46:26,472 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:26,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 157 transitions, 2958 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:26,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:26,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:26,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:26,855 INFO L116 PetriNetUnfolderBase]: 1513/2599 cut-off events. [2025-04-14 00:46:26,856 INFO L117 PetriNetUnfolderBase]: For 37889/37889 co-relation queries the response was YES. [2025-04-14 00:46:26,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15627 conditions, 2599 events. 1513/2599 cut-off events. For 37889/37889 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14542 event pairs, 445 based on Foata normal form. 22/2618 useless extension candidates. Maximal degree in co-relation 15023. Up to 1540 conditions per place. [2025-04-14 00:46:26,871 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 155 selfloop transitions, 27 changer transitions 6/188 dead transitions. [2025-04-14 00:46:26,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 188 transitions, 3415 flow [2025-04-14 00:46:26,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:26,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-14 00:46:26,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-04-14 00:46:26,872 INFO L175 Difference]: Start difference. First operand has 177 places, 157 transitions, 2958 flow. Second operand 5 states and 85 transitions. [2025-04-14 00:46:26,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 188 transitions, 3415 flow [2025-04-14 00:46:26,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 188 transitions, 3274 flow, removed 60 selfloop flow, removed 9 redundant places. [2025-04-14 00:46:26,986 INFO L231 Difference]: Finished difference. Result has 162 places, 150 transitions, 2722 flow [2025-04-14 00:46:26,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2768, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2722, PETRI_PLACES=162, PETRI_TRANSITIONS=150} [2025-04-14 00:46:26,986 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2025-04-14 00:46:26,986 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 150 transitions, 2722 flow [2025-04-14 00:46:26,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:26,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:26,986 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] [2025-04-14 00:46:26,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 00:46:26,987 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:46:26,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash -755482154, now seen corresponding path program 2 times [2025-04-14 00:46:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:26,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440058325] [2025-04-14 00:46:26,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:46:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:26,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:46:26,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 00:46:26,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:46:26,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:46:27,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:27,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440058325] [2025-04-14 00:46:27,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440058325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:27,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:27,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:27,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796874346] [2025-04-14 00:46:27,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:27,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:27,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:27,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:27,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:27,041 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:27,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 150 transitions, 2722 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:46:27,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:27,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:27,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:27,407 INFO L116 PetriNetUnfolderBase]: 1475/2519 cut-off events. [2025-04-14 00:46:27,408 INFO L117 PetriNetUnfolderBase]: For 32450/32450 co-relation queries the response was YES. [2025-04-14 00:46:27,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14382 conditions, 2519 events. 1475/2519 cut-off events. For 32450/32450 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 13842 event pairs, 552 based on Foata normal form. 4/2520 useless extension candidates. Maximal degree in co-relation 13367. Up to 1886 conditions per place. [2025-04-14 00:46:27,421 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 136 selfloop transitions, 12 changer transitions 23/171 dead transitions. [2025-04-14 00:46:27,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 171 transitions, 3128 flow [2025-04-14 00:46:27,421 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-14 00:46:27,422 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-04-14 00:46:27,422 INFO L175 Difference]: Start difference. First operand has 162 places, 150 transitions, 2722 flow. Second operand 5 states and 73 transitions. [2025-04-14 00:46:27,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 171 transitions, 3128 flow [2025-04-14 00:46:27,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 171 transitions, 3110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:46:27,513 INFO L231 Difference]: Finished difference. Result has 165 places, 140 transitions, 2528 flow [2025-04-14 00:46:27,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2704, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2528, PETRI_PLACES=165, PETRI_TRANSITIONS=140} [2025-04-14 00:46:27,513 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2025-04-14 00:46:27,513 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 140 transitions, 2528 flow [2025-04-14 00:46:27,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:46:27,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:27,513 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] [2025-04-14 00:46:27,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 00:46:27,514 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:46:27,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1138205174, now seen corresponding path program 3 times [2025-04-14 00:46:27,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:27,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473337429] [2025-04-14 00:46:27,514 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:46:27,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:27,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:46:27,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 00:46:27,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:46:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:46:27,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:27,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473337429] [2025-04-14 00:46:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473337429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:27,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:27,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028743480] [2025-04-14 00:46:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:27,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:46:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:27,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:46:27,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:46:27,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:27,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 140 transitions, 2528 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:27,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:27,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:27,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:27,852 INFO L116 PetriNetUnfolderBase]: 1307/2225 cut-off events. [2025-04-14 00:46:27,852 INFO L117 PetriNetUnfolderBase]: For 28219/28219 co-relation queries the response was YES. [2025-04-14 00:46:27,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12716 conditions, 2225 events. 1307/2225 cut-off events. For 28219/28219 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11886 event pairs, 200 based on Foata normal form. 20/2242 useless extension candidates. Maximal degree in co-relation 12556. Up to 1555 conditions per place. [2025-04-14 00:46:27,863 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 134 selfloop transitions, 19 changer transitions 1/154 dead transitions. [2025-04-14 00:46:27,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 154 transitions, 2814 flow [2025-04-14 00:46:27,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:46:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:46:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-14 00:46:27,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-04-14 00:46:27,864 INFO L175 Difference]: Start difference. First operand has 165 places, 140 transitions, 2528 flow. Second operand 4 states and 68 transitions. [2025-04-14 00:46:27,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 154 transitions, 2814 flow [2025-04-14 00:46:27,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 154 transitions, 2703 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-04-14 00:46:27,929 INFO L231 Difference]: Finished difference. Result has 151 places, 136 transitions, 2383 flow [2025-04-14 00:46:27,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2345, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2383, PETRI_PLACES=151, PETRI_TRANSITIONS=136} [2025-04-14 00:46:27,929 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2025-04-14 00:46:27,929 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 136 transitions, 2383 flow [2025-04-14 00:46:27,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:27,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:27,929 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] [2025-04-14 00:46:27,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-14 00:46:27,930 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:46:27,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:27,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1933606766, now seen corresponding path program 4 times [2025-04-14 00:46:27,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:27,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944157824] [2025-04-14 00:46:27,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:46:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:27,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:46:27,939 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 20 statements. [2025-04-14 00:46:27,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 00:46:27,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:46:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:27,952 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944157824] [2025-04-14 00:46:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944157824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:27,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453308901] [2025-04-14 00:46:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:27,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:46:27,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:27,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:46:27,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:46:27,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:27,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 136 transitions, 2383 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:27,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:27,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:27,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:28,191 INFO L116 PetriNetUnfolderBase]: 1159/1979 cut-off events. [2025-04-14 00:46:28,192 INFO L117 PetriNetUnfolderBase]: For 25294/25294 co-relation queries the response was YES. [2025-04-14 00:46:28,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11124 conditions, 1979 events. 1159/1979 cut-off events. For 25294/25294 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10318 event pairs, 113 based on Foata normal form. 54/2030 useless extension candidates. Maximal degree in co-relation 10134. Up to 1211 conditions per place. [2025-04-14 00:46:28,201 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 127 selfloop transitions, 27 changer transitions 2/156 dead transitions. [2025-04-14 00:46:28,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 156 transitions, 2662 flow [2025-04-14 00:46:28,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 00:46:28,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-14 00:46:28,202 INFO L175 Difference]: Start difference. First operand has 151 places, 136 transitions, 2383 flow. Second operand 5 states and 79 transitions. [2025-04-14 00:46:28,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 156 transitions, 2662 flow [2025-04-14 00:46:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 156 transitions, 2540 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-14 00:46:28,254 INFO L231 Difference]: Finished difference. Result has 147 places, 129 transitions, 2182 flow [2025-04-14 00:46:28,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2182, PETRI_PLACES=147, PETRI_TRANSITIONS=129} [2025-04-14 00:46:28,255 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2025-04-14 00:46:28,255 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 129 transitions, 2182 flow [2025-04-14 00:46:28,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 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:46:28,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:28,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] [2025-04-14 00:46:28,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 00:46:28,255 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:46:28,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1220046188, now seen corresponding path program 5 times [2025-04-14 00:46:28,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:28,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580551365] [2025-04-14 00:46:28,256 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:46:28,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:28,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 00:46:28,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:46:28,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:46:28,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:28,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 00:46:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:28,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580551365] [2025-04-14 00:46:28,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580551365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:28,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:28,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932832947] [2025-04-14 00:46:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:28,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:28,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:28,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:28,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:28,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:28,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 129 transitions, 2182 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:46:28,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:28,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:28,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:28,619 INFO L116 PetriNetUnfolderBase]: 1153/1964 cut-off events. [2025-04-14 00:46:28,619 INFO L117 PetriNetUnfolderBase]: For 22231/22231 co-relation queries the response was YES. [2025-04-14 00:46:28,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11008 conditions, 1964 events. 1153/1964 cut-off events. For 22231/22231 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10100 event pairs, 271 based on Foata normal form. 5/1966 useless extension candidates. Maximal degree in co-relation 10112. Up to 1038 conditions per place. [2025-04-14 00:46:28,629 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 113 selfloop transitions, 12 changer transitions 23/148 dead transitions. [2025-04-14 00:46:28,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 148 transitions, 2553 flow [2025-04-14 00:46:28,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:28,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-14 00:46:28,629 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-04-14 00:46:28,630 INFO L175 Difference]: Start difference. First operand has 147 places, 129 transitions, 2182 flow. Second operand 5 states and 70 transitions. [2025-04-14 00:46:28,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 148 transitions, 2553 flow [2025-04-14 00:46:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 148 transitions, 2481 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-14 00:46:28,672 INFO L231 Difference]: Finished difference. Result has 149 places, 115 transitions, 1914 flow [2025-04-14 00:46:28,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1914, PETRI_PLACES=149, PETRI_TRANSITIONS=115} [2025-04-14 00:46:28,672 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2025-04-14 00:46:28,672 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 115 transitions, 1914 flow [2025-04-14 00:46:28,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:46:28,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:28,672 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] [2025-04-14 00:46:28,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 00:46:28,672 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:46:28,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 416782984, now seen corresponding path program 1 times [2025-04-14 00:46:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:28,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815478233] [2025-04-14 00:46:28,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:28,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:46:28,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:46:28,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:28,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:28,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815478233] [2025-04-14 00:46:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815478233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:28,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612155314] [2025-04-14 00:46:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:28,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:28,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:28,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:28,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 115 transitions, 1914 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:28,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:28,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:29,014 INFO L116 PetriNetUnfolderBase]: 1008/1695 cut-off events. [2025-04-14 00:46:29,015 INFO L117 PetriNetUnfolderBase]: For 16600/16600 co-relation queries the response was YES. [2025-04-14 00:46:29,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9404 conditions, 1695 events. 1008/1695 cut-off events. For 16600/16600 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8403 event pairs, 119 based on Foata normal form. 2/1695 useless extension candidates. Maximal degree in co-relation 9344. Up to 1391 conditions per place. [2025-04-14 00:46:29,022 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 116 selfloop transitions, 12 changer transitions 13/141 dead transitions. [2025-04-14 00:46:29,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 2301 flow [2025-04-14 00:46:29,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:46:29,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:46:29,023 INFO L175 Difference]: Start difference. First operand has 149 places, 115 transitions, 1914 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:46:29,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 2301 flow [2025-04-14 00:46:29,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 141 transitions, 2115 flow, removed 26 selfloop flow, removed 12 redundant places. [2025-04-14 00:46:29,057 INFO L231 Difference]: Finished difference. Result has 128 places, 111 transitions, 1668 flow [2025-04-14 00:46:29,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1668, PETRI_PLACES=128, PETRI_TRANSITIONS=111} [2025-04-14 00:46:29,057 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2025-04-14 00:46:29,057 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 1668 flow [2025-04-14 00:46:29,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:29,057 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] [2025-04-14 00:46:29,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 00:46:29,058 INFO L403 AbstractCegarLoop]: === Iteration 38 === 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:46:29,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash 934682068, now seen corresponding path program 2 times [2025-04-14 00:46:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:29,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929224491] [2025-04-14 00:46:29,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:46:29,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:29,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:46:29,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 00:46:29,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:46:29,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:29,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929224491] [2025-04-14 00:46:29,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929224491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:29,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:29,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:29,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894240203] [2025-04-14 00:46:29,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:29,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:29,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:29,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:29,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:29,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 1668 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:29,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:29,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:29,343 INFO L116 PetriNetUnfolderBase]: 942/1583 cut-off events. [2025-04-14 00:46:29,344 INFO L117 PetriNetUnfolderBase]: For 11765/11765 co-relation queries the response was YES. [2025-04-14 00:46:29,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8308 conditions, 1583 events. 942/1583 cut-off events. For 11765/11765 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7547 event pairs, 85 based on Foata normal form. 2/1583 useless extension candidates. Maximal degree in co-relation 8257. Up to 1159 conditions per place. [2025-04-14 00:46:29,350 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 108 selfloop transitions, 14 changer transitions 15/137 dead transitions. [2025-04-14 00:46:29,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 137 transitions, 2050 flow [2025-04-14 00:46:29,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-14 00:46:29,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-14 00:46:29,351 INFO L175 Difference]: Start difference. First operand has 128 places, 111 transitions, 1668 flow. Second operand 5 states and 74 transitions. [2025-04-14 00:46:29,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 137 transitions, 2050 flow [2025-04-14 00:46:29,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 137 transitions, 2010 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:46:29,373 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 1593 flow [2025-04-14 00:46:29,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1593, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2025-04-14 00:46:29,373 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2025-04-14 00:46:29,373 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 1593 flow [2025-04-14 00:46:29,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:29,374 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] [2025-04-14 00:46:29,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 00:46:29,374 INFO L403 AbstractCegarLoop]: === Iteration 39 === 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:46:29,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:29,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1103378128, now seen corresponding path program 1 times [2025-04-14 00:46:29,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:29,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709908981] [2025-04-14 00:46:29,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:29,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:29,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 00:46:29,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 00:46:29,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:29,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:29,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:29,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709908981] [2025-04-14 00:46:29,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709908981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:29,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:29,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:29,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157305949] [2025-04-14 00:46:29,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:29,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:46:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:29,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:46:29,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:46:29,414 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:29,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 1593 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:46:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:29,581 INFO L116 PetriNetUnfolderBase]: 810/1347 cut-off events. [2025-04-14 00:46:29,582 INFO L117 PetriNetUnfolderBase]: For 10575/10575 co-relation queries the response was YES. [2025-04-14 00:46:29,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 1347 events. 810/1347 cut-off events. For 10575/10575 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6020 event pairs, 336 based on Foata normal form. 8/1353 useless extension candidates. Maximal degree in co-relation 7114. Up to 1207 conditions per place. [2025-04-14 00:46:29,587 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 97 selfloop transitions, 4 changer transitions 10/111 dead transitions. [2025-04-14 00:46:29,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 111 transitions, 1705 flow [2025-04-14 00:46:29,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:46:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:46:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-14 00:46:29,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-04-14 00:46:29,588 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 1593 flow. Second operand 4 states and 57 transitions. [2025-04-14 00:46:29,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 111 transitions, 1705 flow [2025-04-14 00:46:29,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 111 transitions, 1598 flow, removed 29 selfloop flow, removed 10 redundant places. [2025-04-14 00:46:29,605 INFO L231 Difference]: Finished difference. Result has 115 places, 93 transitions, 1232 flow [2025-04-14 00:46:29,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1339, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1232, PETRI_PLACES=115, PETRI_TRANSITIONS=93} [2025-04-14 00:46:29,606 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-14 00:46:29,606 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 93 transitions, 1232 flow [2025-04-14 00:46:29,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 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:46:29,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:29,606 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] [2025-04-14 00:46:29,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 00:46:29,606 INFO L403 AbstractCegarLoop]: === Iteration 40 === 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:46:29,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -51092686, now seen corresponding path program 2 times [2025-04-14 00:46:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:29,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822770319] [2025-04-14 00:46:29,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:46:29,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:29,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:46:29,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 00:46:29,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:46:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:29,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822770319] [2025-04-14 00:46:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822770319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:29,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192210315] [2025-04-14 00:46:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:29,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:29,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:29,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:29,655 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:29,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 93 transitions, 1232 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:29,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:29,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:29,845 INFO L116 PetriNetUnfolderBase]: 790/1307 cut-off events. [2025-04-14 00:46:29,845 INFO L117 PetriNetUnfolderBase]: For 7613/7613 co-relation queries the response was YES. [2025-04-14 00:46:29,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 1307 events. 790/1307 cut-off events. For 7613/7613 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5763 event pairs, 161 based on Foata normal form. 4/1309 useless extension candidates. Maximal degree in co-relation 6430. Up to 785 conditions per place. [2025-04-14 00:46:29,850 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 76 selfloop transitions, 10 changer transitions 26/112 dead transitions. [2025-04-14 00:46:29,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 1522 flow [2025-04-14 00:46:29,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-14 00:46:29,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2025-04-14 00:46:29,851 INFO L175 Difference]: Start difference. First operand has 115 places, 93 transitions, 1232 flow. Second operand 5 states and 67 transitions. [2025-04-14 00:46:29,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 1522 flow [2025-04-14 00:46:29,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 1473 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-14 00:46:29,862 INFO L231 Difference]: Finished difference. Result has 111 places, 76 transitions, 980 flow [2025-04-14 00:46:29,862 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=980, PETRI_PLACES=111, PETRI_TRANSITIONS=76} [2025-04-14 00:46:29,862 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 81 predicate places. [2025-04-14 00:46:29,862 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 76 transitions, 980 flow [2025-04-14 00:46:29,862 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:29,862 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] [2025-04-14 00:46:29,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-14 00:46:29,863 INFO L403 AbstractCegarLoop]: === Iteration 41 === 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:46:29,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:29,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1523043610, now seen corresponding path program 3 times [2025-04-14 00:46:29,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:29,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986917620] [2025-04-14 00:46:29,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:46:29,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:29,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 00:46:29,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 00:46:29,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:46:29,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:29,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:29,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986917620] [2025-04-14 00:46:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986917620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:46:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694009295] [2025-04-14 00:46:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:29,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:46:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:29,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:46:29,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:46:29,916 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:29,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 76 transitions, 980 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:29,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:29,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:29,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:30,093 INFO L116 PetriNetUnfolderBase]: 643/1017 cut-off events. [2025-04-14 00:46:30,093 INFO L117 PetriNetUnfolderBase]: For 4806/4806 co-relation queries the response was YES. [2025-04-14 00:46:30,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 1017 events. 643/1017 cut-off events. For 4806/4806 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4015 event pairs, 100 based on Foata normal form. 2/1018 useless extension candidates. Maximal degree in co-relation 4917. Up to 868 conditions per place. [2025-04-14 00:46:30,098 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 72 selfloop transitions, 6 changer transitions 15/93 dead transitions. [2025-04-14 00:46:30,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 1223 flow [2025-04-14 00:46:30,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:46:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:46:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-14 00:46:30,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-04-14 00:46:30,099 INFO L175 Difference]: Start difference. First operand has 111 places, 76 transitions, 980 flow. Second operand 5 states and 64 transitions. [2025-04-14 00:46:30,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 1223 flow [2025-04-14 00:46:30,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 1101 flow, removed 21 selfloop flow, removed 11 redundant places. [2025-04-14 00:46:30,107 INFO L231 Difference]: Finished difference. Result has 93 places, 72 transitions, 817 flow [2025-04-14 00:46:30,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=817, PETRI_PLACES=93, PETRI_TRANSITIONS=72} [2025-04-14 00:46:30,108 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-14 00:46:30,108 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 72 transitions, 817 flow [2025-04-14 00:46:30,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 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:46:30,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:30,108 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] [2025-04-14 00:46:30,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-14 00:46:30,108 INFO L403 AbstractCegarLoop]: === Iteration 42 === 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:46:30,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1861327945, now seen corresponding path program 1 times [2025-04-14 00:46:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:30,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775972844] [2025-04-14 00:46:30,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:30,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:46:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:31,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775972844] [2025-04-14 00:46:31,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775972844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:46:31,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059102853] [2025-04-14 00:46:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:31,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:31,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:46:31,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:46:31,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:46:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:46:31,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:31,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:31,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:31,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:46:31,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:46:32,188 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-14 00:46:32,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 282 [2025-04-14 00:46:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:32,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:46:33,474 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:46:33,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 213 treesize of output 374 [2025-04-14 00:46:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:41,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059102853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:46:41,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:46:41,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-14 00:46:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814728740] [2025-04-14 00:46:41,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:46:41,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 00:46:41,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:41,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 00:46:41,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 00:46:41,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:41,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 72 transitions, 817 flow. Second operand has 38 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 38 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:46:41,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:41,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:41,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:47,728 INFO L116 PetriNetUnfolderBase]: 3490/5447 cut-off events. [2025-04-14 00:46:47,728 INFO L117 PetriNetUnfolderBase]: For 20260/20260 co-relation queries the response was YES. [2025-04-14 00:46:47,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23367 conditions, 5447 events. 3490/5447 cut-off events. For 20260/20260 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 30336 event pairs, 251 based on Foata normal form. 5/5448 useless extension candidates. Maximal degree in co-relation 23201. Up to 1043 conditions per place. [2025-04-14 00:46:47,780 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 652 selfloop transitions, 254 changer transitions 18/924 dead transitions. [2025-04-14 00:46:47,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 924 transitions, 9928 flow [2025-04-14 00:46:47,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 00:46:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-04-14 00:46:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 857 transitions. [2025-04-14 00:46:47,782 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35094185094185093 [2025-04-14 00:46:47,782 INFO L175 Difference]: Start difference. First operand has 93 places, 72 transitions, 817 flow. Second operand 74 states and 857 transitions. [2025-04-14 00:46:47,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 924 transitions, 9928 flow [2025-04-14 00:46:47,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 924 transitions, 9844 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-04-14 00:46:47,808 INFO L231 Difference]: Finished difference. Result has 212 places, 340 transitions, 4711 flow [2025-04-14 00:46:47,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=4711, PETRI_PLACES=212, PETRI_TRANSITIONS=340} [2025-04-14 00:46:47,808 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2025-04-14 00:46:47,809 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 340 transitions, 4711 flow [2025-04-14 00:46:47,809 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 38 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:46:47,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:47,809 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] [2025-04-14 00:46:47,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 00:46:48,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-04-14 00:46:48,009 INFO L403 AbstractCegarLoop]: === Iteration 43 === 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:46:48,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 782140118, now seen corresponding path program 1 times [2025-04-14 00:46:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:48,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571216635] [2025-04-14 00:46:48,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:48,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:46:48,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:48,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:48,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 00:46:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:48,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571216635] [2025-04-14 00:46:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571216635] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:46:48,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52732630] [2025-04-14 00:46:48,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:46:48,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:48,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:46:48,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:46:48,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:46:48,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:46:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:46:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:48,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 00:46:48,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:46:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:48,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:46:48,496 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:46:48,497 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 88 [2025-04-14 00:46:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:48,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52732630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:46:48,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:46:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2025-04-14 00:46:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460919619] [2025-04-14 00:46:48,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:46:48,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 00:46:48,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:48,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 00:46:48,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-14 00:46:48,677 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:48,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 340 transitions, 4711 flow. Second operand has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:46:48,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:48,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:48,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:50,043 INFO L116 PetriNetUnfolderBase]: 3322/5278 cut-off events. [2025-04-14 00:46:50,043 INFO L117 PetriNetUnfolderBase]: For 95711/95711 co-relation queries the response was YES. [2025-04-14 00:46:50,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38521 conditions, 5278 events. 3322/5278 cut-off events. For 95711/95711 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 30138 event pairs, 527 based on Foata normal form. 260/5538 useless extension candidates. Maximal degree in co-relation 38243. Up to 1669 conditions per place. [2025-04-14 00:46:50,071 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 229 selfloop transitions, 64 changer transitions 267/560 dead transitions. [2025-04-14 00:46:50,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 560 transitions, 9021 flow [2025-04-14 00:46:50,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-14 00:46:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-14 00:46:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 281 transitions. [2025-04-14 00:46:50,072 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3041125541125541 [2025-04-14 00:46:50,072 INFO L175 Difference]: Start difference. First operand has 212 places, 340 transitions, 4711 flow. Second operand 28 states and 281 transitions. [2025-04-14 00:46:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 560 transitions, 9021 flow [2025-04-14 00:46:50,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 560 transitions, 8691 flow, removed 162 selfloop flow, removed 5 redundant places. [2025-04-14 00:46:50,397 INFO L231 Difference]: Finished difference. Result has 244 places, 234 transitions, 3252 flow [2025-04-14 00:46:50,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4407, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3252, PETRI_PLACES=244, PETRI_TRANSITIONS=234} [2025-04-14 00:46:50,398 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2025-04-14 00:46:50,398 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 234 transitions, 3252 flow [2025-04-14 00:46:50,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.954545454545454) internal successors, (131), 22 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:46:50,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:50,398 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] [2025-04-14 00:46:50,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 00:46:50,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:50,598 INFO L403 AbstractCegarLoop]: === Iteration 44 === 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:46:50,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:50,599 INFO L85 PathProgramCache]: Analyzing trace with hash 326848919, now seen corresponding path program 2 times [2025-04-14 00:46:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:50,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699783309] [2025-04-14 00:46:50,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:46:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:50,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:46:50,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 00:46:50,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:46:50,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:46:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:51,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699783309] [2025-04-14 00:46:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699783309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 00:46:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125268043] [2025-04-14 00:46:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:51,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:46:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:51,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:46:51,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:46:51,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:51,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 234 transitions, 3252 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:46:51,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:51,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:52,484 INFO L116 PetriNetUnfolderBase]: 3068/4610 cut-off events. [2025-04-14 00:46:52,485 INFO L117 PetriNetUnfolderBase]: For 105539/105539 co-relation queries the response was YES. [2025-04-14 00:46:52,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36501 conditions, 4610 events. 3068/4610 cut-off events. For 105539/105539 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 23551 event pairs, 151 based on Foata normal form. 4/4614 useless extension candidates. Maximal degree in co-relation 36417. Up to 1675 conditions per place. [2025-04-14 00:46:52,525 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 260 selfloop transitions, 323 changer transitions 3/586 dead transitions. [2025-04-14 00:46:52,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 586 transitions, 9381 flow [2025-04-14 00:46:52,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:46:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:46:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 190 transitions. [2025-04-14 00:46:52,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33868092691622104 [2025-04-14 00:46:52,527 INFO L175 Difference]: Start difference. First operand has 244 places, 234 transitions, 3252 flow. Second operand 17 states and 190 transitions. [2025-04-14 00:46:52,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 586 transitions, 9381 flow [2025-04-14 00:46:52,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 586 transitions, 8592 flow, removed 299 selfloop flow, removed 38 redundant places. [2025-04-14 00:46:52,766 INFO L231 Difference]: Finished difference. Result has 195 places, 488 transitions, 7747 flow [2025-04-14 00:46:52,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=3031, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7747, PETRI_PLACES=195, PETRI_TRANSITIONS=488} [2025-04-14 00:46:52,766 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 165 predicate places. [2025-04-14 00:46:52,766 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 488 transitions, 7747 flow [2025-04-14 00:46:52,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:46:52,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:52,767 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] [2025-04-14 00:46:52,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-14 00:46:52,767 INFO L403 AbstractCegarLoop]: === Iteration 45 === 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:46:52,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -39246363, now seen corresponding path program 3 times [2025-04-14 00:46:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:52,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194876128] [2025-04-14 00:46:52,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:46:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:52,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:46:52,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 00:46:52,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:46:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:53,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:46:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:53,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194876128] [2025-04-14 00:46:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194876128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:46:53,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:46:53,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 00:46:53,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373178243] [2025-04-14 00:46:53,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:46:53,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:46:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:46:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:46:53,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:46:53,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:46:53,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 488 transitions, 7747 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:46:53,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:46:53,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:46:53,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:46:54,531 INFO L116 PetriNetUnfolderBase]: 3559/5289 cut-off events. [2025-04-14 00:46:54,531 INFO L117 PetriNetUnfolderBase]: For 106409/106409 co-relation queries the response was YES. [2025-04-14 00:46:54,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43563 conditions, 5289 events. 3559/5289 cut-off events. For 106409/106409 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 26880 event pairs, 193 based on Foata normal form. 4/5293 useless extension candidates. Maximal degree in co-relation 43498. Up to 1755 conditions per place. [2025-04-14 00:46:54,563 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 301 selfloop transitions, 334 changer transitions 4/639 dead transitions. [2025-04-14 00:46:54,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 639 transitions, 11180 flow [2025-04-14 00:46:54,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:46:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:46:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 146 transitions. [2025-04-14 00:46:54,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31601731601731603 [2025-04-14 00:46:54,564 INFO L175 Difference]: Start difference. First operand has 195 places, 488 transitions, 7747 flow. Second operand 14 states and 146 transitions. [2025-04-14 00:46:54,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 639 transitions, 11180 flow [2025-04-14 00:46:55,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 639 transitions, 10103 flow, removed 498 selfloop flow, removed 5 redundant places. [2025-04-14 00:46:55,352 INFO L231 Difference]: Finished difference. Result has 209 places, 573 transitions, 9238 flow [2025-04-14 00:46:55,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=7113, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9238, PETRI_PLACES=209, PETRI_TRANSITIONS=573} [2025-04-14 00:46:55,353 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2025-04-14 00:46:55,353 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 573 transitions, 9238 flow [2025-04-14 00:46:55,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:46:55,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:46:55,353 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] [2025-04-14 00:46:55,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-14 00:46:55,354 INFO L403 AbstractCegarLoop]: === Iteration 46 === 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:46:55,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:46:55,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1814074395, now seen corresponding path program 4 times [2025-04-14 00:46:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:46:55,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311232323] [2025-04-14 00:46:55,354 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:46:55,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:46:55,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:46:55,381 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:55,381 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:46:55,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:46:56,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311232323] [2025-04-14 00:46:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311232323] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:46:56,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548850589] [2025-04-14 00:46:56,395 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:46:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:46:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:46:56,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:46:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 00:46:56,450 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:46:56,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:46:56,471 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:46:56,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:46:56,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:46:56,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:46:57,090 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-14 00:46:57,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 282 [2025-04-14 00:46:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:46:57,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:46:58,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:46:58,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 213 treesize of output 374 [2025-04-14 00:47:07,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:07,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548850589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:07,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:07,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-14 00:47:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114319503] [2025-04-14 00:47:07,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:07,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-14 00:47:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:07,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-14 00:47:07,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1197, Unknown=0, NotChecked=0, Total=1406 [2025-04-14 00:47:07,173 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:47:07,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 573 transitions, 9238 flow. Second operand has 38 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 38 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:47:07,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:07,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:47:07,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:11,331 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:17,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:21,733 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:23,004 INFO L116 PetriNetUnfolderBase]: 3656/5439 cut-off events. [2025-04-14 00:47:23,004 INFO L117 PetriNetUnfolderBase]: For 97866/97866 co-relation queries the response was YES. [2025-04-14 00:47:23,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43308 conditions, 5439 events. 3656/5439 cut-off events. For 97866/97866 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 27953 event pairs, 247 based on Foata normal form. 5/5444 useless extension candidates. Maximal degree in co-relation 43238. Up to 1124 conditions per place. [2025-04-14 00:47:23,038 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 660 selfloop transitions, 373 changer transitions 18/1051 dead transitions. [2025-04-14 00:47:23,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 1051 transitions, 17146 flow [2025-04-14 00:47:23,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-14 00:47:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-04-14 00:47:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 553 transitions. [2025-04-14 00:47:23,040 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32226107226107226 [2025-04-14 00:47:23,040 INFO L175 Difference]: Start difference. First operand has 209 places, 573 transitions, 9238 flow. Second operand 52 states and 553 transitions. [2025-04-14 00:47:23,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 1051 transitions, 17146 flow [2025-04-14 00:47:23,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1051 transitions, 16624 flow, removed 122 selfloop flow, removed 6 redundant places. [2025-04-14 00:47:23,418 INFO L231 Difference]: Finished difference. Result has 268 places, 608 transitions, 10326 flow [2025-04-14 00:47:23,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8911, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=339, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=10326, PETRI_PLACES=268, PETRI_TRANSITIONS=608} [2025-04-14 00:47:23,419 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 238 predicate places. [2025-04-14 00:47:23,419 INFO L485 AbstractCegarLoop]: Abstraction has has 268 places, 608 transitions, 10326 flow [2025-04-14 00:47:23,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.7368421052631575) internal successors, (180), 38 states have internal predecessors, (180), 0 states have call successors, (0), 0 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:47:23,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:47:23,419 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] [2025-04-14 00:47:23,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 00:47:23,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:23,620 INFO L403 AbstractCegarLoop]: === Iteration 47 === 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:47:23,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:47:23,620 INFO L85 PathProgramCache]: Analyzing trace with hash 141617879, now seen corresponding path program 5 times [2025-04-14 00:47:23,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:47:23,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684434628] [2025-04-14 00:47:23,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:47:23,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:47:23,626 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:47:23,641 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:47:23,641 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:23,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:24,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:47:24,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684434628] [2025-04-14 00:47:24,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684434628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:47:24,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877928796] [2025-04-14 00:47:24,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:47:24,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:47:24,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:47:24,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:47:24,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 00:47:24,478 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:47:24,503 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:47:24,503 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:47:24,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:47:24,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:47:24,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:47:25,183 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-14 00:47:25,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 282 [2025-04-14 00:47:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:25,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:47:26,098 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:47:26,099 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 210 treesize of output 371 [2025-04-14 00:47:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:47:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877928796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:47:33,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:47:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-04-14 00:47:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148715010] [2025-04-14 00:47:33,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:47:33,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 00:47:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:47:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 00:47:33,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 00:47:33,780 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:47:33,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 608 transitions, 10326 flow. Second operand has 37 states, 37 states have (on average 4.783783783783784) internal successors, (177), 37 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:47:33,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:47:33,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:47:33,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:47:40,823 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:44,925 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:50,368 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:55,834 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 00:47:58,066 INFO L116 PetriNetUnfolderBase]: 9566/14246 cut-off events. [2025-04-14 00:47:58,066 INFO L117 PetriNetUnfolderBase]: For 305652/305652 co-relation queries the response was YES. [2025-04-14 00:47:58,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118986 conditions, 14246 events. 9566/14246 cut-off events. For 305652/305652 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 85595 event pairs, 592 based on Foata normal form. 9/14255 useless extension candidates. Maximal degree in co-relation 118902. Up to 3429 conditions per place. [2025-04-14 00:47:58,190 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 1107 selfloop transitions, 887 changer transitions 24/2018 dead transitions. [2025-04-14 00:47:58,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 2018 transitions, 36331 flow [2025-04-14 00:47:58,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 00:47:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 00:47:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 678 transitions. [2025-04-14 00:47:58,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31608391608391606 [2025-04-14 00:47:58,192 INFO L175 Difference]: Start difference. First operand has 268 places, 608 transitions, 10326 flow. Second operand 65 states and 678 transitions. [2025-04-14 00:47:58,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 2018 transitions, 36331 flow [2025-04-14 00:48:00,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 2018 transitions, 34785 flow, removed 182 selfloop flow, removed 33 redundant places. [2025-04-14 00:48:00,830 INFO L231 Difference]: Finished difference. Result has 332 places, 1281 transitions, 24800 flow [2025-04-14 00:48:00,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9715, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=340, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=24800, PETRI_PLACES=332, PETRI_TRANSITIONS=1281} [2025-04-14 00:48:00,831 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 302 predicate places. [2025-04-14 00:48:00,831 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 1281 transitions, 24800 flow [2025-04-14 00:48:00,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.783783783783784) internal successors, (177), 37 states have internal predecessors, (177), 0 states have call successors, (0), 0 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:48:00,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:00,832 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] [2025-04-14 00:48:00,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 00:48:01,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-14 00:48:01,032 INFO L403 AbstractCegarLoop]: === Iteration 48 === 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:48:01,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1621423725, now seen corresponding path program 6 times [2025-04-14 00:48:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:01,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830527423] [2025-04-14 00:48:01,033 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 00:48:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:01,039 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 00:48:01,054 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 00:48:01,055 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 00:48:01,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 00:48:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:01,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830527423] [2025-04-14 00:48:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830527423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:48:01,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:48:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-14 00:48:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883748044] [2025-04-14 00:48:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:48:01,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 00:48:01,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:48:01,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 00:48:01,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-04-14 00:48:01,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-14 00:48:01,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1281 transitions, 24800 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:48:01,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:48:01,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-14 00:48:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:48:06,427 INFO L116 PetriNetUnfolderBase]: 11387/16655 cut-off events. [2025-04-14 00:48:06,427 INFO L117 PetriNetUnfolderBase]: For 502362/502362 co-relation queries the response was YES. [2025-04-14 00:48:06,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156709 conditions, 16655 events. 11387/16655 cut-off events. For 502362/502362 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 99237 event pairs, 511 based on Foata normal form. 9/16664 useless extension candidates. Maximal degree in co-relation 156592. Up to 3854 conditions per place. [2025-04-14 00:48:06,632 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 510 selfloop transitions, 1194 changer transitions 6/1710 dead transitions. [2025-04-14 00:48:06,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1710 transitions, 36283 flow [2025-04-14 00:48:06,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 00:48:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 00:48:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 202 transitions. [2025-04-14 00:48:06,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3600713012477718 [2025-04-14 00:48:06,633 INFO L175 Difference]: Start difference. First operand has 332 places, 1281 transitions, 24800 flow. Second operand 17 states and 202 transitions. [2025-04-14 00:48:06,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1710 transitions, 36283 flow [2025-04-14 00:48:12,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 1710 transitions, 34855 flow, removed 590 selfloop flow, removed 20 redundant places. [2025-04-14 00:48:12,248 INFO L231 Difference]: Finished difference. Result has 333 places, 1586 transitions, 33462 flow [2025-04-14 00:48:12,248 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=23680, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=892, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=33462, PETRI_PLACES=333, PETRI_TRANSITIONS=1586} [2025-04-14 00:48:12,249 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 303 predicate places. [2025-04-14 00:48:12,249 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 1586 transitions, 33462 flow [2025-04-14 00:48:12,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:48:12,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:48:12,249 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] [2025-04-14 00:48:12,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-14 00:48:12,249 INFO L403 AbstractCegarLoop]: === Iteration 49 === 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:48:12,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:48:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1387926911, now seen corresponding path program 7 times [2025-04-14 00:48:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:48:12,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688848991] [2025-04-14 00:48:12,250 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:48:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:48:12,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:48:12,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:48:12,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:48:12,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:48:13,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688848991] [2025-04-14 00:48:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688848991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:48:13,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216706366] [2025-04-14 00:48:13,007 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 00:48:13,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:48:13,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:48:13,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:48:13,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 00:48:13,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:48:13,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:48:13,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:48:13,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:48:13,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 00:48:13,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:48:13,748 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-14 00:48:13,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 282 [2025-04-14 00:48:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:48:14,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:48:18,974 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:48:18,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 306 treesize of output 768 [2025-04-14 00:51:02,297 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-14 00:51:02,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-14 00:51:02,298 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-14 00:51:02,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 00:51:02,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-14 00:51:02,500 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2025-04-14 00:51:02,503 INFO L158 Benchmark]: Toolchain (without parser) took 332967.37ms. Allocated memory was 113.2MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 78.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-14 00:51:02,503 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:02,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.97ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 62.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 00:51:02,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.56ms. Allocated memory is still 113.2MB. Free memory was 62.1MB in the beginning and 60.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:51:02,503 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 113.2MB. Free memory was 60.2MB in the beginning and 57.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:02,504 INFO L158 Benchmark]: IcfgBuilder took 746.79ms. Allocated memory is still 113.2MB. Free memory was 57.9MB in the beginning and 72.4MB in the end (delta: -14.5MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. [2025-04-14 00:51:02,504 INFO L158 Benchmark]: TraceAbstraction took 331852.97ms. Allocated memory was 113.2MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 72.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-14 00:51:02,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 288.97ms. Allocated memory is still 113.2MB. Free memory was 78.2MB in the beginning and 62.1MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.56ms. Allocated memory is still 113.2MB. Free memory was 62.1MB in the beginning and 60.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 113.2MB. Free memory was 60.2MB in the beginning and 57.9MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 746.79ms. Allocated memory is still 113.2MB. Free memory was 57.9MB in the beginning and 72.4MB in the end (delta: -14.5MB). Peak memory consumption was 45.2MB. Max. memory is 8.0GB. * TraceAbstraction took 331852.97ms. Allocated memory was 113.2MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 72.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...