/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -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-13 20:06:01,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:06:01,273 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-13 20:06:01,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:06:01,280 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:06:01,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:06:01,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:06:01,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:06:01,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:06:01,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:06:01,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:06:01,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:06:01,305 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:06:01,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:06:01,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:06:01,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:06:01,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:06:01,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:06:01,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:06:01,307 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 [2025-04-13 20:06:01,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:06:01,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:06:01,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:06:01,540 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:06:01,542 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:06:01,543 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-13 20:06:02,856 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc8bf8e5/202eab3061f748dc97f2418c6f8e2d32/FLAG1b3a31422 [2025-04-13 20:06:03,045 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:06:03,046 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2025-04-13 20:06:03,053 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc8bf8e5/202eab3061f748dc97f2418c6f8e2d32/FLAG1b3a31422 [2025-04-13 20:06:03,857 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fc8bf8e5/202eab3061f748dc97f2418c6f8e2d32 [2025-04-13 20:06:03,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:06:03,860 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:06:03,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:06:03,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:06:03,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:06:03,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:06:03" (1/1) ... [2025-04-13 20:06:03,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df525b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:03, skipping insertion in model container [2025-04-13 20:06:03,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:06:03" (1/1) ... [2025-04-13 20:06:03,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:06:04,040 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-13 20:06:04,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:06:04,062 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:06:04,101 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-13 20:06:04,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:06:04,122 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:06:04,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04 WrapperNode [2025-04-13 20:06:04,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:06:04,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:06:04,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:06:04,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:06:04,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,162 INFO L138 Inliner]: procedures = 24, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 156 [2025-04-13 20:06:04,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:06:04,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:06:04,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:06:04,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:06:04,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,181 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-13 20:06:04,181 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,186 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:06:04,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:06:04,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:06:04,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:06:04,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (1/1) ... [2025-04-13 20:06:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:06:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:06:04,231 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-13 20:06:04,233 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-13 20:06:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:06:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:06:04,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:06:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:06:04,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:06:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:06:04,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:06:04,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:06:04,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:06:04,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:06:04,252 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:06:04,336 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:06:04,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:06:04,621 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:06:04,622 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:06:04,622 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:06:04,915 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:06:04,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:06:04 BoogieIcfgContainer [2025-04-13 20:06:04,915 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:06:04,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:06:04,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:06:04,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:06:04,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:06:03" (1/3) ... [2025-04-13 20:06:04,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:06:04, skipping insertion in model container [2025-04-13 20:06:04,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:06:04" (2/3) ... [2025-04-13 20:06:04,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0f4a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:06:04, skipping insertion in model container [2025-04-13 20:06:04,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:06:04" (3/3) ... [2025-04-13 20:06:04,921 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2025-04-13 20:06:04,932 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:06:04,933 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-13 20:06:04,933 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:06:04,998 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:06:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 20:06:05,042 INFO L116 PetriNetUnfolderBase]: 9/30 cut-off events. [2025-04-13 20:06:05,044 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:06:05,045 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 23 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-13 20:06:05,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 87 flow [2025-04-13 20:06:05,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 29 transitions, 76 flow [2025-04-13 20:06:05,055 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:06:05,065 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;@6c5b409c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:06:05,065 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:06:05,076 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:06:05,076 INFO L116 PetriNetUnfolderBase]: 9/28 cut-off events. [2025-04-13 20:06:05,077 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:06:05,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:05,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:05,077 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-13 20:06:05,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1628556698, now seen corresponding path program 1 times [2025-04-13 20:06:05,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:05,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117419597] [2025-04-13 20:06:05,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:05,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:06:05,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:06:05,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:05,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:06:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:05,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117419597] [2025-04-13 20:06:05,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117419597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:05,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:05,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006292289] [2025-04-13 20:06:05,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:05,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:05,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:05,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:05,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:05,587 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-13 20:06:05,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:05,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:05,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:05,862 INFO L116 PetriNetUnfolderBase]: 371/532 cut-off events. [2025-04-13 20:06:05,862 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-13 20:06:05,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 532 events. 371/532 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1557 event pairs, 124 based on Foata normal form. 1/326 useless extension candidates. Maximal degree in co-relation 864. Up to 348 conditions per place. [2025-04-13 20:06:05,868 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 57 selfloop transitions, 4 changer transitions 2/63 dead transitions. [2025-04-13 20:06:05,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 63 transitions, 306 flow [2025-04-13 20:06:05,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-13 20:06:05,881 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-13 20:06:05,882 INFO L175 Difference]: Start difference. First operand has 30 places, 29 transitions, 76 flow. Second operand 5 states and 79 transitions. [2025-04-13 20:06:05,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 63 transitions, 306 flow [2025-04-13 20:06:05,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:06:05,890 INFO L231 Difference]: Finished difference. Result has 31 places, 32 transitions, 95 flow [2025-04-13 20:06:05,892 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-13 20:06:05,894 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-04-13 20:06:05,895 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 32 transitions, 95 flow [2025-04-13 20:06:05,895 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-13 20:06:05,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:05,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:05,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:06:05,895 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-13 20:06:05,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -145991608, now seen corresponding path program 2 times [2025-04-13 20:06:05,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:05,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849069671] [2025-04-13 20:06:05,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:05,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:05,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:06:05,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:06:05,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:05,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:06,080 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-13 20:06:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:06,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849069671] [2025-04-13 20:06:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849069671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:06,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:06,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152490043] [2025-04-13 20:06:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:06,081 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:06,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:06,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:06,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:06,082 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:06,082 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-13 20:06:06,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:06,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:06,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:06,319 INFO L116 PetriNetUnfolderBase]: 484/729 cut-off events. [2025-04-13 20:06:06,319 INFO L117 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-04-13 20:06:06,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 729 events. 484/729 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2570 event pairs, 183 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 1479. Up to 451 conditions per place. [2025-04-13 20:06:06,328 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 54 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2025-04-13 20:06:06,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 325 flow [2025-04-13 20:06:06,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-13 20:06:06,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-04-13 20:06:06,329 INFO L175 Difference]: Start difference. First operand has 31 places, 32 transitions, 95 flow. Second operand 5 states and 79 transitions. [2025-04-13 20:06:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 325 flow [2025-04-13 20:06:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 316 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:06,332 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 174 flow [2025-04-13 20:06:06,334 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=37, PETRI_TRANSITIONS=39} [2025-04-13 20:06:06,335 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-04-13 20:06:06,335 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 174 flow [2025-04-13 20:06:06,335 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-13 20:06:06,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:06,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:06,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:06:06,336 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-13 20:06:06,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash -128693724, now seen corresponding path program 3 times [2025-04-13 20:06:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:06,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360369781] [2025-04-13 20:06:06,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:06,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:06:06,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:06:06,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:06,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:06,507 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-13 20:06:06,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:06,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360369781] [2025-04-13 20:06:06,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360369781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:06,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911221401] [2025-04-13 20:06:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:06,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:06,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:06,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:06,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:06,508 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:06,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 174 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-13 20:06:06,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:06,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:06,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:06,748 INFO L116 PetriNetUnfolderBase]: 544/826 cut-off events. [2025-04-13 20:06:06,748 INFO L117 PetriNetUnfolderBase]: For 899/899 co-relation queries the response was YES. [2025-04-13 20:06:06,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 826 events. 544/826 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3165 event pairs, 177 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 1959. Up to 481 conditions per place. [2025-04-13 20:06:06,753 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 63 selfloop transitions, 14 changer transitions 1/78 dead transitions. [2025-04-13 20:06:06,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 78 transitions, 480 flow [2025-04-13 20:06:06,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:06,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 20:06:06,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-13 20:06:06,753 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 174 flow. Second operand 5 states and 81 transitions. [2025-04-13 20:06:06,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 78 transitions, 480 flow [2025-04-13 20:06:06,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 78 transitions, 465 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:06,757 INFO L231 Difference]: Finished difference. Result has 43 places, 49 transitions, 302 flow [2025-04-13 20:06:06,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=43, PETRI_TRANSITIONS=49} [2025-04-13 20:06:06,758 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-04-13 20:06:06,758 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 49 transitions, 302 flow [2025-04-13 20:06:06,758 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-13 20:06:06,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:06,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:06,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:06:06,758 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-13 20:06:06,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 800612226, now seen corresponding path program 4 times [2025-04-13 20:06:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:06,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068818540] [2025-04-13 20:06:06,759 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:06:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:06,766 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:06:06,770 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 17 statements. [2025-04-13 20:06:06,770 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:06:06,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:06,850 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-13 20:06:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:06,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068818540] [2025-04-13 20:06:06,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068818540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228820869] [2025-04-13 20:06:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:06,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:06,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:06,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:06,851 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:06,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 302 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-13 20:06:06,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:06,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:06,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:07,079 INFO L116 PetriNetUnfolderBase]: 609/952 cut-off events. [2025-04-13 20:06:07,079 INFO L117 PetriNetUnfolderBase]: For 1777/1777 co-relation queries the response was YES. [2025-04-13 20:06:07,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3191 conditions, 952 events. 609/952 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3840 event pairs, 151 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 2414. Up to 428 conditions per place. [2025-04-13 20:06:07,084 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 57 selfloop transitions, 25 changer transitions 1/83 dead transitions. [2025-04-13 20:06:07,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 623 flow [2025-04-13 20:06:07,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:07,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:07,085 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 302 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:07,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 623 flow [2025-04-13 20:06:07,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 599 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:07,097 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 441 flow [2025-04-13 20:06:07,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=441, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2025-04-13 20:06:07,098 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2025-04-13 20:06:07,098 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 441 flow [2025-04-13 20:06:07,098 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-13 20:06:07,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:07,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:07,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:06:07,099 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-13 20:06:07,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash -413784032, now seen corresponding path program 5 times [2025-04-13 20:06:07,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:07,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983110608] [2025-04-13 20:06:07,100 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:07,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:07,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:06:07,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:06:07,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:07,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:07,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:06:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:07,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983110608] [2025-04-13 20:06:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983110608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:07,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912471433] [2025-04-13 20:06:07,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:07,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:07,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:07,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:07,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:07,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 441 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-13 20:06:07,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:07,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:07,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:07,494 INFO L116 PetriNetUnfolderBase]: 609/951 cut-off events. [2025-04-13 20:06:07,494 INFO L117 PetriNetUnfolderBase]: For 2515/2515 co-relation queries the response was YES. [2025-04-13 20:06:07,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3616 conditions, 951 events. 609/951 cut-off events. For 2515/2515 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3816 event pairs, 248 based on Foata normal form. 1/905 useless extension candidates. Maximal degree in co-relation 3411. Up to 605 conditions per place. [2025-04-13 20:06:07,499 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 72 selfloop transitions, 10 changer transitions 2/84 dead transitions. [2025-04-13 20:06:07,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 720 flow [2025-04-13 20:06:07,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:07,501 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:07,501 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 441 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:07,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 720 flow [2025-04-13 20:06:07,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 671 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:07,509 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 432 flow [2025-04-13 20:06:07,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2025-04-13 20:06:07,512 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2025-04-13 20:06:07,512 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 432 flow [2025-04-13 20:06:07,512 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-13 20:06:07,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:07,512 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:07,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:06:07,513 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-13 20:06:07,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1950735436, now seen corresponding path program 6 times [2025-04-13 20:06:07,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:07,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058992016] [2025-04-13 20:06:07,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:06:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:07,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:06:07,529 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:06:07,529 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:06:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:07,661 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-13 20:06:07,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:07,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058992016] [2025-04-13 20:06:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058992016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:07,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:07,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:07,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253464435] [2025-04-13 20:06:07,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:07,661 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:07,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:07,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:07,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:07,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 432 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-13 20:06:07,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:07,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:07,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:07,898 INFO L116 PetriNetUnfolderBase]: 611/950 cut-off events. [2025-04-13 20:06:07,899 INFO L117 PetriNetUnfolderBase]: For 2879/2879 co-relation queries the response was YES. [2025-04-13 20:06:07,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 950 events. 611/950 cut-off events. For 2879/2879 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3756 event pairs, 248 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 3428. Up to 730 conditions per place. [2025-04-13 20:06:07,905 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 82 selfloop transitions, 6 changer transitions 6/94 dead transitions. [2025-04-13 20:06:07,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 836 flow [2025-04-13 20:06:07,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-13 20:06:07,907 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44242424242424244 [2025-04-13 20:06:07,907 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 432 flow. Second operand 5 states and 73 transitions. [2025-04-13 20:06:07,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 836 flow [2025-04-13 20:06:07,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 94 transitions, 814 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:07,915 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 472 flow [2025-04-13 20:06:07,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=472, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2025-04-13 20:06:07,915 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2025-04-13 20:06:07,916 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 472 flow [2025-04-13 20:06:07,916 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-13 20:06:07,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:07,916 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-13 20:06:07,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:06:07,916 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-13 20:06:07,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash -413780329, now seen corresponding path program 1 times [2025-04-13 20:06:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:07,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286926500] [2025-04-13 20:06:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:07,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:07,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:07,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:07,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:08,139 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-13 20:06:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:08,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286926500] [2025-04-13 20:06:08,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286926500] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:08,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:08,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:08,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202468806] [2025-04-13 20:06:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:08,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:06:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:08,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:06:08,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:06:08,141 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:08,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 472 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-13 20:06:08,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:08,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:08,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:08,373 INFO L116 PetriNetUnfolderBase]: 974/1481 cut-off events. [2025-04-13 20:06:08,374 INFO L117 PetriNetUnfolderBase]: For 5938/5938 co-relation queries the response was YES. [2025-04-13 20:06:08,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 1481 events. 974/1481 cut-off events. For 5938/5938 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6487 event pairs, 172 based on Foata normal form. 59/1534 useless extension candidates. Maximal degree in co-relation 4958. Up to 646 conditions per place. [2025-04-13 20:06:08,380 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 93 selfloop transitions, 16 changer transitions 30/139 dead transitions. [2025-04-13 20:06:08,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 1285 flow [2025-04-13 20:06:08,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-04-13 20:06:08,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-04-13 20:06:08,381 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 472 flow. Second operand 6 states and 101 transitions. [2025-04-13 20:06:08,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 1285 flow [2025-04-13 20:06:08,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 139 transitions, 1266 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:08,389 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 600 flow [2025-04-13 20:06:08,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-04-13 20:06:08,390 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2025-04-13 20:06:08,390 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 600 flow [2025-04-13 20:06:08,390 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-13 20:06:08,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:08,390 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-13 20:06:08,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:06:08,390 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-13 20:06:08,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:08,391 INFO L85 PathProgramCache]: Analyzing trace with hash 947496943, now seen corresponding path program 1 times [2025-04-13 20:06:08,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:08,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827756169] [2025-04-13 20:06:08,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:08,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:08,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:08,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:08,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:08,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:08,575 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-13 20:06:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:08,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827756169] [2025-04-13 20:06:08,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827756169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:08,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:08,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:06:08,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566208200] [2025-04-13 20:06:08,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:08,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:06:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:06:08,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:06:08,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:08,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 600 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-13 20:06:08,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:08,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:08,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:08,870 INFO L116 PetriNetUnfolderBase]: 1183/1791 cut-off events. [2025-04-13 20:06:08,870 INFO L117 PetriNetUnfolderBase]: For 8856/8856 co-relation queries the response was YES. [2025-04-13 20:06:08,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 1791 events. 1183/1791 cut-off events. For 8856/8856 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7793 event pairs, 242 based on Foata normal form. 78/1858 useless extension candidates. Maximal degree in co-relation 7855. Up to 670 conditions per place. [2025-04-13 20:06:08,881 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 94 selfloop transitions, 20 changer transitions 48/162 dead transitions. [2025-04-13 20:06:08,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 162 transitions, 1742 flow [2025-04-13 20:06:08,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:06:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:06:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-04-13 20:06:08,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2025-04-13 20:06:08,882 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 600 flow. Second operand 8 states and 117 transitions. [2025-04-13 20:06:08,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 162 transitions, 1742 flow [2025-04-13 20:06:08,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 162 transitions, 1663 flow, removed 12 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:08,898 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 721 flow [2025-04-13 20:06:08,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=721, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2025-04-13 20:06:08,899 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2025-04-13 20:06:08,899 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 721 flow [2025-04-13 20:06:08,899 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-13 20:06:08,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:08,899 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-13 20:06:08,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:06:08,899 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-13 20:06:08,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:08,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1662807295, now seen corresponding path program 1 times [2025-04-13 20:06:08,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:08,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535518905] [2025-04-13 20:06:08,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:08,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:08,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:08,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:08,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:08,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:09,015 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-13 20:06:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:09,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535518905] [2025-04-13 20:06:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535518905] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278201818] [2025-04-13 20:06:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:09,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:09,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:09,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:09,016 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:09,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 721 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-13 20:06:09,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:09,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:09,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:09,267 INFO L116 PetriNetUnfolderBase]: 894/1382 cut-off events. [2025-04-13 20:06:09,267 INFO L117 PetriNetUnfolderBase]: For 7663/7663 co-relation queries the response was YES. [2025-04-13 20:06:09,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6337 conditions, 1382 events. 894/1382 cut-off events. For 7663/7663 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5694 event pairs, 213 based on Foata normal form. 1/1375 useless extension candidates. Maximal degree in co-relation 6264. Up to 646 conditions per place. [2025-04-13 20:06:09,274 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 104 selfloop transitions, 15 changer transitions 9/128 dead transitions. [2025-04-13 20:06:09,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 1406 flow [2025-04-13 20:06:09,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:09,275 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:09,276 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 721 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:09,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 1406 flow [2025-04-13 20:06:09,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 128 transitions, 1360 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:09,285 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 808 flow [2025-04-13 20:06:09,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=808, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2025-04-13 20:06:09,290 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2025-04-13 20:06:09,290 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 808 flow [2025-04-13 20:06:09,290 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-13 20:06:09,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:09,290 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-13 20:06:09,290 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:06:09,290 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-13 20:06:09,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:09,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1289043977, now seen corresponding path program 2 times [2025-04-13 20:06:09,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:09,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202645064] [2025-04-13 20:06:09,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:09,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:09,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:09,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:09,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:09,375 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-13 20:06:09,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:09,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202645064] [2025-04-13 20:06:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202645064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492100491] [2025-04-13 20:06:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:09,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:09,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:09,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:09,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:09,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:09,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 808 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-13 20:06:09,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:09,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:09,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:09,608 INFO L116 PetriNetUnfolderBase]: 875/1359 cut-off events. [2025-04-13 20:06:09,608 INFO L117 PetriNetUnfolderBase]: For 9395/9395 co-relation queries the response was YES. [2025-04-13 20:06:09,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6257 conditions, 1359 events. 875/1359 cut-off events. For 9395/9395 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5623 event pairs, 315 based on Foata normal form. 1/1354 useless extension candidates. Maximal degree in co-relation 5358. Up to 846 conditions per place. [2025-04-13 20:06:09,615 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 82 selfloop transitions, 18 changer transitions 9/109 dead transitions. [2025-04-13 20:06:09,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 1137 flow [2025-04-13 20:06:09,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:09,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:09,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-13 20:06:09,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-13 20:06:09,616 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 808 flow. Second operand 5 states and 78 transitions. [2025-04-13 20:06:09,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 1137 flow [2025-04-13 20:06:09,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 1110 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:09,628 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 791 flow [2025-04-13 20:06:09,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=791, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2025-04-13 20:06:09,629 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-04-13 20:06:09,629 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 791 flow [2025-04-13 20:06:09,629 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-13 20:06:09,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:09,630 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-13 20:06:09,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:06:09,630 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-13 20:06:09,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1133920129, now seen corresponding path program 3 times [2025-04-13 20:06:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:09,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368336162] [2025-04-13 20:06:09,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:09,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:09,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:09,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:09,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:09,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:09,720 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-13 20:06:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:09,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368336162] [2025-04-13 20:06:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368336162] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455259522] [2025-04-13 20:06:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:09,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:09,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:09,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:09,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 791 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-13 20:06:09,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:09,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:09,951 INFO L116 PetriNetUnfolderBase]: 870/1347 cut-off events. [2025-04-13 20:06:09,952 INFO L117 PetriNetUnfolderBase]: For 9569/9569 co-relation queries the response was YES. [2025-04-13 20:06:09,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6269 conditions, 1347 events. 870/1347 cut-off events. For 9569/9569 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5530 event pairs, 302 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 6198. Up to 846 conditions per place. [2025-04-13 20:06:09,958 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 85 selfloop transitions, 20 changer transitions 11/116 dead transitions. [2025-04-13 20:06:09,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 116 transitions, 1258 flow [2025-04-13 20:06:09,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:09,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 20:06:09,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-13 20:06:09,962 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 791 flow. Second operand 5 states and 81 transitions. [2025-04-13 20:06:09,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 116 transitions, 1258 flow [2025-04-13 20:06:09,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 1216 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:09,973 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 765 flow [2025-04-13 20:06:09,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=765, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2025-04-13 20:06:09,975 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-04-13 20:06:09,975 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 765 flow [2025-04-13 20:06:09,975 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-13 20:06:09,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:09,975 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-13 20:06:09,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:06:09,975 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-13 20:06:09,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:09,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1820153197, now seen corresponding path program 4 times [2025-04-13 20:06:09,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:09,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554946160] [2025-04-13 20:06:09,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:06:09,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:09,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:06:09,985 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 18 statements. [2025-04-13 20:06:09,985 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:06:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:10,045 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-13 20:06:10,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:10,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554946160] [2025-04-13 20:06:10,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554946160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:10,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:10,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246266590] [2025-04-13 20:06:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:10,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:10,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:10,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:10,047 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:10,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 765 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-13 20:06:10,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:10,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:10,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:10,301 INFO L116 PetriNetUnfolderBase]: 838/1294 cut-off events. [2025-04-13 20:06:10,301 INFO L117 PetriNetUnfolderBase]: For 9439/9439 co-relation queries the response was YES. [2025-04-13 20:06:10,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6062 conditions, 1294 events. 838/1294 cut-off events. For 9439/9439 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5190 event pairs, 340 based on Foata normal form. 1/1289 useless extension candidates. Maximal degree in co-relation 5598. Up to 956 conditions per place. [2025-04-13 20:06:10,315 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 82 selfloop transitions, 10 changer transitions 11/103 dead transitions. [2025-04-13 20:06:10,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 103 transitions, 1061 flow [2025-04-13 20:06:10,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-13 20:06:10,317 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-04-13 20:06:10,317 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 765 flow. Second operand 5 states and 76 transitions. [2025-04-13 20:06:10,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 103 transitions, 1061 flow [2025-04-13 20:06:10,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 103 transitions, 1023 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:10,333 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 689 flow [2025-04-13 20:06:10,333 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=689, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2025-04-13 20:06:10,334 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2025-04-13 20:06:10,334 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 689 flow [2025-04-13 20:06:10,334 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-13 20:06:10,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:10,334 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-13 20:06:10,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:06:10,335 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-13 20:06:10,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:10,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1564792557, now seen corresponding path program 5 times [2025-04-13 20:06:10,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:10,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121904757] [2025-04-13 20:06:10,335 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:10,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:10,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:10,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:10,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:10,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:10,430 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-13 20:06:10,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:10,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121904757] [2025-04-13 20:06:10,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121904757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:10,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:10,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:10,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711788775] [2025-04-13 20:06:10,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:10,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:10,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:10,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:10,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:10,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:10,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 689 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-13 20:06:10,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:10,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:10,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:10,657 INFO L116 PetriNetUnfolderBase]: 829/1289 cut-off events. [2025-04-13 20:06:10,657 INFO L117 PetriNetUnfolderBase]: For 8839/8839 co-relation queries the response was YES. [2025-04-13 20:06:10,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6042 conditions, 1289 events. 829/1289 cut-off events. For 8839/8839 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5212 event pairs, 226 based on Foata normal form. 1/1284 useless extension candidates. Maximal degree in co-relation 5981. Up to 608 conditions per place. [2025-04-13 20:06:10,679 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 92 selfloop transitions, 11 changer transitions 7/110 dead transitions. [2025-04-13 20:06:10,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 1153 flow [2025-04-13 20:06:10,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:10,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:10,681 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:10,681 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 689 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:10,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 1153 flow [2025-04-13 20:06:10,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 110 transitions, 1117 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:10,692 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 769 flow [2025-04-13 20:06:10,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=769, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2025-04-13 20:06:10,692 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2025-04-13 20:06:10,692 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 769 flow [2025-04-13 20:06:10,692 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-13 20:06:10,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:10,693 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-13 20:06:10,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:06:10,693 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-13 20:06:10,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -593227423, now seen corresponding path program 6 times [2025-04-13 20:06:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:10,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146505276] [2025-04-13 20:06:10,693 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:06:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:10,702 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:06:10,711 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:06:10,711 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:06:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:10,793 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-13 20:06:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:10,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146505276] [2025-04-13 20:06:10,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146505276] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271438111] [2025-04-13 20:06:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:10,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:10,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:10,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:10,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:10,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 769 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-13 20:06:10,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:10,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:11,018 INFO L116 PetriNetUnfolderBase]: 818/1270 cut-off events. [2025-04-13 20:06:11,018 INFO L117 PetriNetUnfolderBase]: For 9900/9900 co-relation queries the response was YES. [2025-04-13 20:06:11,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 1270 events. 818/1270 cut-off events. For 9900/9900 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5089 event pairs, 339 based on Foata normal form. 1/1265 useless extension candidates. Maximal degree in co-relation 4818. Up to 956 conditions per place. [2025-04-13 20:06:11,024 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 88 selfloop transitions, 13 changer transitions 7/108 dead transitions. [2025-04-13 20:06:11,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 1105 flow [2025-04-13 20:06:11,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-13 20:06:11,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-13 20:06:11,025 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 769 flow. Second operand 5 states and 78 transitions. [2025-04-13 20:06:11,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 1105 flow [2025-04-13 20:06:11,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 108 transitions, 1092 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:11,038 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 753 flow [2025-04-13 20:06:11,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=753, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2025-04-13 20:06:11,038 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2025-04-13 20:06:11,038 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 753 flow [2025-04-13 20:06:11,039 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-13 20:06:11,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:11,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:11,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:06:11,039 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-13 20:06:11,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1958211909, now seen corresponding path program 1 times [2025-04-13 20:06:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:11,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517470116] [2025-04-13 20:06:11,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:11,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:06:11,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:06:11,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:11,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:11,130 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-13 20:06:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:11,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517470116] [2025-04-13 20:06:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517470116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:11,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:11,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535080738] [2025-04-13 20:06:11,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:11,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:11,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:11,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:11,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:11,132 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:11,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 753 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-13 20:06:11,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:11,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:11,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:11,351 INFO L116 PetriNetUnfolderBase]: 845/1335 cut-off events. [2025-04-13 20:06:11,351 INFO L117 PetriNetUnfolderBase]: For 11501/11501 co-relation queries the response was YES. [2025-04-13 20:06:11,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6517 conditions, 1335 events. 845/1335 cut-off events. For 11501/11501 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5747 event pairs, 202 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 5193. Up to 670 conditions per place. [2025-04-13 20:06:11,358 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 109 selfloop transitions, 17 changer transitions 2/128 dead transitions. [2025-04-13 20:06:11,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 128 transitions, 1382 flow [2025-04-13 20:06:11,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:11,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-13 20:06:11,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-04-13 20:06:11,359 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 753 flow. Second operand 5 states and 83 transitions. [2025-04-13 20:06:11,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 128 transitions, 1382 flow [2025-04-13 20:06:11,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1336 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:11,373 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 967 flow [2025-04-13 20:06:11,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=967, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-04-13 20:06:11,373 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2025-04-13 20:06:11,374 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 967 flow [2025-04-13 20:06:11,374 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-13 20:06:11,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:11,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] [2025-04-13 20:06:11,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:06:11,374 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-13 20:06:11,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2053213667, now seen corresponding path program 2 times [2025-04-13 20:06:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:11,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269168746] [2025-04-13 20:06:11,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:11,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:11,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:11,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:11,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:11,463 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-13 20:06:11,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:11,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269168746] [2025-04-13 20:06:11,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269168746] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:11,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:11,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:11,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229915152] [2025-04-13 20:06:11,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:11,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:11,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:11,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:11,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:11,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 967 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-13 20:06:11,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:11,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:11,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:11,717 INFO L116 PetriNetUnfolderBase]: 843/1335 cut-off events. [2025-04-13 20:06:11,717 INFO L117 PetriNetUnfolderBase]: For 12108/12108 co-relation queries the response was YES. [2025-04-13 20:06:11,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6688 conditions, 1335 events. 843/1335 cut-off events. For 12108/12108 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5591 event pairs, 344 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 6306. Up to 956 conditions per place. [2025-04-13 20:06:11,724 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 95 selfloop transitions, 25 changer transitions 2/122 dead transitions. [2025-04-13 20:06:11,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 122 transitions, 1377 flow [2025-04-13 20:06:11,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-13 20:06:11,725 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-13 20:06:11,725 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 967 flow. Second operand 5 states and 80 transitions. [2025-04-13 20:06:11,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 122 transitions, 1377 flow [2025-04-13 20:06:11,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 122 transitions, 1347 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:11,740 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 1077 flow [2025-04-13 20:06:11,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1077, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2025-04-13 20:06:11,741 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-04-13 20:06:11,741 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 1077 flow [2025-04-13 20:06:11,741 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-13 20:06:11,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:11,741 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-13 20:06:11,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:06:11,741 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-13 20:06:11,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2090979637, now seen corresponding path program 3 times [2025-04-13 20:06:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:11,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182999411] [2025-04-13 20:06:11,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:11,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:11,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:11,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:11,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:11,820 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-13 20:06:11,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:11,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182999411] [2025-04-13 20:06:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182999411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206141266] [2025-04-13 20:06:11,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:11,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:11,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:11,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:11,821 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:11,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 1077 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-13 20:06:11,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:11,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:11,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:12,157 INFO L116 PetriNetUnfolderBase]: 985/1581 cut-off events. [2025-04-13 20:06:12,157 INFO L117 PetriNetUnfolderBase]: For 15503/15503 co-relation queries the response was YES. [2025-04-13 20:06:12,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8005 conditions, 1581 events. 985/1581 cut-off events. For 15503/15503 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7263 event pairs, 123 based on Foata normal form. 1/1576 useless extension candidates. Maximal degree in co-relation 7640. Up to 464 conditions per place. [2025-04-13 20:06:12,166 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 129 selfloop transitions, 31 changer transitions 3/163 dead transitions. [2025-04-13 20:06:12,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 163 transitions, 1970 flow [2025-04-13 20:06:12,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-13 20:06:12,167 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-04-13 20:06:12,167 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 1077 flow. Second operand 6 states and 105 transitions. [2025-04-13 20:06:12,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 163 transitions, 1970 flow [2025-04-13 20:06:12,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 163 transitions, 1938 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:12,189 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 1353 flow [2025-04-13 20:06:12,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1353, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2025-04-13 20:06:12,189 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 77 predicate places. [2025-04-13 20:06:12,189 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 1353 flow [2025-04-13 20:06:12,189 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-13 20:06:12,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:12,189 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-13 20:06:12,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:06:12,190 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-13 20:06:12,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash 510778689, now seen corresponding path program 4 times [2025-04-13 20:06:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:12,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93167558] [2025-04-13 20:06:12,190 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:06:12,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:12,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:12,199 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-13 20:06:12,199 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:06:12,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:12,239 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-13 20:06:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:12,239 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93167558] [2025-04-13 20:06:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93167558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:12,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:12,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:12,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445849926] [2025-04-13 20:06:12,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:12,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:12,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:12,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:12,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:12,240 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:12,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 1353 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-13 20:06:12,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:12,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:12,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:12,544 INFO L116 PetriNetUnfolderBase]: 987/1588 cut-off events. [2025-04-13 20:06:12,544 INFO L117 PetriNetUnfolderBase]: For 17170/17170 co-relation queries the response was YES. [2025-04-13 20:06:12,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8540 conditions, 1588 events. 987/1588 cut-off events. For 17170/17170 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7275 event pairs, 111 based on Foata normal form. 1/1583 useless extension candidates. Maximal degree in co-relation 8211. Up to 545 conditions per place. [2025-04-13 20:06:12,553 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 115 selfloop transitions, 50 changer transitions 3/168 dead transitions. [2025-04-13 20:06:12,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 168 transitions, 2243 flow [2025-04-13 20:06:12,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-04-13 20:06:12,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:06:12,555 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 1353 flow. Second operand 6 states and 99 transitions. [2025-04-13 20:06:12,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 168 transitions, 2243 flow [2025-04-13 20:06:12,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 168 transitions, 2193 flow, removed 25 selfloop flow, removed 0 redundant places. [2025-04-13 20:06:12,588 INFO L231 Difference]: Finished difference. Result has 115 places, 115 transitions, 1609 flow [2025-04-13 20:06:12,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1323, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1609, PETRI_PLACES=115, PETRI_TRANSITIONS=115} [2025-04-13 20:06:12,588 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-13 20:06:12,588 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 115 transitions, 1609 flow [2025-04-13 20:06:12,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-13 20:06:12,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:12,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-13 20:06:12,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:06:12,589 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-13 20:06:12,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1540133667, now seen corresponding path program 5 times [2025-04-13 20:06:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:12,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275389389] [2025-04-13 20:06:12,589 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:12,596 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:12,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:06:12,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:06:12,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:12,665 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-13 20:06:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:12,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275389389] [2025-04-13 20:06:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275389389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:12,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:12,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631592254] [2025-04-13 20:06:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:12,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:12,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:12,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:12,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:12,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 1609 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-13 20:06:12,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:12,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:12,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:12,927 INFO L116 PetriNetUnfolderBase]: 975/1568 cut-off events. [2025-04-13 20:06:12,927 INFO L117 PetriNetUnfolderBase]: For 18330/18330 co-relation queries the response was YES. [2025-04-13 20:06:12,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8745 conditions, 1568 events. 975/1568 cut-off events. For 18330/18330 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7083 event pairs, 331 based on Foata normal form. 1/1563 useless extension candidates. Maximal degree in co-relation 8423. Up to 1195 conditions per place. [2025-04-13 20:06:12,936 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 108 selfloop transitions, 25 changer transitions 4/137 dead transitions. [2025-04-13 20:06:12,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 1956 flow [2025-04-13 20:06:12,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-13 20:06:12,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-04-13 20:06:12,937 INFO L175 Difference]: Start difference. First operand has 115 places, 115 transitions, 1609 flow. Second operand 5 states and 75 transitions. [2025-04-13 20:06:12,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 1956 flow [2025-04-13 20:06:12,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 137 transitions, 1913 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:12,972 INFO L231 Difference]: Finished difference. Result has 119 places, 112 transitions, 1574 flow [2025-04-13 20:06:12,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1574, PETRI_PLACES=119, PETRI_TRANSITIONS=112} [2025-04-13 20:06:12,973 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2025-04-13 20:06:12,973 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 112 transitions, 1574 flow [2025-04-13 20:06:12,973 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-13 20:06:12,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:12,973 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-13 20:06:12,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:06:12,973 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-13 20:06:12,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash 565595303, now seen corresponding path program 6 times [2025-04-13 20:06:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:12,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79285628] [2025-04-13 20:06:12,974 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:06:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:12,981 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:12,987 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:12,987 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:06:12,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:13,051 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-13 20:06:13,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:13,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79285628] [2025-04-13 20:06:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79285628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029940233] [2025-04-13 20:06:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:13,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:13,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:13,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:13,052 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:13,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 112 transitions, 1574 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-13 20:06:13,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:13,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:13,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:13,291 INFO L116 PetriNetUnfolderBase]: 969/1550 cut-off events. [2025-04-13 20:06:13,291 INFO L117 PetriNetUnfolderBase]: For 18291/18291 co-relation queries the response was YES. [2025-04-13 20:06:13,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8605 conditions, 1550 events. 969/1550 cut-off events. For 18291/18291 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6923 event pairs, 204 based on Foata normal form. 1/1545 useless extension candidates. Maximal degree in co-relation 8396. Up to 787 conditions per place. [2025-04-13 20:06:13,300 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 93 selfloop transitions, 39 changer transitions 5/137 dead transitions. [2025-04-13 20:06:13,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 137 transitions, 1987 flow [2025-04-13 20:06:13,301 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-13 20:06:13,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-13 20:06:13,302 INFO L175 Difference]: Start difference. First operand has 119 places, 112 transitions, 1574 flow. Second operand 5 states and 74 transitions. [2025-04-13 20:06:13,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 137 transitions, 1987 flow [2025-04-13 20:06:13,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 1916 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 20:06:13,334 INFO L231 Difference]: Finished difference. Result has 120 places, 108 transitions, 1518 flow [2025-04-13 20:06:13,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1518, PETRI_PLACES=120, PETRI_TRANSITIONS=108} [2025-04-13 20:06:13,335 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2025-04-13 20:06:13,335 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 108 transitions, 1518 flow [2025-04-13 20:06:13,335 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-13 20:06:13,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:13,335 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-13 20:06:13,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:06:13,336 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-13 20:06:13,337 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash 515729330, now seen corresponding path program 1 times [2025-04-13 20:06:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:13,337 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31194403] [2025-04-13 20:06:13,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:13,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:13,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:06:13,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:06:13,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:13,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:13,419 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-13 20:06:13,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:13,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31194403] [2025-04-13 20:06:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31194403] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970146114] [2025-04-13 20:06:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:13,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:13,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:13,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:13,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:13,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 108 transitions, 1518 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-13 20:06:13,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:13,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:13,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:13,679 INFO L116 PetriNetUnfolderBase]: 1018/1649 cut-off events. [2025-04-13 20:06:13,679 INFO L117 PetriNetUnfolderBase]: For 19305/19305 co-relation queries the response was YES. [2025-04-13 20:06:13,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9041 conditions, 1649 events. 1018/1649 cut-off events. For 19305/19305 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7671 event pairs, 300 based on Foata normal form. 1/1644 useless extension candidates. Maximal degree in co-relation 8828. Up to 1084 conditions per place. [2025-04-13 20:06:13,688 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 128 selfloop transitions, 15 changer transitions 2/145 dead transitions. [2025-04-13 20:06:13,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 145 transitions, 2048 flow [2025-04-13 20:06:13,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-13 20:06:13,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2025-04-13 20:06:13,689 INFO L175 Difference]: Start difference. First operand has 120 places, 108 transitions, 1518 flow. Second operand 5 states and 82 transitions. [2025-04-13 20:06:13,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 145 transitions, 2048 flow [2025-04-13 20:06:13,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 1992 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:13,724 INFO L231 Difference]: Finished difference. Result has 125 places, 111 transitions, 1584 flow [2025-04-13 20:06:13,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1584, PETRI_PLACES=125, PETRI_TRANSITIONS=111} [2025-04-13 20:06:13,724 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2025-04-13 20:06:13,724 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 111 transitions, 1584 flow [2025-04-13 20:06:13,724 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-13 20:06:13,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:13,724 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-13 20:06:13,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:06:13,725 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-13 20:06:13,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1571008834, now seen corresponding path program 2 times [2025-04-13 20:06:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:13,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235074150] [2025-04-13 20:06:13,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:13,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:13,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:13,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:13,783 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-13 20:06:13,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:13,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235074150] [2025-04-13 20:06:13,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235074150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:13,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:13,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:13,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216497195] [2025-04-13 20:06:13,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:13,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:13,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:13,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:13,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:13,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:13,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 111 transitions, 1584 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-13 20:06:13,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:13,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:13,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:14,076 INFO L116 PetriNetUnfolderBase]: 1007/1629 cut-off events. [2025-04-13 20:06:14,077 INFO L117 PetriNetUnfolderBase]: For 19988/19988 co-relation queries the response was YES. [2025-04-13 20:06:14,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8891 conditions, 1629 events. 1007/1629 cut-off events. For 19988/19988 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 7468 event pairs, 225 based on Foata normal form. 1/1624 useless extension candidates. Maximal degree in co-relation 8734. Up to 749 conditions per place. [2025-04-13 20:06:14,086 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 126 selfloop transitions, 20 changer transitions 2/148 dead transitions. [2025-04-13 20:06:14,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 148 transitions, 2176 flow [2025-04-13 20:06:14,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 20:06:14,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-04-13 20:06:14,087 INFO L175 Difference]: Start difference. First operand has 125 places, 111 transitions, 1584 flow. Second operand 5 states and 81 transitions. [2025-04-13 20:06:14,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 148 transitions, 2176 flow [2025-04-13 20:06:14,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 148 transitions, 2158 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:14,124 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 1769 flow [2025-04-13 20:06:14,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1769, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2025-04-13 20:06:14,124 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 100 predicate places. [2025-04-13 20:06:14,124 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 1769 flow [2025-04-13 20:06:14,124 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-13 20:06:14,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:14,124 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-13 20:06:14,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:06:14,124 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-13 20:06:14,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -252231176, now seen corresponding path program 3 times [2025-04-13 20:06:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:14,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032780218] [2025-04-13 20:06:14,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:14,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:14,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:14,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:14,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:14,190 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-13 20:06:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:14,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032780218] [2025-04-13 20:06:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032780218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999245869] [2025-04-13 20:06:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:14,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:14,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:14,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:14,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 1769 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-13 20:06:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:14,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:14,439 INFO L116 PetriNetUnfolderBase]: 996/1609 cut-off events. [2025-04-13 20:06:14,439 INFO L117 PetriNetUnfolderBase]: For 20818/20818 co-relation queries the response was YES. [2025-04-13 20:06:14,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9039 conditions, 1609 events. 996/1609 cut-off events. For 20818/20818 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7401 event pairs, 305 based on Foata normal form. 1/1604 useless extension candidates. Maximal degree in co-relation 8880. Up to 1084 conditions per place. [2025-04-13 20:06:14,448 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 118 selfloop transitions, 21 changer transitions 4/143 dead transitions. [2025-04-13 20:06:14,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 143 transitions, 2169 flow [2025-04-13 20:06:14,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:14,449 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:14,449 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 1769 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:14,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 143 transitions, 2169 flow [2025-04-13 20:06:14,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 143 transitions, 2132 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:14,484 INFO L231 Difference]: Finished difference. Result has 133 places, 114 transitions, 1736 flow [2025-04-13 20:06:14,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1736, PETRI_PLACES=133, PETRI_TRANSITIONS=114} [2025-04-13 20:06:14,484 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2025-04-13 20:06:14,484 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 114 transitions, 1736 flow [2025-04-13 20:06:14,485 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-13 20:06:14,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:14,485 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-13 20:06:14,485 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:06:14,485 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-13 20:06:14,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1357407364, now seen corresponding path program 4 times [2025-04-13 20:06:14,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:14,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021046037] [2025-04-13 20:06:14,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:06:14,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:14,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:14,493 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 19 statements. [2025-04-13 20:06:14,493 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:06:14,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:14,524 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-13 20:06:14,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:14,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021046037] [2025-04-13 20:06:14,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021046037] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:14,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:14,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:14,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393760092] [2025-04-13 20:06:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:14,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:14,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:14,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:14,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:14,526 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:14,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 114 transitions, 1736 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-13 20:06:14,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:14,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:14,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:14,826 INFO L116 PetriNetUnfolderBase]: 1102/1788 cut-off events. [2025-04-13 20:06:14,826 INFO L117 PetriNetUnfolderBase]: For 22084/22084 co-relation queries the response was YES. [2025-04-13 20:06:14,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9911 conditions, 1788 events. 1102/1788 cut-off events. For 22084/22084 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8460 event pairs, 148 based on Foata normal form. 1/1783 useless extension candidates. Maximal degree in co-relation 9725. Up to 549 conditions per place. [2025-04-13 20:06:14,837 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 124 selfloop transitions, 44 changer transitions 3/171 dead transitions. [2025-04-13 20:06:14,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 171 transitions, 2500 flow [2025-04-13 20:06:14,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2025-04-13 20:06:14,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-04-13 20:06:14,838 INFO L175 Difference]: Start difference. First operand has 133 places, 114 transitions, 1736 flow. Second operand 6 states and 105 transitions. [2025-04-13 20:06:14,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 171 transitions, 2500 flow [2025-04-13 20:06:14,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 171 transitions, 2417 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:06:14,905 INFO L231 Difference]: Finished difference. Result has 136 places, 124 transitions, 2013 flow [2025-04-13 20:06:14,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2013, PETRI_PLACES=136, PETRI_TRANSITIONS=124} [2025-04-13 20:06:14,906 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 106 predicate places. [2025-04-13 20:06:14,906 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 124 transitions, 2013 flow [2025-04-13 20:06:14,906 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-13 20:06:14,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:14,906 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-13 20:06:14,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:06:14,907 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-13 20:06:14,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash 2056272088, now seen corresponding path program 5 times [2025-04-13 20:06:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:14,907 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275003250] [2025-04-13 20:06:14,907 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:14,913 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:14,919 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:06:14,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:06:14,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:14,976 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-13 20:06:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:14,977 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275003250] [2025-04-13 20:06:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275003250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836061438] [2025-04-13 20:06:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:14,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:14,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:14,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 124 transitions, 2013 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-13 20:06:14,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:14,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:14,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:15,272 INFO L116 PetriNetUnfolderBase]: 1090/1767 cut-off events. [2025-04-13 20:06:15,272 INFO L117 PetriNetUnfolderBase]: For 22894/22894 co-relation queries the response was YES. [2025-04-13 20:06:15,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10017 conditions, 1767 events. 1090/1767 cut-off events. For 22894/22894 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8360 event pairs, 168 based on Foata normal form. 1/1762 useless extension candidates. Maximal degree in co-relation 9821. Up to 665 conditions per place. [2025-04-13 20:06:15,284 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 116 selfloop transitions, 55 changer transitions 3/174 dead transitions. [2025-04-13 20:06:15,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 174 transitions, 2707 flow [2025-04-13 20:06:15,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2025-04-13 20:06:15,285 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51010101010101 [2025-04-13 20:06:15,285 INFO L175 Difference]: Start difference. First operand has 136 places, 124 transitions, 2013 flow. Second operand 6 states and 101 transitions. [2025-04-13 20:06:15,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 174 transitions, 2707 flow [2025-04-13 20:06:15,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 174 transitions, 2674 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:15,337 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 2211 flow [2025-04-13 20:06:15,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2211, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2025-04-13 20:06:15,338 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2025-04-13 20:06:15,338 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 2211 flow [2025-04-13 20:06:15,338 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-13 20:06:15,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:15,338 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-13 20:06:15,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:06:15,338 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-13 20:06:15,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -288875432, now seen corresponding path program 6 times [2025-04-13 20:06:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:15,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896592291] [2025-04-13 20:06:15,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:06:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:15,345 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 20:06:15,352 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 19 statements. [2025-04-13 20:06:15,352 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:06:15,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:15,420 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-13 20:06:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:15,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896592291] [2025-04-13 20:06:15,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896592291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:15,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:15,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740785212] [2025-04-13 20:06:15,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:15,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:15,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:15,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:15,421 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:15,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 2211 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-13 20:06:15,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:15,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:15,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:15,682 INFO L116 PetriNetUnfolderBase]: 1078/1746 cut-off events. [2025-04-13 20:06:15,682 INFO L117 PetriNetUnfolderBase]: For 25891/25891 co-relation queries the response was YES. [2025-04-13 20:06:15,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10370 conditions, 1746 events. 1078/1746 cut-off events. For 25891/25891 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8144 event pairs, 267 based on Foata normal form. 1/1741 useless extension candidates. Maximal degree in co-relation 10158. Up to 972 conditions per place. [2025-04-13 20:06:15,693 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 101 selfloop transitions, 46 changer transitions 5/152 dead transitions. [2025-04-13 20:06:15,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 152 transitions, 2689 flow [2025-04-13 20:06:15,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-13 20:06:15,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4484848484848485 [2025-04-13 20:06:15,695 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 2211 flow. Second operand 5 states and 74 transitions. [2025-04-13 20:06:15,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 152 transitions, 2689 flow [2025-04-13 20:06:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 152 transitions, 2601 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-04-13 20:06:15,750 INFO L231 Difference]: Finished difference. Result has 143 places, 126 transitions, 2284 flow [2025-04-13 20:06:15,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2127, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2284, PETRI_PLACES=143, PETRI_TRANSITIONS=126} [2025-04-13 20:06:15,751 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2025-04-13 20:06:15,751 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 126 transitions, 2284 flow [2025-04-13 20:06:15,751 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-13 20:06:15,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:15,752 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-13 20:06:15,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:06:15,752 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-13 20:06:15,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1943349492, now seen corresponding path program 1 times [2025-04-13 20:06:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:15,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916914512] [2025-04-13 20:06:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:15,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:06:15,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:06:15,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:15,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:15,811 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-13 20:06:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:15,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916914512] [2025-04-13 20:06:15,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916914512] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:15,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:15,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:15,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568983358] [2025-04-13 20:06:15,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:15,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:06:15,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:15,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:06:15,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:06:15,813 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:15,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 126 transitions, 2284 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-13 20:06:15,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:15,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:15,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:16,060 INFO L116 PetriNetUnfolderBase]: 1014/1638 cut-off events. [2025-04-13 20:06:16,061 INFO L117 PetriNetUnfolderBase]: For 26587/26587 co-relation queries the response was YES. [2025-04-13 20:06:16,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9813 conditions, 1638 events. 1014/1638 cut-off events. For 26587/26587 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7483 event pairs, 146 based on Foata normal form. 13/1645 useless extension candidates. Maximal degree in co-relation 9594. Up to 889 conditions per place. [2025-04-13 20:06:16,070 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 108 selfloop transitions, 32 changer transitions 6/146 dead transitions. [2025-04-13 20:06:16,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 146 transitions, 2610 flow [2025-04-13 20:06:16,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:16,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:16,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:16,071 INFO L175 Difference]: Start difference. First operand has 143 places, 126 transitions, 2284 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:16,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 146 transitions, 2610 flow [2025-04-13 20:06:16,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 146 transitions, 2524 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-13 20:06:16,118 INFO L231 Difference]: Finished difference. Result has 138 places, 120 transitions, 2126 flow [2025-04-13 20:06:16,118 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2126, PETRI_PLACES=138, PETRI_TRANSITIONS=120} [2025-04-13 20:06:16,118 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 108 predicate places. [2025-04-13 20:06:16,118 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 120 transitions, 2126 flow [2025-04-13 20:06:16,119 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-13 20:06:16,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:16,119 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-13 20:06:16,119 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:06:16,119 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-13 20:06:16,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 275690652, now seen corresponding path program 2 times [2025-04-13 20:06:16,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:16,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999840203] [2025-04-13 20:06:16,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:16,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:16,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:06:16,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:06:16,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:16,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:16,177 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-13 20:06:16,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:16,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999840203] [2025-04-13 20:06:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999840203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289173467] [2025-04-13 20:06:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:16,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:16,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:16,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:16,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:16,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:16,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 120 transitions, 2126 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-13 20:06:16,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:16,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:16,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:16,464 INFO L116 PetriNetUnfolderBase]: 1066/1736 cut-off events. [2025-04-13 20:06:16,464 INFO L117 PetriNetUnfolderBase]: For 23646/23646 co-relation queries the response was YES. [2025-04-13 20:06:16,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9901 conditions, 1736 events. 1066/1736 cut-off events. For 23646/23646 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8128 event pairs, 107 based on Foata normal form. 2/1732 useless extension candidates. Maximal degree in co-relation 9692. Up to 891 conditions per place. [2025-04-13 20:06:16,471 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 121 selfloop transitions, 31 changer transitions 12/164 dead transitions. [2025-04-13 20:06:16,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 164 transitions, 2775 flow [2025-04-13 20:06:16,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:16,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2025-04-13 20:06:16,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-13 20:06:16,472 INFO L175 Difference]: Start difference. First operand has 138 places, 120 transitions, 2126 flow. Second operand 6 states and 96 transitions. [2025-04-13 20:06:16,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 164 transitions, 2775 flow [2025-04-13 20:06:16,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 164 transitions, 2749 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:16,517 INFO L231 Difference]: Finished difference. Result has 147 places, 125 transitions, 2319 flow [2025-04-13 20:06:16,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2319, PETRI_PLACES=147, PETRI_TRANSITIONS=125} [2025-04-13 20:06:16,517 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2025-04-13 20:06:16,517 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 125 transitions, 2319 flow [2025-04-13 20:06:16,517 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-13 20:06:16,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:16,517 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-13 20:06:16,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:06:16,518 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-13 20:06:16,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -487708812, now seen corresponding path program 3 times [2025-04-13 20:06:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:16,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138137293] [2025-04-13 20:06:16,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:16,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:06:16,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:06:16,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:16,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:16,584 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-13 20:06:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:16,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138137293] [2025-04-13 20:06:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138137293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891749533] [2025-04-13 20:06:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:16,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:06:16,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:16,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:06:16,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:06:16,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:16,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 125 transitions, 2319 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-13 20:06:16,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:16,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:16,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:16,868 INFO L116 PetriNetUnfolderBase]: 1037/1709 cut-off events. [2025-04-13 20:06:16,868 INFO L117 PetriNetUnfolderBase]: For 25584/25584 co-relation queries the response was YES. [2025-04-13 20:06:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9978 conditions, 1709 events. 1037/1709 cut-off events. For 25584/25584 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8152 event pairs, 117 based on Foata normal form. 1/1704 useless extension candidates. Maximal degree in co-relation 9860. Up to 780 conditions per place. [2025-04-13 20:06:16,877 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 116 selfloop transitions, 34 changer transitions 12/162 dead transitions. [2025-04-13 20:06:16,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 162 transitions, 2822 flow [2025-04-13 20:06:16,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:06:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:06:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-04-13 20:06:16,878 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:06:16,878 INFO L175 Difference]: Start difference. First operand has 147 places, 125 transitions, 2319 flow. Second operand 6 states and 99 transitions. [2025-04-13 20:06:16,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 162 transitions, 2822 flow [2025-04-13 20:06:16,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 162 transitions, 2758 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:16,928 INFO L231 Difference]: Finished difference. Result has 150 places, 121 transitions, 2246 flow [2025-04-13 20:06:16,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2259, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2246, PETRI_PLACES=150, PETRI_TRANSITIONS=121} [2025-04-13 20:06:16,929 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 120 predicate places. [2025-04-13 20:06:16,929 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 121 transitions, 2246 flow [2025-04-13 20:06:16,929 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-13 20:06:16,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:16,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-13 20:06:16,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:06:16,929 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-13 20:06:16,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash 791649536, now seen corresponding path program 4 times [2025-04-13 20:06:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:16,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178140989] [2025-04-13 20:06:16,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:06:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:16,935 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:06:16,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 20 statements. [2025-04-13 20:06:16,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:06:16,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:16,949 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-13 20:06:16,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:16,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178140989] [2025-04-13 20:06:16,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178140989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:16,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:16,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:06:16,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548735381] [2025-04-13 20:06:16,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:16,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:06:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:16,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:06:16,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:06:16,950 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:16,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 121 transitions, 2246 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-13 20:06:16,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:16,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:16,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:17,240 INFO L116 PetriNetUnfolderBase]: 960/1592 cut-off events. [2025-04-13 20:06:17,241 INFO L117 PetriNetUnfolderBase]: For 26041/26041 co-relation queries the response was YES. [2025-04-13 20:06:17,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 1592 events. 960/1592 cut-off events. For 26041/26041 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 7487 event pairs, 326 based on Foata normal form. 11/1597 useless extension candidates. Maximal degree in co-relation 9123. Up to 1159 conditions per place. [2025-04-13 20:06:17,253 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 123 selfloop transitions, 16 changer transitions 4/143 dead transitions. [2025-04-13 20:06:17,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 143 transitions, 2537 flow [2025-04-13 20:06:17,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:06:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:06:17,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-13 20:06:17,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-04-13 20:06:17,254 INFO L175 Difference]: Start difference. First operand has 150 places, 121 transitions, 2246 flow. Second operand 5 states and 77 transitions. [2025-04-13 20:06:17,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 143 transitions, 2537 flow [2025-04-13 20:06:17,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 2485 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 20:06:17,305 INFO L231 Difference]: Finished difference. Result has 147 places, 116 transitions, 2097 flow [2025-04-13 20:06:17,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2113, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2097, PETRI_PLACES=147, PETRI_TRANSITIONS=116} [2025-04-13 20:06:17,306 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2025-04-13 20:06:17,306 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 116 transitions, 2097 flow [2025-04-13 20:06:17,306 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-13 20:06:17,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:17,306 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-13 20:06:17,306 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:06:17,306 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-13 20:06:17,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash 999768820, now seen corresponding path program 5 times [2025-04-13 20:06:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:17,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74016432] [2025-04-13 20:06:17,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:17,311 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:06:17,315 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:06:17,316 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:06:17,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:17,434 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-13 20:06:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:17,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74016432] [2025-04-13 20:06:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74016432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:06:17,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579122028] [2025-04-13 20:06:17,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:06:17,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:06:17,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:06:17,436 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-13 20:06:17,438 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-13 20:06:17,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:06:17,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:06:17,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:06:17,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:17,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:06:17,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:06:17,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:06:17,813 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-13 20:06:17,868 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-13 20:06:17,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:06:18,214 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:06:18,214 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-13 20:06:18,768 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-13 20:06:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579122028] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:06:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:06:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 23 [2025-04-13 20:06:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307994682] [2025-04-13 20:06:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:18,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:06:18,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:18,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:06:18,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:06:18,770 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:06:18,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 116 transitions, 2097 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-13 20:06:18,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:18,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:06:18,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:23,637 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-13 20:06:39,807 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-13 20:06:43,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-13 20:06:55,966 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-13 20:07:00,003 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-13 20:07:04,061 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-13 20:07:08,101 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-13 20:07:12,116 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-13 20:07:16,236 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-13 20:07:20,263 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-13 20:07:24,299 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-13 20:07:24,375 INFO L116 PetriNetUnfolderBase]: 1989/3510 cut-off events. [2025-04-13 20:07:24,376 INFO L117 PetriNetUnfolderBase]: For 49670/49670 co-relation queries the response was YES. [2025-04-13 20:07:24,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19518 conditions, 3510 events. 1989/3510 cut-off events. For 49670/49670 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 21690 event pairs, 254 based on Foata normal form. 125/3628 useless extension candidates. Maximal degree in co-relation 19091. Up to 1077 conditions per place. [2025-04-13 20:07:24,400 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 243 selfloop transitions, 65 changer transitions 111/419 dead transitions. [2025-04-13 20:07:24,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 419 transitions, 7160 flow [2025-04-13 20:07:24,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:07:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:07:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 292 transitions. [2025-04-13 20:07:24,401 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2025-04-13 20:07:24,401 INFO L175 Difference]: Start difference. First operand has 147 places, 116 transitions, 2097 flow. Second operand 24 states and 292 transitions. [2025-04-13 20:07:24,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 419 transitions, 7160 flow [2025-04-13 20:07:24,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 419 transitions, 7110 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 20:07:24,546 INFO L231 Difference]: Finished difference. Result has 182 places, 157 transitions, 3152 flow [2025-04-13 20:07:24,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3152, PETRI_PLACES=182, PETRI_TRANSITIONS=157} [2025-04-13 20:07:24,546 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2025-04-13 20:07:24,546 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 157 transitions, 3152 flow [2025-04-13 20:07:24,547 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-13 20:07:24,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:24,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:07:24,558 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-13 20:07:24,747 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-13 20:07:24,748 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-13 20:07:24,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1371881935, now seen corresponding path program 1 times [2025-04-13 20:07:24,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:24,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291808538] [2025-04-13 20:07:24,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:24,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:07:24,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:07:24,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:24,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:24,785 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-13 20:07:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:24,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291808538] [2025-04-13 20:07:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291808538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:24,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:24,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166955853] [2025-04-13 20:07:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:24,786 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:24,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:24,787 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:24,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 157 transitions, 3152 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-13 20:07:24,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:24,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:24,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:25,150 INFO L116 PetriNetUnfolderBase]: 1513/2599 cut-off events. [2025-04-13 20:07:25,150 INFO L117 PetriNetUnfolderBase]: For 43885/43885 co-relation queries the response was YES. [2025-04-13 20:07:25,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16145 conditions, 2599 events. 1513/2599 cut-off events. For 43885/43885 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14564 event pairs, 441 based on Foata normal form. 22/2618 useless extension candidates. Maximal degree in co-relation 15722. Up to 1540 conditions per place. [2025-04-13 20:07:25,168 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 155 selfloop transitions, 27 changer transitions 6/188 dead transitions. [2025-04-13 20:07:25,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 188 transitions, 3606 flow [2025-04-13 20:07:25,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-13 20:07:25,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-04-13 20:07:25,169 INFO L175 Difference]: Start difference. First operand has 182 places, 157 transitions, 3152 flow. Second operand 5 states and 85 transitions. [2025-04-13 20:07:25,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 188 transitions, 3606 flow [2025-04-13 20:07:25,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 188 transitions, 3404 flow, removed 63 selfloop flow, removed 10 redundant places. [2025-04-13 20:07:25,277 INFO L231 Difference]: Finished difference. Result has 166 places, 150 transitions, 2854 flow [2025-04-13 20:07:25,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=162, 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=2854, PETRI_PLACES=166, PETRI_TRANSITIONS=150} [2025-04-13 20:07:25,278 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2025-04-13 20:07:25,278 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 150 transitions, 2854 flow [2025-04-13 20:07:25,278 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-13 20:07:25,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:25,278 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-13 20:07:25,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 20:07:25,278 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-13 20:07:25,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash 721577277, now seen corresponding path program 2 times [2025-04-13 20:07:25,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:25,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454575853] [2025-04-13 20:07:25,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:25,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:07:25,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:07:25,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:07:25,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:25,311 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-13 20:07:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:25,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454575853] [2025-04-13 20:07:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454575853] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:25,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491086224] [2025-04-13 20:07:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:25,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:25,312 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:25,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 150 transitions, 2854 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-13 20:07:25,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:25,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:25,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:25,643 INFO L116 PetriNetUnfolderBase]: 1376/2330 cut-off events. [2025-04-13 20:07:25,643 INFO L117 PetriNetUnfolderBase]: For 35642/35642 co-relation queries the response was YES. [2025-04-13 20:07:25,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13717 conditions, 2330 events. 1376/2330 cut-off events. For 35642/35642 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12329 event pairs, 496 based on Foata normal form. 20/2347 useless extension candidates. Maximal degree in co-relation 13357. Up to 1646 conditions per place. [2025-04-13 20:07:25,659 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 126 selfloop transitions, 16 changer transitions 19/161 dead transitions. [2025-04-13 20:07:25,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 161 transitions, 2964 flow [2025-04-13 20:07:25,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-13 20:07:25,660 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-13 20:07:25,660 INFO L175 Difference]: Start difference. First operand has 166 places, 150 transitions, 2854 flow. Second operand 5 states and 78 transitions. [2025-04-13 20:07:25,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 161 transitions, 2964 flow [2025-04-13 20:07:25,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 161 transitions, 2886 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-04-13 20:07:25,743 INFO L231 Difference]: Finished difference. Result has 156 places, 126 transitions, 2303 flow [2025-04-13 20:07:25,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2303, PETRI_PLACES=156, PETRI_TRANSITIONS=126} [2025-04-13 20:07:25,743 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2025-04-13 20:07:25,743 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 126 transitions, 2303 flow [2025-04-13 20:07:25,743 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-13 20:07:25,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:25,743 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-13 20:07:25,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:07:25,743 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-13 20:07:25,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 926993755, now seen corresponding path program 3 times [2025-04-13 20:07:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:25,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887492362] [2025-04-13 20:07:25,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:07:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:25,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:07:25,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:07:25,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:07:25,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:25,790 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-13 20:07:25,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:25,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887492362] [2025-04-13 20:07:25,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887492362] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:25,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:25,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:25,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878871511] [2025-04-13 20:07:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:25,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:07:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:25,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:07:25,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:07:25,792 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 126 transitions, 2303 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-13 20:07:25,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:25,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:25,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:26,129 INFO L116 PetriNetUnfolderBase]: 1314/2204 cut-off events. [2025-04-13 20:07:26,129 INFO L117 PetriNetUnfolderBase]: For 28591/28591 co-relation queries the response was YES. [2025-04-13 20:07:26,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12292 conditions, 2204 events. 1314/2204 cut-off events. For 28591/28591 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11427 event pairs, 130 based on Foata normal form. 3/2204 useless extension candidates. Maximal degree in co-relation 11935. Up to 1105 conditions per place. [2025-04-13 20:07:26,140 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 130 selfloop transitions, 24 changer transitions 14/168 dead transitions. [2025-04-13 20:07:26,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 168 transitions, 2871 flow [2025-04-13 20:07:26,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:07:26,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:07:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-13 20:07:26,141 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-04-13 20:07:26,141 INFO L175 Difference]: Start difference. First operand has 156 places, 126 transitions, 2303 flow. Second operand 6 states and 97 transitions. [2025-04-13 20:07:26,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 168 transitions, 2871 flow [2025-04-13 20:07:26,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 168 transitions, 2656 flow, removed 35 selfloop flow, removed 13 redundant places. [2025-04-13 20:07:26,194 INFO L231 Difference]: Finished difference. Result has 145 places, 122 transitions, 2081 flow [2025-04-13 20:07:26,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2081, PETRI_PLACES=145, PETRI_TRANSITIONS=122} [2025-04-13 20:07:26,195 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-04-13 20:07:26,195 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 122 transitions, 2081 flow [2025-04-13 20:07:26,195 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-13 20:07:26,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:26,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-13 20:07:26,195 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 20:07:26,195 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-13 20:07:26,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash -2064314775, now seen corresponding path program 4 times [2025-04-13 20:07:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:26,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597364694] [2025-04-13 20:07:26,195 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:07:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:26,200 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:07:26,201 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 20 statements. [2025-04-13 20:07:26,201 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:07:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:26,212 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-13 20:07:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:26,213 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597364694] [2025-04-13 20:07:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597364694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542777541] [2025-04-13 20:07:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:26,213 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:26,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:26,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:26,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:26,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 122 transitions, 2081 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-13 20:07:26,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:26,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:26,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:26,461 INFO L116 PetriNetUnfolderBase]: 1098/1852 cut-off events. [2025-04-13 20:07:26,461 INFO L117 PetriNetUnfolderBase]: For 23142/23142 co-relation queries the response was YES. [2025-04-13 20:07:26,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10190 conditions, 1852 events. 1098/1852 cut-off events. For 23142/23142 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9278 event pairs, 97 based on Foata normal form. 54/1903 useless extension candidates. Maximal degree in co-relation 10076. Up to 1132 conditions per place. [2025-04-13 20:07:26,471 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 117 selfloop transitions, 23 changer transitions 2/142 dead transitions. [2025-04-13 20:07:26,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 142 transitions, 2308 flow [2025-04-13 20:07:26,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:26,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-13 20:07:26,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2025-04-13 20:07:26,472 INFO L175 Difference]: Start difference. First operand has 145 places, 122 transitions, 2081 flow. Second operand 5 states and 78 transitions. [2025-04-13 20:07:26,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 142 transitions, 2308 flow [2025-04-13 20:07:26,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 142 transitions, 2150 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-04-13 20:07:26,519 INFO L231 Difference]: Finished difference. Result has 137 places, 115 transitions, 1818 flow [2025-04-13 20:07:26,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1818, PETRI_PLACES=137, PETRI_TRANSITIONS=115} [2025-04-13 20:07:26,519 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2025-04-13 20:07:26,520 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 115 transitions, 1818 flow [2025-04-13 20:07:26,520 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-13 20:07:26,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:26,520 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-13 20:07:26,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:07:26,520 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-13 20:07:26,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash -114494999, now seen corresponding path program 5 times [2025-04-13 20:07:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:26,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192007863] [2025-04-13 20:07:26,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:07:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:26,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:07:26,528 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:07:26,529 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:07:26,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:26,570 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-13 20:07:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:26,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192007863] [2025-04-13 20:07:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192007863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479975785] [2025-04-13 20:07:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:26,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:07:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:07:26,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:07:26,571 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:26,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 115 transitions, 1818 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-13 20:07:26,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:26,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:26,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:26,826 INFO L116 PetriNetUnfolderBase]: 1092/1837 cut-off events. [2025-04-13 20:07:26,827 INFO L117 PetriNetUnfolderBase]: For 18265/18265 co-relation queries the response was YES. [2025-04-13 20:07:26,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 1837 events. 1092/1837 cut-off events. For 18265/18265 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9104 event pairs, 256 based on Foata normal form. 5/1839 useless extension candidates. Maximal degree in co-relation 9590. Up to 940 conditions per place. [2025-04-13 20:07:26,837 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 101 selfloop transitions, 10 changer transitions 23/134 dead transitions. [2025-04-13 20:07:26,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 2153 flow [2025-04-13 20:07:26,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-04-13 20:07:26,838 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2025-04-13 20:07:26,838 INFO L175 Difference]: Start difference. First operand has 137 places, 115 transitions, 1818 flow. Second operand 5 states and 69 transitions. [2025-04-13 20:07:26,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 2153 flow [2025-04-13 20:07:26,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 2085 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 20:07:26,876 INFO L231 Difference]: Finished difference. Result has 139 places, 101 transitions, 1548 flow [2025-04-13 20:07:26,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1750, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1548, PETRI_PLACES=139, PETRI_TRANSITIONS=101} [2025-04-13 20:07:26,876 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2025-04-13 20:07:26,876 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 101 transitions, 1548 flow [2025-04-13 20:07:26,877 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-13 20:07:26,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:26,877 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-13 20:07:26,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 20:07:26,877 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-13 20:07:26,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:26,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1965148905, now seen corresponding path program 1 times [2025-04-13 20:07:26,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:26,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246843583] [2025-04-13 20:07:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:26,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:07:26,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:07:26,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:26,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:26,954 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-13 20:07:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:26,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246843583] [2025-04-13 20:07:26,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246843583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977311655] [2025-04-13 20:07:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:26,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:26,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:26,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:26,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:26,955 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:26,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 101 transitions, 1548 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-13 20:07:26,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:26,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:26,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:27,168 INFO L116 PetriNetUnfolderBase]: 915/1518 cut-off events. [2025-04-13 20:07:27,168 INFO L117 PetriNetUnfolderBase]: For 13099/13099 co-relation queries the response was YES. [2025-04-13 20:07:27,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8082 conditions, 1518 events. 915/1518 cut-off events. For 13099/13099 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7189 event pairs, 111 based on Foata normal form. 10/1526 useless extension candidates. Maximal degree in co-relation 8027. Up to 1193 conditions per place. [2025-04-13 20:07:27,177 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 102 selfloop transitions, 14 changer transitions 3/119 dead transitions. [2025-04-13 20:07:27,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 1831 flow [2025-04-13 20:07:27,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:07:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:07:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:07:27,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-04-13 20:07:27,178 INFO L175 Difference]: Start difference. First operand has 139 places, 101 transitions, 1548 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:07:27,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 1831 flow [2025-04-13 20:07:27,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1662 flow, removed 26 selfloop flow, removed 13 redundant places. [2025-04-13 20:07:27,206 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 1324 flow [2025-04-13 20:07:27,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1324, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2025-04-13 20:07:27,207 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2025-04-13 20:07:27,207 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 1324 flow [2025-04-13 20:07:27,207 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-13 20:07:27,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:27,207 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-13 20:07:27,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 20:07:27,207 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-13 20:07:27,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1663517523, now seen corresponding path program 2 times [2025-04-13 20:07:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:27,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816776321] [2025-04-13 20:07:27,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:27,213 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:07:27,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 20:07:27,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:07:27,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:27,260 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-13 20:07:27,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:27,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816776321] [2025-04-13 20:07:27,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816776321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:27,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:27,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266877489] [2025-04-13 20:07:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:27,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:27,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:27,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:27,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:27,262 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:27,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 1324 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-13 20:07:27,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:27,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:27,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:27,432 INFO L116 PetriNetUnfolderBase]: 837/1394 cut-off events. [2025-04-13 20:07:27,432 INFO L117 PetriNetUnfolderBase]: For 9050/9050 co-relation queries the response was YES. [2025-04-13 20:07:27,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 1394 events. 837/1394 cut-off events. For 9050/9050 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6407 event pairs, 76 based on Foata normal form. 22/1414 useless extension candidates. Maximal degree in co-relation 6832. Up to 1066 conditions per place. [2025-04-13 20:07:27,438 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 96 selfloop transitions, 12 changer transitions 3/111 dead transitions. [2025-04-13 20:07:27,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 1551 flow [2025-04-13 20:07:27,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:07:27,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:07:27,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-13 20:07:27,439 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-04-13 20:07:27,439 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 1324 flow. Second operand 4 states and 61 transitions. [2025-04-13 20:07:27,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 1551 flow [2025-04-13 20:07:27,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 111 transitions, 1496 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:07:27,455 INFO L231 Difference]: Finished difference. Result has 113 places, 93 transitions, 1230 flow [2025-04-13 20:07:27,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1230, PETRI_PLACES=113, PETRI_TRANSITIONS=93} [2025-04-13 20:07:27,455 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2025-04-13 20:07:27,455 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 93 transitions, 1230 flow [2025-04-13 20:07:27,455 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-13 20:07:27,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:27,456 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-13 20:07:27,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 20:07:27,456 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-13 20:07:27,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1622354731, now seen corresponding path program 3 times [2025-04-13 20:07:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:27,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196479645] [2025-04-13 20:07:27,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:07:27,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:27,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:07:27,465 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 20:07:27,465 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:07:27,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:27,514 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-13 20:07:27,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:27,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196479645] [2025-04-13 20:07:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196479645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:27,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:27,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:27,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71433546] [2025-04-13 20:07:27,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:27,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:07:27,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:27,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:07:27,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:07:27,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:27,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 93 transitions, 1230 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-13 20:07:27,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:27,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:27,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:27,715 INFO L116 PetriNetUnfolderBase]: 790/1309 cut-off events. [2025-04-13 20:07:27,715 INFO L117 PetriNetUnfolderBase]: For 7698/7698 co-relation queries the response was YES. [2025-04-13 20:07:27,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6510 conditions, 1309 events. 790/1309 cut-off events. For 7698/7698 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5869 event pairs, 116 based on Foata normal form. 2/1309 useless extension candidates. Maximal degree in co-relation 6468. Up to 1097 conditions per place. [2025-04-13 20:07:27,721 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 89 selfloop transitions, 6 changer transitions 15/110 dead transitions. [2025-04-13 20:07:27,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 110 transitions, 1507 flow [2025-04-13 20:07:27,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:27,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-13 20:07:27,722 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-04-13 20:07:27,722 INFO L175 Difference]: Start difference. First operand has 113 places, 93 transitions, 1230 flow. Second operand 5 states and 65 transitions. [2025-04-13 20:07:27,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 110 transitions, 1507 flow [2025-04-13 20:07:27,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 110 transitions, 1486 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:07:27,735 INFO L231 Difference]: Finished difference. Result has 115 places, 89 transitions, 1159 flow [2025-04-13 20:07:27,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1159, PETRI_PLACES=115, PETRI_TRANSITIONS=89} [2025-04-13 20:07:27,736 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 85 predicate places. [2025-04-13 20:07:27,736 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 89 transitions, 1159 flow [2025-04-13 20:07:27,736 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-13 20:07:27,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:27,736 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-13 20:07:27,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:07:27,736 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-13 20:07:27,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2114327797, now seen corresponding path program 1 times [2025-04-13 20:07:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:27,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584607514] [2025-04-13 20:07:27,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:27,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:07:27,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:07:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:27,782 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-13 20:07:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:27,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584607514] [2025-04-13 20:07:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584607514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:27,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076797982] [2025-04-13 20:07:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:27,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:27,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:27,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:27,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:27,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 89 transitions, 1159 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-13 20:07:27,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:27,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:27,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:27,964 INFO L116 PetriNetUnfolderBase]: 707/1150 cut-off events. [2025-04-13 20:07:27,964 INFO L117 PetriNetUnfolderBase]: For 6844/6844 co-relation queries the response was YES. [2025-04-13 20:07:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 1150 events. 707/1150 cut-off events. For 6844/6844 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4815 event pairs, 116 based on Foata normal form. 8/1156 useless extension candidates. Maximal degree in co-relation 5748. Up to 992 conditions per place. [2025-04-13 20:07:27,969 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 72 selfloop transitions, 6 changer transitions 11/89 dead transitions. [2025-04-13 20:07:27,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 89 transitions, 1238 flow [2025-04-13 20:07:27,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:07:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:07:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-13 20:07:27,969 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-04-13 20:07:27,969 INFO L175 Difference]: Start difference. First operand has 115 places, 89 transitions, 1159 flow. Second operand 4 states and 52 transitions. [2025-04-13 20:07:27,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 89 transitions, 1238 flow [2025-04-13 20:07:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 89 transitions, 1212 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-04-13 20:07:27,980 INFO L231 Difference]: Finished difference. Result has 101 places, 72 transitions, 912 flow [2025-04-13 20:07:27,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=912, PETRI_PLACES=101, PETRI_TRANSITIONS=72} [2025-04-13 20:07:27,981 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 71 predicate places. [2025-04-13 20:07:27,981 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 72 transitions, 912 flow [2025-04-13 20:07:27,981 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-13 20:07:27,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:27,981 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-13 20:07:27,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 20:07:27,981 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-13 20:07:27,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:27,981 INFO L85 PathProgramCache]: Analyzing trace with hash 649186831, now seen corresponding path program 1 times [2025-04-13 20:07:27,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:27,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953624649] [2025-04-13 20:07:27,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:27,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:27,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:07:28,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:28,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:28,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:29,150 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-13 20:07:29,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:29,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953624649] [2025-04-13 20:07:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953624649] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:07:29,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215896328] [2025-04-13 20:07:29,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:29,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:07:29,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:07:29,153 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-13 20:07:29,153 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-13 20:07:29,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:07:29,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:29,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:29,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:29,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:07:29,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:07:30,020 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 20:07:30,020 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-13 20:07:30,445 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-13 20:07:30,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:07:31,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:07:31,198 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-13 20:07:32,788 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-13 20:07:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215896328] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:07:32,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:07:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 20:07:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147178948] [2025-04-13 20:07:32,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:07:32,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:07:32,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:07:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1201, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:07:32,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:32,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 72 transitions, 912 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-13 20:07:32,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:32,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:32,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:39,153 INFO L116 PetriNetUnfolderBase]: 3490/5447 cut-off events. [2025-04-13 20:07:39,154 INFO L117 PetriNetUnfolderBase]: For 31124/31124 co-relation queries the response was YES. [2025-04-13 20:07:39,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24611 conditions, 5447 events. 3490/5447 cut-off events. For 31124/31124 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 30311 event pairs, 257 based on Foata normal form. 5/5448 useless extension candidates. Maximal degree in co-relation 24586. Up to 1043 conditions per place. [2025-04-13 20:07:39,176 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 652 selfloop transitions, 254 changer transitions 18/924 dead transitions. [2025-04-13 20:07:39,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 924 transitions, 10915 flow [2025-04-13 20:07:39,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 20:07:39,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-04-13 20:07:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 857 transitions. [2025-04-13 20:07:39,178 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35094185094185093 [2025-04-13 20:07:39,178 INFO L175 Difference]: Start difference. First operand has 101 places, 72 transitions, 912 flow. Second operand 74 states and 857 transitions. [2025-04-13 20:07:39,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 924 transitions, 10915 flow [2025-04-13 20:07:39,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 924 transitions, 10038 flow, removed 128 selfloop flow, removed 8 redundant places. [2025-04-13 20:07:39,233 INFO L231 Difference]: Finished difference. Result has 214 places, 340 transitions, 4811 flow [2025-04-13 20:07:39,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=84, 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=4811, PETRI_PLACES=214, PETRI_TRANSITIONS=340} [2025-04-13 20:07:39,233 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2025-04-13 20:07:39,233 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 340 transitions, 4811 flow [2025-04-13 20:07:39,233 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-13 20:07:39,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:39,234 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-13 20:07:39,239 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-13 20:07:39,434 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,SelfDestructingSolverStorable40 [2025-04-13 20:07:39,434 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-13 20:07:39,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 617907787, now seen corresponding path program 2 times [2025-04-13 20:07:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:39,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010674491] [2025-04-13 20:07:39,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:39,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:07:39,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:07:39,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:07:39,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:40,341 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-13 20:07:40,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:40,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010674491] [2025-04-13 20:07:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010674491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:40,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:40,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:07:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682549437] [2025-04-13 20:07:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:40,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:07:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:40,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:07:40,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:07:40,342 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:40,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 340 transitions, 4811 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-13 20:07:40,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:40,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:40,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:41,985 INFO L116 PetriNetUnfolderBase]: 5253/7818 cut-off events. [2025-04-13 20:07:41,985 INFO L117 PetriNetUnfolderBase]: For 144932/144932 co-relation queries the response was YES. [2025-04-13 20:07:42,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58866 conditions, 7818 events. 5253/7818 cut-off events. For 144932/144932 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 42644 event pairs, 296 based on Foata normal form. 4/7822 useless extension candidates. Maximal degree in co-relation 58789. Up to 2725 conditions per place. [2025-04-13 20:07:42,048 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 301 selfloop transitions, 524 changer transitions 3/828 dead transitions. [2025-04-13 20:07:42,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 828 transitions, 13098 flow [2025-04-13 20:07:42,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:07:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:07:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 199 transitions. [2025-04-13 20:07:42,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.335016835016835 [2025-04-13 20:07:42,049 INFO L175 Difference]: Start difference. First operand has 214 places, 340 transitions, 4811 flow. Second operand 18 states and 199 transitions. [2025-04-13 20:07:42,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 828 transitions, 13098 flow [2025-04-13 20:07:42,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 828 transitions, 12392 flow, removed 350 selfloop flow, removed 5 redundant places. [2025-04-13 20:07:42,697 INFO L231 Difference]: Finished difference. Result has 235 places, 734 transitions, 11919 flow [2025-04-13 20:07:42,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4507, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11919, PETRI_PLACES=235, PETRI_TRANSITIONS=734} [2025-04-13 20:07:42,698 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 205 predicate places. [2025-04-13 20:07:42,698 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 734 transitions, 11919 flow [2025-04-13 20:07:42,698 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-13 20:07:42,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:42,698 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-13 20:07:42,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 20:07:42,698 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-13 20:07:42,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:42,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1906917097, now seen corresponding path program 1 times [2025-04-13 20:07:42,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:42,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312433265] [2025-04-13 20:07:42,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:42,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:42,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:07:42,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:42,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:42,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:42,867 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-13 20:07:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:42,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312433265] [2025-04-13 20:07:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312433265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:07:42,867 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644212209] [2025-04-13 20:07:42,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:07:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:07:42,869 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-13 20:07:42,871 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-13 20:07:42,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:07:42,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:42,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:42,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:42,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 20:07:42,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:07:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:07:43,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:07:43,256 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:07:43,261 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-13 20:07:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:07:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644212209] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:07:43,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:07:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-13 20:07:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540621678] [2025-04-13 20:07:43,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:07:43,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:07:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:43,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:07:43,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:07:43,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:43,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 734 transitions, 11919 flow. Second operand has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 23 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-13 20:07:43,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:43,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:43,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:45,389 INFO L116 PetriNetUnfolderBase]: 5309/8094 cut-off events. [2025-04-13 20:07:45,390 INFO L117 PetriNetUnfolderBase]: For 254105/254105 co-relation queries the response was YES. [2025-04-13 20:07:45,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73870 conditions, 8094 events. 5309/8094 cut-off events. For 254105/254105 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 46597 event pairs, 701 based on Foata normal form. 386/8480 useless extension candidates. Maximal degree in co-relation 73785. Up to 2507 conditions per place. [2025-04-13 20:07:45,454 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 578 selfloop transitions, 118 changer transitions 404/1100 dead transitions. [2025-04-13 20:07:45,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1100 transitions, 21659 flow [2025-04-13 20:07:45,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:07:45,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:07:45,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2025-04-13 20:07:45,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4080808080808081 [2025-04-13 20:07:45,455 INFO L175 Difference]: Start difference. First operand has 235 places, 734 transitions, 11919 flow. Second operand 15 states and 202 transitions. [2025-04-13 20:07:45,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1100 transitions, 21659 flow [2025-04-13 20:07:47,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 1100 transitions, 18986 flow, removed 1257 selfloop flow, removed 6 redundant places. [2025-04-13 20:07:47,977 INFO L231 Difference]: Finished difference. Result has 251 places, 561 transitions, 9026 flow [2025-04-13 20:07:47,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10937, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=9026, PETRI_PLACES=251, PETRI_TRANSITIONS=561} [2025-04-13 20:07:47,978 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2025-04-13 20:07:47,978 INFO L485 AbstractCegarLoop]: Abstraction has has 251 places, 561 transitions, 9026 flow [2025-04-13 20:07:47,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 23 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-13 20:07:47,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:47,978 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-13 20:07:47,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:07:48,178 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-13 20:07:48,179 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-13 20:07:48,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash 195211953, now seen corresponding path program 3 times [2025-04-13 20:07:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:48,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605987493] [2025-04-13 20:07:48,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:07:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:48,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:07:48,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:07:48,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:07:48,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:49,189 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-13 20:07:49,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:49,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605987493] [2025-04-13 20:07:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605987493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:49,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:07:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602068523] [2025-04-13 20:07:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:49,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:07:49,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:49,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:07:49,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:07:49,190 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:07:49,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 561 transitions, 9026 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-13 20:07:49,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:49,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:07:49,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:50,963 INFO L116 PetriNetUnfolderBase]: 5072/7452 cut-off events. [2025-04-13 20:07:50,963 INFO L117 PetriNetUnfolderBase]: For 211351/211351 co-relation queries the response was YES. [2025-04-13 20:07:51,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65609 conditions, 7452 events. 5072/7452 cut-off events. For 211351/211351 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39775 event pairs, 193 based on Foata normal form. 4/7456 useless extension candidates. Maximal degree in co-relation 65518. Up to 1567 conditions per place. [2025-04-13 20:07:51,041 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 243 selfloop transitions, 616 changer transitions 3/862 dead transitions. [2025-04-13 20:07:51,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 862 transitions, 15442 flow [2025-04-13 20:07:51,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:07:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:07:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 237 transitions. [2025-04-13 20:07:51,042 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2025-04-13 20:07:51,043 INFO L175 Difference]: Start difference. First operand has 251 places, 561 transitions, 9026 flow. Second operand 20 states and 237 transitions. [2025-04-13 20:07:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 862 transitions, 15442 flow [2025-04-13 20:07:52,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 862 transitions, 14515 flow, removed 251 selfloop flow, removed 32 redundant places. [2025-04-13 20:07:52,207 INFO L231 Difference]: Finished difference. Result has 229 places, 755 transitions, 13672 flow [2025-04-13 20:07:52,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=8556, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=433, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=13672, PETRI_PLACES=229, PETRI_TRANSITIONS=755} [2025-04-13 20:07:52,208 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2025-04-13 20:07:52,208 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 755 transitions, 13672 flow [2025-04-13 20:07:52,208 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-13 20:07:52,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:52,208 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-13 20:07:52,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 20:07:52,208 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-13 20:07:52,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash -711821859, now seen corresponding path program 4 times [2025-04-13 20:07:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:52,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750838014] [2025-04-13 20:07:52,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:07:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:52,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:07:52,236 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:52,236 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:07:52,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:52,937 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-13 20:07:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:52,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750838014] [2025-04-13 20:07:52,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750838014] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:07:52,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661086885] [2025-04-13 20:07:52,938 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:07:52,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:07:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:07:52,940 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-13 20:07:52,940 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-13 20:07:52,993 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:07:53,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:07:53,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:07:53,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:53,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:07:53,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:07:53,623 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 20:07:53,623 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-13 20:07:54,069 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-13 20:07:54,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:07:54,790 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:07:54,791 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-13 20:08:32,336 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-13 20:08:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661086885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:08:32,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:08:32,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 20:08:32,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057274377] [2025-04-13 20:08:32,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:08:32,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:08:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:32,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:08:32,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:08:32,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:08:32,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 755 transitions, 13672 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-13 20:08:32,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:32,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:08:32,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:36,559 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-13 20:08:41,522 INFO L116 PetriNetUnfolderBase]: 5149/7577 cut-off events. [2025-04-13 20:08:41,522 INFO L117 PetriNetUnfolderBase]: For 201989/201989 co-relation queries the response was YES. [2025-04-13 20:08:41,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69481 conditions, 7577 events. 5149/7577 cut-off events. For 201989/201989 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 40646 event pairs, 370 based on Foata normal form. 5/7582 useless extension candidates. Maximal degree in co-relation 69401. Up to 1742 conditions per place. [2025-04-13 20:08:41,591 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 836 selfloop transitions, 470 changer transitions 17/1323 dead transitions. [2025-04-13 20:08:41,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1323 transitions, 25181 flow [2025-04-13 20:08:41,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 20:08:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-13 20:08:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 538 transitions. [2025-04-13 20:08:41,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3327149041434756 [2025-04-13 20:08:41,592 INFO L175 Difference]: Start difference. First operand has 229 places, 755 transitions, 13672 flow. Second operand 49 states and 538 transitions. [2025-04-13 20:08:41,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 1323 transitions, 25181 flow [2025-04-13 20:08:43,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1323 transitions, 23984 flow, removed 591 selfloop flow, removed 2 redundant places. [2025-04-13 20:08:43,161 INFO L231 Difference]: Finished difference. Result has 284 places, 782 transitions, 14790 flow [2025-04-13 20:08:43,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=13346, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=14790, PETRI_PLACES=284, PETRI_TRANSITIONS=782} [2025-04-13 20:08:43,162 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 254 predicate places. [2025-04-13 20:08:43,162 INFO L485 AbstractCegarLoop]: Abstraction has has 284 places, 782 transitions, 14790 flow [2025-04-13 20:08:43,163 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-13 20:08:43,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:43,163 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-13 20:08:43,169 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-13 20:08:43,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:08:43,363 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-13 20:08:43,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1534422983, now seen corresponding path program 5 times [2025-04-13 20:08:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:43,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418425883] [2025-04-13 20:08:43,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:08:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:43,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:08:43,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:08:43,390 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:08:43,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:44,140 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-13 20:08:44,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:44,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418425883] [2025-04-13 20:08:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418425883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:08:44,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222326731] [2025-04-13 20:08:44,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:08:44,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:08:44,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:08:44,142 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-13 20:08:44,143 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-13 20:08:44,198 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:08:44,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:08:44,218 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:08:44,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:44,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:08:44,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:08:44,780 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 20:08:44,780 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-13 20:08:45,040 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-13 20:08:45,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:08:45,700 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:08:45,700 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-13 20:09:19,086 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-13 20:09:19,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222326731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:09:19,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:09:19,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2025-04-13 20:09:19,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034296741] [2025-04-13 20:09:19,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:09:19,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:09:19,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:09:19,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:09:19,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:09:19,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:09:19,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 782 transitions, 14790 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-13 20:09:19,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:09:19,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:09:19,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:09:23,349 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-13 20:09:27,449 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-13 20:09:36,037 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-13 20:09:41,214 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-13 20:09:45,266 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-13 20:09:49,678 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-13 20:09:54,561 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:09:57,433 INFO L116 PetriNetUnfolderBase]: 12772/18630 cut-off events. [2025-04-13 20:09:57,433 INFO L117 PetriNetUnfolderBase]: For 504178/504178 co-relation queries the response was YES. [2025-04-13 20:09:57,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169826 conditions, 18630 events. 12772/18630 cut-off events. For 504178/504178 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 111484 event pairs, 875 based on Foata normal form. 9/18639 useless extension candidates. Maximal degree in co-relation 169736. Up to 4733 conditions per place. [2025-04-13 20:09:57,684 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 1329 selfloop transitions, 1148 changer transitions 22/2499 dead transitions. [2025-04-13 20:09:57,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 2499 transitions, 49375 flow [2025-04-13 20:09:57,684 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:09:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:09:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 659 transitions. [2025-04-13 20:09:57,686 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3328282828282828 [2025-04-13 20:09:57,686 INFO L175 Difference]: Start difference. First operand has 284 places, 782 transitions, 14790 flow. Second operand 60 states and 659 transitions. [2025-04-13 20:09:57,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 2499 transitions, 49375 flow [2025-04-13 20:10:03,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 2499 transitions, 47890 flow, removed 116 selfloop flow, removed 25 redundant places. [2025-04-13 20:10:03,131 INFO L231 Difference]: Finished difference. Result has 354 places, 1637 transitions, 34886 flow [2025-04-13 20:10:03,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=14293, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=782, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=34886, PETRI_PLACES=354, PETRI_TRANSITIONS=1637} [2025-04-13 20:10:03,132 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 324 predicate places. [2025-04-13 20:10:03,132 INFO L485 AbstractCegarLoop]: Abstraction has has 354 places, 1637 transitions, 34886 flow [2025-04-13 20:10:03,133 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-13 20:10:03,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:03,133 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-13 20:10:03,140 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-13 20:10:03,334 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,SelfDestructingSolverStorable45 [2025-04-13 20:10:03,334 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-13 20:10:03,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1237329309, now seen corresponding path program 6 times [2025-04-13 20:10:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:03,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160824145] [2025-04-13 20:10:03,334 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:10:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:03,341 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:10:03,356 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:10:03,356 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:10:03,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:04,021 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-13 20:10:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:04,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160824145] [2025-04-13 20:10:04,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160824145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:04,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:04,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:10:04,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061025430] [2025-04-13 20:10:04,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:04,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:10:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:04,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:10:04,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:10:04,022 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:10:04,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 1637 transitions, 34886 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-13 20:10:04,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:04,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:10:04,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:10,204 INFO L116 PetriNetUnfolderBase]: 13178/19344 cut-off events. [2025-04-13 20:10:10,204 INFO L117 PetriNetUnfolderBase]: For 632814/632814 co-relation queries the response was YES. [2025-04-13 20:10:10,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191871 conditions, 19344 events. 13178/19344 cut-off events. For 632814/632814 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 119406 event pairs, 529 based on Foata normal form. 9/19353 useless extension candidates. Maximal degree in co-relation 191744. Up to 4405 conditions per place. [2025-04-13 20:10:10,505 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 520 selfloop transitions, 1296 changer transitions 6/1822 dead transitions. [2025-04-13 20:10:10,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 1822 transitions, 41680 flow [2025-04-13 20:10:10,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:10:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:10:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 201 transitions. [2025-04-13 20:10:10,507 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3582887700534759 [2025-04-13 20:10:10,507 INFO L175 Difference]: Start difference. First operand has 354 places, 1637 transitions, 34886 flow. Second operand 17 states and 201 transitions. [2025-04-13 20:10:10,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 1822 transitions, 41680 flow [2025-04-13 20:10:19,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1822 transitions, 40447 flow, removed 492 selfloop flow, removed 17 redundant places. [2025-04-13 20:10:19,312 INFO L231 Difference]: Finished difference. Result has 355 places, 1686 transitions, 37773 flow [2025-04-13 20:10:19,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=33750, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=37773, PETRI_PLACES=355, PETRI_TRANSITIONS=1686} [2025-04-13 20:10:19,313 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 325 predicate places. [2025-04-13 20:10:19,313 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 1686 transitions, 37773 flow [2025-04-13 20:10:19,314 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-13 20:10:19,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:19,314 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-13 20:10:19,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 20:10:19,314 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-13 20:10:19,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1574865955, now seen corresponding path program 7 times [2025-04-13 20:10:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:19,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845292264] [2025-04-13 20:10:19,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:10:19,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:19,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:10:19,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:10:19,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:10:19,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:20,224 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-13 20:10:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:20,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845292264] [2025-04-13 20:10:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845292264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:10:20,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289317340] [2025-04-13 20:10:20,225 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:10:20,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:10:20,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:10:20,227 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-13 20:10:20,227 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-13 20:10:20,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:10:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:10:20,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:10:20,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:10:20,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:10:21,063 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 20:10:21,064 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-13 20:10:21,427 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-13 20:10:21,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:10:26,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:10:26,162 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-13 20:10:26,897 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-13 20:10:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289317340] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:10:26,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:10:26,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 20:10:26,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235019971] [2025-04-13 20:10:26,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:10:26,897 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:10:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:26,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:10:26,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1178, Unknown=1, NotChecked=0, Total=1406 [2025-04-13 20:10:26,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:10:26,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1686 transitions, 37773 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-13 20:10:26,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:26,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:10:26,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:35,337 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-13 20:10:39,363 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-13 20:10:45,206 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-13 20:10:49,438 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-13 20:10:53,565 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-13 20:10:55,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 20:11:01,595 INFO L116 PetriNetUnfolderBase]: 13362/19612 cut-off events. [2025-04-13 20:11:01,596 INFO L117 PetriNetUnfolderBase]: For 662474/662474 co-relation queries the response was YES. [2025-04-13 20:11:01,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202790 conditions, 19612 events. 13362/19612 cut-off events. For 662474/662474 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 120379 event pairs, 972 based on Foata normal form. 9/19621 useless extension candidates. Maximal degree in co-relation 202664. Up to 5439 conditions per place. [2025-04-13 20:11:01,862 INFO L140 encePairwiseOnDemand]: 16/33 looper letters, 1184 selfloop transitions, 1205 changer transitions 21/2410 dead transitions. [2025-04-13 20:11:01,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 2410 transitions, 55345 flow [2025-04-13 20:11:01,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 20:11:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-04-13 20:11:01,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 585 transitions. [2025-04-13 20:11:01,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3344768439108062 [2025-04-13 20:11:01,864 INFO L175 Difference]: Start difference. First operand has 355 places, 1686 transitions, 37773 flow. Second operand 53 states and 585 transitions. [2025-04-13 20:11:01,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 2410 transitions, 55345 flow [2025-04-13 20:11:10,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 2410 transitions, 53649 flow, removed 55 selfloop flow, removed 9 redundant places. [2025-04-13 20:11:10,961 INFO L231 Difference]: Finished difference. Result has 417 places, 1839 transitions, 43208 flow [2025-04-13 20:11:10,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=36468, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=43208, PETRI_PLACES=417, PETRI_TRANSITIONS=1839} [2025-04-13 20:11:10,962 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 387 predicate places. [2025-04-13 20:11:10,962 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 1839 transitions, 43208 flow [2025-04-13 20:11:10,962 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-13 20:11:10,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:10,963 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-13 20:11:10,970 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-13 20:11:11,163 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,SelfDestructingSolverStorable47 [2025-04-13 20:11:11,163 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-13 20:11:11,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:11,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1096868043, now seen corresponding path program 8 times [2025-04-13 20:11:11,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:11,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174456913] [2025-04-13 20:11:11,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:11:11,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:11,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:11:11,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:11:11,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:11:11,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:11,895 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-13 20:11:11,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:11,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174456913] [2025-04-13 20:11:11,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174456913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:11,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:11,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:11:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122958960] [2025-04-13 20:11:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:11,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:11:11,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:11,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:11:11,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:11:11,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:11:11,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 1839 transitions, 43208 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-13 20:11:11,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:11,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:11:11,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:19,683 INFO L116 PetriNetUnfolderBase]: 15415/22658 cut-off events. [2025-04-13 20:11:19,683 INFO L117 PetriNetUnfolderBase]: For 832317/832317 co-relation queries the response was YES. [2025-04-13 20:11:19,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237981 conditions, 22658 events. 15415/22658 cut-off events. For 832317/832317 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 143930 event pairs, 956 based on Foata normal form. 9/22667 useless extension candidates. Maximal degree in co-relation 237837. Up to 5966 conditions per place. [2025-04-13 20:11:20,017 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 987 selfloop transitions, 1363 changer transitions 3/2353 dead transitions. [2025-04-13 20:11:20,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2353 transitions, 58675 flow [2025-04-13 20:11:20,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:11:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:11:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 179 transitions. [2025-04-13 20:11:20,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3390151515151515 [2025-04-13 20:11:20,018 INFO L175 Difference]: Start difference. First operand has 417 places, 1839 transitions, 43208 flow. Second operand 16 states and 179 transitions. [2025-04-13 20:11:20,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 2353 transitions, 58675 flow [2025-04-13 20:11:33,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 2353 transitions, 56617 flow, removed 208 selfloop flow, removed 31 redundant places. [2025-04-13 20:11:33,424 INFO L231 Difference]: Finished difference. Result has 407 places, 2187 transitions, 52943 flow [2025-04-13 20:11:33,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=41493, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1839, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=52943, PETRI_PLACES=407, PETRI_TRANSITIONS=2187} [2025-04-13 20:11:33,425 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 377 predicate places. [2025-04-13 20:11:33,425 INFO L485 AbstractCegarLoop]: Abstraction has has 407 places, 2187 transitions, 52943 flow [2025-04-13 20:11:33,426 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-13 20:11:33,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:33,426 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-13 20:11:33,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 20:11:33,426 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:11:33,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash 912208821, now seen corresponding path program 9 times [2025-04-13 20:11:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:33,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934841009] [2025-04-13 20:11:33,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:11:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:33,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:11:33,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:11:33,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:11:33,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:34,123 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-13 20:11:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:34,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934841009] [2025-04-13 20:11:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934841009] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 20:11:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572868007] [2025-04-13 20:11:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:34,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:11:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:34,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:11:34,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:11:34,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2025-04-13 20:11:34,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 2187 transitions, 52943 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-13 20:11:34,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:34,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2025-04-13 20:11:34,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:43,507 INFO L116 PetriNetUnfolderBase]: 16793/24888 cut-off events. [2025-04-13 20:11:43,508 INFO L117 PetriNetUnfolderBase]: For 1029372/1029372 co-relation queries the response was YES. [2025-04-13 20:11:43,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278584 conditions, 24888 events. 16793/24888 cut-off events. For 1029372/1029372 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 162014 event pairs, 974 based on Foata normal form. 9/24897 useless extension candidates. Maximal degree in co-relation 278433. Up to 5017 conditions per place. [2025-04-13 20:11:44,067 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 955 selfloop transitions, 1514 changer transitions 11/2480 dead transitions. [2025-04-13 20:11:44,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 2480 transitions, 63892 flow [2025-04-13 20:11:44,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:11:44,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:11:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-04-13 20:11:44,068 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3682983682983683 [2025-04-13 20:11:44,069 INFO L175 Difference]: Start difference. First operand has 407 places, 2187 transitions, 52943 flow. Second operand 13 states and 158 transitions. [2025-04-13 20:11:44,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 2480 transitions, 63892 flow [2025-04-13 20:12:03,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 2480 transitions, 63072 flow, removed 146 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:03,820 INFO L231 Difference]: Finished difference. Result has 421 places, 2328 transitions, 59895 flow [2025-04-13 20:12:03,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=52129, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=764, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=59895, PETRI_PLACES=421, PETRI_TRANSITIONS=2328} [2025-04-13 20:12:03,822 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 391 predicate places. [2025-04-13 20:12:03,822 INFO L485 AbstractCegarLoop]: Abstraction has has 421 places, 2328 transitions, 59895 flow [2025-04-13 20:12:03,822 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-13 20:12:03,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:03,822 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-13 20:12:03,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 20:12:03,822 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:12:03,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1096273397, now seen corresponding path program 10 times [2025-04-13 20:12:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:03,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616490125] [2025-04-13 20:12:03,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:03,829 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:12:03,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:12:03,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:03,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:04,969 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-13 20:12:04,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:04,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616490125] [2025-04-13 20:12:04,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616490125] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:12:04,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004887315] [2025-04-13 20:12:04,969 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:04,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:12:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:12:04,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:12:04,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:12:05,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:12:05,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:12:05,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:05,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:05,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 20:12:05,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:12:05,952 INFO L325 Elim1Store]: treesize reduction 3, result has 98.3 percent of original size [2025-04-13 20:12:05,953 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-13 20:12:06,298 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-13 20:12:06,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:12:07,168 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:12:07,169 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-13 20:14:38,391 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-13 20:14:38,393 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:14:38,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 20:14:38,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:14:38,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:14:38,603 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$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.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) ... 85 more [2025-04-13 20:14:38,610 INFO L158 Benchmark]: Toolchain (without parser) took 514749.04ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 90.1MB in the beginning and 652.4MB in the end (delta: -562.3MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2025-04-13 20:14:38,610 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:14:38,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.73ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 74.2MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:14:38,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.42ms. Allocated memory is still 125.8MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:14:38,610 INFO L158 Benchmark]: Boogie Preprocessor took 39.84ms. Allocated memory is still 125.8MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:14:38,610 INFO L158 Benchmark]: RCFGBuilder took 712.39ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 37.6MB in the end (delta: 32.0MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. [2025-04-13 20:14:38,614 INFO L158 Benchmark]: TraceAbstraction took 513692.49ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 36.9MB in the beginning and 652.4MB in the end (delta: -615.5MB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-13 20:14:38,616 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.16ms. Allocated memory is still 167.8MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.73ms. Allocated memory is still 125.8MB. Free memory was 89.7MB in the beginning and 74.2MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.42ms. Allocated memory is still 125.8MB. Free memory was 74.2MB in the beginning and 72.1MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.84ms. Allocated memory is still 125.8MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 712.39ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 37.6MB in the end (delta: 32.0MB). Peak memory consumption was 56.7MB. Max. memory is 8.0GB. * TraceAbstraction took 513692.49ms. Allocated memory was 125.8MB in the beginning and 813.7MB in the end (delta: 687.9MB). Free memory was 36.9MB in the beginning and 652.4MB in the end (delta: -615.5MB). 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...