/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-poker-hand-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:03:53,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:03:53,239 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:03:53,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:03:53,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:03:53,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:03:53,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:03:53,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:03:53,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:03:53,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:03:53,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:03:53,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:03:53,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:03:53,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:03:53,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:03:53,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:53,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:53,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:03:53,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:03:53,264 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:03:53,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:03:53,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:03:53,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:03:53,478 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:03:53,479 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:03:53,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-13 20:03:54,673 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c86dab0/ea2129dce1c0431bb8262c2a551e5ed0/FLAG793bb3415 [2025-04-13 20:03:54,908 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:03:54,909 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-13 20:03:54,920 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c86dab0/ea2129dce1c0431bb8262c2a551e5ed0/FLAG793bb3415 [2025-04-13 20:03:55,873 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35c86dab0/ea2129dce1c0431bb8262c2a551e5ed0 [2025-04-13 20:03:55,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:03:55,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:03:55,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:03:55,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:03:55,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:03:55,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:03:55" (1/1) ... [2025-04-13 20:03:55,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@528b11d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:55, skipping insertion in model container [2025-04-13 20:03:55,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:03:55" (1/1) ... [2025-04-13 20:03:55,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:03:56,099 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-poker-hand-subst.wvr.c[19288,19301] [2025-04-13 20:03:56,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:03:56,115 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:03:56,194 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-poker-hand-subst.wvr.c[19288,19301] [2025-04-13 20:03:56,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:03:56,205 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:03:56,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56 WrapperNode [2025-04-13 20:03:56,206 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:03:56,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:03:56,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:03:56,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:03:56,215 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:03:56" (1/1) ... [2025-04-13 20:03:56,239 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:03:56" (1/1) ... [2025-04-13 20:03:56,306 INFO L138 Inliner]: procedures = 25, calls = 439, calls flagged for inlining = 100, calls inlined = 144, statements flattened = 2348 [2025-04-13 20:03:56,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:03:56,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:03:56,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:03:56,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:03:56,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,366 INFO L175 MemorySlicer]: Split 278 memory accesses to 2 slices as follows [2, 276]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-04-13 20:03:56,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:03:56,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:03:56,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:03:56,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:03:56,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (1/1) ... [2025-04-13 20:03:56,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:03:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:03:56,479 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:03:56,481 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:03:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:03:56,501 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:03:56,501 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:03:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:03:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:03:56,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:03:56,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:03:56,505 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:03:56,677 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:03:56,678 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:03:58,383 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:03:58,383 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:03:58,384 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:04:00,573 INFO L313 CfgBuilder]: Removed 6 assume(true) statements. [2025-04-13 20:04:00,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:04:00 BoogieIcfgContainer [2025-04-13 20:04:00,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:04:00,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:04:00,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:04:00,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:04:00,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:03:55" (1/3) ... [2025-04-13 20:04:00,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687034a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:04:00, skipping insertion in model container [2025-04-13 20:04:00,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:03:56" (2/3) ... [2025-04-13 20:04:00,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687034a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:04:00, skipping insertion in model container [2025-04-13 20:04:00,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:04:00" (3/3) ... [2025-04-13 20:04:00,583 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-subst.wvr.c [2025-04-13 20:04:00,594 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:04:00,596 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-poker-hand-subst.wvr.c that has 4 procedures, 73 locations, 105 edges, 1 initial locations, 18 loop locations, and 1 error locations. [2025-04-13 20:04:00,596 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:04:00,932 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:04:00,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 237 flow [2025-04-13 20:04:01,056 INFO L116 PetriNetUnfolderBase]: 36/105 cut-off events. [2025-04-13 20:04:01,059 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:04:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 36/105 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 286 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2025-04-13 20:04:01,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 108 transitions, 237 flow [2025-04-13 20:04:01,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 104 transitions, 226 flow [2025-04-13 20:04:01,073 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:04:01,081 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;@694df25d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:04:01,081 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:04:01,154 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:04:01,155 INFO L116 PetriNetUnfolderBase]: 36/103 cut-off events. [2025-04-13 20:04:01,155 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:04:01,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:01,157 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:01,157 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:04:01,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1943748271, now seen corresponding path program 1 times [2025-04-13 20:04:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:01,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783087994] [2025-04-13 20:04:01,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:01,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 20:04:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 20:04:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:04:01,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:01,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783087994] [2025-04-13 20:04:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783087994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:04:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:04:01,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:04:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444373480] [2025-04-13 20:04:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:04:01,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:04:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:01,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:04:01,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:04:01,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:01,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 104 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:04:01,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:01,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:01,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:08,984 INFO L116 PetriNetUnfolderBase]: 33522/42548 cut-off events. [2025-04-13 20:04:08,984 INFO L117 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2025-04-13 20:04:09,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85920 conditions, 42548 events. 33522/42548 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 1941. Compared 206377 event pairs, 20430 based on Foata normal form. 0/29456 useless extension candidates. Maximal degree in co-relation 83516. Up to 42546 conditions per place. [2025-04-13 20:04:09,135 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 101 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2025-04-13 20:04:09,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 107 transitions, 446 flow [2025-04-13 20:04:09,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:04:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:04:09,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2025-04-13 20:04:09,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36728395061728397 [2025-04-13 20:04:09,147 INFO L175 Difference]: Start difference. First operand has 78 places, 104 transitions, 226 flow. Second operand 3 states and 119 transitions. [2025-04-13 20:04:09,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 107 transitions, 446 flow [2025-04-13 20:04:09,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 107 transitions, 434 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:04:09,169 INFO L231 Difference]: Finished difference. Result has 75 places, 107 transitions, 246 flow [2025-04-13 20:04:09,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=75, PETRI_TRANSITIONS=107} [2025-04-13 20:04:09,173 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-04-13 20:04:09,173 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 107 transitions, 246 flow [2025-04-13 20:04:09,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:04:09,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:09,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:09,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:04:09,174 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:04:09,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1585394221, now seen corresponding path program 1 times [2025-04-13 20:04:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:09,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248877892] [2025-04-13 20:04:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:09,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 20:04:09,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 20:04:09,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:09,438 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:04:09,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:09,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248877892] [2025-04-13 20:04:09,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248877892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:04:09,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:04:09,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:04:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957702104] [2025-04-13 20:04:09,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:04:09,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:04:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:09,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:04:09,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:04:09,440 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:09,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 107 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:04:09,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:09,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:09,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:15,939 INFO L116 PetriNetUnfolderBase]: 33522/42554 cut-off events. [2025-04-13 20:04:15,939 INFO L117 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-04-13 20:04:15,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85398 conditions, 42554 events. 33522/42554 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 205505 event pairs, 20430 based on Foata normal form. 0/29465 useless extension candidates. Maximal degree in co-relation 85355. Up to 42549 conditions per place. [2025-04-13 20:04:16,075 INFO L140 encePairwiseOnDemand]: 95/108 looper letters, 101 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2025-04-13 20:04:16,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 484 flow [2025-04-13 20:04:16,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:04:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:04:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2025-04-13 20:04:16,078 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38580246913580246 [2025-04-13 20:04:16,078 INFO L175 Difference]: Start difference. First operand has 75 places, 107 transitions, 246 flow. Second operand 3 states and 125 transitions. [2025-04-13 20:04:16,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 484 flow [2025-04-13 20:04:16,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:04:16,080 INFO L231 Difference]: Finished difference. Result has 77 places, 113 transitions, 302 flow [2025-04-13 20:04:16,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=77, PETRI_TRANSITIONS=113} [2025-04-13 20:04:16,081 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-04-13 20:04:16,081 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 302 flow [2025-04-13 20:04:16,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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:04:16,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:16,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:16,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:04:16,084 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:04:16,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 52142836, now seen corresponding path program 1 times [2025-04-13 20:04:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:16,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045097418] [2025-04-13 20:04:16,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:16,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:04:16,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:04:16,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:16,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 20:04:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:16,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045097418] [2025-04-13 20:04:16,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045097418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:16,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455632698] [2025-04-13 20:04:16,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:16,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:16,335 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:04:16,335 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:04:16,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 20:04:16,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 20:04:16,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:16,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:16,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:04:16,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 20:04:16,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:04:16,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455632698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:04:16,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:04:16,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-04-13 20:04:16,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427027787] [2025-04-13 20:04:16,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:04:16,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:04:16,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:04:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:04:16,912 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:16,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:04:16,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:16,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:16,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:23,201 INFO L116 PetriNetUnfolderBase]: 33522/42557 cut-off events. [2025-04-13 20:04:23,202 INFO L117 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2025-04-13 20:04:23,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85427 conditions, 42557 events. 33522/42557 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 1853. Compared 205455 event pairs, 20430 based on Foata normal form. 1/29473 useless extension candidates. Maximal degree in co-relation 85373. Up to 42552 conditions per place. [2025-04-13 20:04:23,306 INFO L140 encePairwiseOnDemand]: 96/108 looper letters, 104 selfloop transitions, 12 changer transitions 0/116 dead transitions. [2025-04-13 20:04:23,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 116 transitions, 540 flow [2025-04-13 20:04:23,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:04:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:04:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-04-13 20:04:23,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3765432098765432 [2025-04-13 20:04:23,307 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 302 flow. Second operand 3 states and 122 transitions. [2025-04-13 20:04:23,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 116 transitions, 540 flow [2025-04-13 20:04:23,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 116 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:04:23,309 INFO L231 Difference]: Finished difference. Result has 79 places, 116 transitions, 338 flow [2025-04-13 20:04:23,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=79, PETRI_TRANSITIONS=116} [2025-04-13 20:04:23,310 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-04-13 20:04:23,310 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 116 transitions, 338 flow [2025-04-13 20:04:23,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:04:23,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:23,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:23,319 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:04:23,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:23,511 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:04:23,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1582593496, now seen corresponding path program 1 times [2025-04-13 20:04:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:23,512 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207202279] [2025-04-13 20:04:23,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:23,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:04:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:04:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 20:04:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:23,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207202279] [2025-04-13 20:04:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207202279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:23,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170433985] [2025-04-13 20:04:23,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:23,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:23,738 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:04:23,739 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:04:24,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 20:04:24,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 20:04:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:24,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 20:04:24,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 20:04:24,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 20:04:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170433985] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:24,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 20:04:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281729254] [2025-04-13 20:04:24,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:24,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:04:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:24,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:04:24,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:04:24,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:24,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 116 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:04:24,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:24,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:24,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:30,809 INFO L116 PetriNetUnfolderBase]: 33522/42581 cut-off events. [2025-04-13 20:04:30,809 INFO L117 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2025-04-13 20:04:30,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85515 conditions, 42581 events. 33522/42581 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 1849. Compared 205476 event pairs, 20430 based on Foata normal form. 18/29513 useless extension candidates. Maximal degree in co-relation 85401. Up to 42546 conditions per place. [2025-04-13 20:04:30,913 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 92 selfloop transitions, 48 changer transitions 0/140 dead transitions. [2025-04-13 20:04:30,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 140 transitions, 714 flow [2025-04-13 20:04:30,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:04:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:04:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2025-04-13 20:04:30,914 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2175925925925926 [2025-04-13 20:04:30,914 INFO L175 Difference]: Start difference. First operand has 79 places, 116 transitions, 338 flow. Second operand 8 states and 188 transitions. [2025-04-13 20:04:30,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 140 transitions, 714 flow [2025-04-13 20:04:30,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 140 transitions, 702 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:04:30,917 INFO L231 Difference]: Finished difference. Result has 86 places, 140 transitions, 568 flow [2025-04-13 20:04:30,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=86, PETRI_TRANSITIONS=140} [2025-04-13 20:04:30,917 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 8 predicate places. [2025-04-13 20:04:30,918 INFO L485 AbstractCegarLoop]: Abstraction has has 86 places, 140 transitions, 568 flow [2025-04-13 20:04:30,918 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:04:30,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:30,918 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:30,926 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:04:31,118 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,SelfDestructingSolverStorable3 [2025-04-13 20:04:31,119 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:04:31,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:31,119 INFO L85 PathProgramCache]: Analyzing trace with hash -203601087, now seen corresponding path program 1 times [2025-04-13 20:04:31,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:31,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128365834] [2025-04-13 20:04:31,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:31,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:04:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:04:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:31,491 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 20:04:31,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:31,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128365834] [2025-04-13 20:04:31,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128365834] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:31,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849538884] [2025-04-13 20:04:31,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:31,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:31,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:31,494 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:04:31,496 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:04:31,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 20:04:31,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 20:04:31,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:31,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:31,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 918 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:04:32,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 20:04:32,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 20:04:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849538884] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:32,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-04-13 20:04:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016130563] [2025-04-13 20:04:32,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:32,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 20:04:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:32,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 20:04:32,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=156, Unknown=0, NotChecked=0, Total=272 [2025-04-13 20:04:32,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:32,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 140 transitions, 568 flow. Second operand has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:04:32,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:32,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:32,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:38,923 INFO L116 PetriNetUnfolderBase]: 33522/42614 cut-off events. [2025-04-13 20:04:38,923 INFO L117 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-04-13 20:04:38,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85715 conditions, 42614 events. 33522/42614 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 1893. Compared 205743 event pairs, 20430 based on Foata normal form. 29/29560 useless extension candidates. Maximal degree in co-relation 85509. Up to 42546 conditions per place. [2025-04-13 20:04:39,037 INFO L140 encePairwiseOnDemand]: 83/108 looper letters, 92 selfloop transitions, 81 changer transitions 0/173 dead transitions. [2025-04-13 20:04:39,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 173 transitions, 1112 flow [2025-04-13 20:04:39,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:04:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:04:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 257 transitions. [2025-04-13 20:04:39,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.13997821350762527 [2025-04-13 20:04:39,039 INFO L175 Difference]: Start difference. First operand has 86 places, 140 transitions, 568 flow. Second operand 17 states and 257 transitions. [2025-04-13 20:04:39,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 173 transitions, 1112 flow [2025-04-13 20:04:39,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 173 transitions, 972 flow, removed 52 selfloop flow, removed 4 redundant places. [2025-04-13 20:04:39,043 INFO L231 Difference]: Finished difference. Result has 101 places, 173 transitions, 858 flow [2025-04-13 20:04:39,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=858, PETRI_PLACES=101, PETRI_TRANSITIONS=173} [2025-04-13 20:04:39,044 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-04-13 20:04:39,044 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 173 transitions, 858 flow [2025-04-13 20:04:39,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:04:39,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:39,044 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:39,053 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:04:39,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:39,245 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:04:39,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1814115225, now seen corresponding path program 1 times [2025-04-13 20:04:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:39,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757334211] [2025-04-13 20:04:39,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:39,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:39,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-13 20:04:39,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-13 20:04:39,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:39,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2025-04-13 20:04:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:39,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757334211] [2025-04-13 20:04:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757334211] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:04:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:04:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:04:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299077653] [2025-04-13 20:04:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:04:39,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:04:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:39,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:04:39,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:04:39,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:39,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 173 transitions, 858 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:04:39,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:39,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:39,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:47,083 INFO L116 PetriNetUnfolderBase]: 37351/47808 cut-off events. [2025-04-13 20:04:47,083 INFO L117 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-04-13 20:04:47,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96185 conditions, 47808 events. 37351/47808 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 2101. Compared 241442 event pairs, 20430 based on Foata normal form. 1/33407 useless extension candidates. Maximal degree in co-relation 96086. Up to 42069 conditions per place. [2025-04-13 20:04:47,226 INFO L140 encePairwiseOnDemand]: 106/108 looper letters, 171 selfloop transitions, 0 changer transitions 57/228 dead transitions. [2025-04-13 20:04:47,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 228 transitions, 1429 flow [2025-04-13 20:04:47,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:04:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:04:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-04-13 20:04:47,227 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2025-04-13 20:04:47,227 INFO L175 Difference]: Start difference. First operand has 101 places, 173 transitions, 858 flow. Second operand 3 states and 169 transitions. [2025-04-13 20:04:47,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 228 transitions, 1429 flow [2025-04-13 20:04:47,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 228 transitions, 1303 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-04-13 20:04:47,231 INFO L231 Difference]: Finished difference. Result has 99 places, 171 transitions, 730 flow [2025-04-13 20:04:47,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=99, PETRI_TRANSITIONS=171} [2025-04-13 20:04:47,231 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-04-13 20:04:47,231 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 171 transitions, 730 flow [2025-04-13 20:04:47,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:04:47,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:47,232 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:47,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:04:47,232 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:04:47,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2138774359, now seen corresponding path program 1 times [2025-04-13 20:04:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:47,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043273142] [2025-04-13 20:04:47,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:47,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-13 20:04:47,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-13 20:04:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-13 20:04:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:47,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043273142] [2025-04-13 20:04:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043273142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:04:47,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201595789] [2025-04-13 20:04:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:04:47,776 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:04:47,777 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:04:48,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-13 20:04:48,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-13 20:04:48,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:48,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:48,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:04:48,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:04:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-13 20:04:48,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:04:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-04-13 20:04:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201595789] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:04:48,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:04:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-04-13 20:04:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323693838] [2025-04-13 20:04:48,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:04:48,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:04:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:48,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:04:48,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=722, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:04:48,767 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:48,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 171 transitions, 730 flow. Second operand has 35 states, 35 states have (on average 5.257142857142857) internal successors, (184), 35 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:04:48,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:48,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:48,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:04:55,536 INFO L116 PetriNetUnfolderBase]: 31168/39723 cut-off events. [2025-04-13 20:04:55,536 INFO L117 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-04-13 20:04:55,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79922 conditions, 39723 events. 31168/39723 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 192062 event pairs, 19150 based on Foata normal form. 3/27718 useless extension candidates. Maximal degree in co-relation 79911. Up to 39646 conditions per place. [2025-04-13 20:04:55,654 INFO L140 encePairwiseOnDemand]: 84/108 looper letters, 90 selfloop transitions, 90 changer transitions 0/180 dead transitions. [2025-04-13 20:04:55,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 180 transitions, 1144 flow [2025-04-13 20:04:55,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:04:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:04:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 243 transitions. [2025-04-13 20:04:55,656 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.125 [2025-04-13 20:04:55,656 INFO L175 Difference]: Start difference. First operand has 99 places, 171 transitions, 730 flow. Second operand 18 states and 243 transitions. [2025-04-13 20:04:55,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 180 transitions, 1144 flow [2025-04-13 20:04:55,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 180 transitions, 1142 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:04:55,660 INFO L231 Difference]: Finished difference. Result has 113 places, 180 transitions, 968 flow [2025-04-13 20:04:55,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=968, PETRI_PLACES=113, PETRI_TRANSITIONS=180} [2025-04-13 20:04:55,661 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-04-13 20:04:55,661 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 180 transitions, 968 flow [2025-04-13 20:04:55,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.257142857142857) internal successors, (184), 35 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:04:55,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:04:55,661 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:04:55,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:04:55,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:04:55,862 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:04:55,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:04:55,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1806918241, now seen corresponding path program 1 times [2025-04-13 20:04:55,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:04:55,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695366597] [2025-04-13 20:04:55,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:04:55,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:04:55,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:04:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:04:56,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:04:56,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:04:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:04:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:04:56,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695366597] [2025-04-13 20:04:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695366597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:04:56,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:04:56,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:04:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648172006] [2025-04-13 20:04:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:04:56,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:04:56,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:04:56,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:04:56,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:04:56,907 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:04:56,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 180 transitions, 968 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:04:56,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:04:56,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:04:56,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:08,559 INFO L116 PetriNetUnfolderBase]: 51868/67322 cut-off events. [2025-04-13 20:05:08,560 INFO L117 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2025-04-13 20:05:08,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135365 conditions, 67322 events. 51868/67322 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 2814. Compared 374752 event pairs, 17128 based on Foata normal form. 642/48531 useless extension candidates. Maximal degree in co-relation 135354. Up to 35103 conditions per place. [2025-04-13 20:05:08,748 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 261 selfloop transitions, 12 changer transitions 89/362 dead transitions. [2025-04-13 20:05:08,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 362 transitions, 2071 flow [2025-04-13 20:05:08,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:05:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:05:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2025-04-13 20:05:08,749 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2025-04-13 20:05:08,749 INFO L175 Difference]: Start difference. First operand has 113 places, 180 transitions, 968 flow. Second operand 5 states and 305 transitions. [2025-04-13 20:05:08,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 362 transitions, 2071 flow [2025-04-13 20:05:08,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 362 transitions, 1963 flow, removed 15 selfloop flow, removed 9 redundant places. [2025-04-13 20:05:08,754 INFO L231 Difference]: Finished difference. Result has 112 places, 186 transitions, 952 flow [2025-04-13 20:05:08,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=952, PETRI_PLACES=112, PETRI_TRANSITIONS=186} [2025-04-13 20:05:08,755 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 34 predicate places. [2025-04-13 20:05:08,755 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 186 transitions, 952 flow [2025-04-13 20:05:08,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:05:08,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:08,755 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:05:08,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:05:08,755 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:05:08,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:08,756 INFO L85 PathProgramCache]: Analyzing trace with hash -869274863, now seen corresponding path program 1 times [2025-04-13 20:05:08,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:08,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040263806] [2025-04-13 20:05:08,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:05:08,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:08,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:05:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:05:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:05:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:09,885 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:05:09,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:09,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040263806] [2025-04-13 20:05:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040263806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:05:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:05:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:05:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714515073] [2025-04-13 20:05:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:05:09,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:05:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:09,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:05:09,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:05:09,886 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:05:09,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 186 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:09,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:09,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:05:09,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:20,070 INFO L116 PetriNetUnfolderBase]: 45481/59741 cut-off events. [2025-04-13 20:05:20,070 INFO L117 PetriNetUnfolderBase]: For 10653/10653 co-relation queries the response was YES. [2025-04-13 20:05:20,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133289 conditions, 59741 events. 45481/59741 cut-off events. For 10653/10653 co-relation queries the response was YES. Maximal size of possible extension queue 2573. Compared 333506 event pairs, 25215 based on Foata normal form. 307/43907 useless extension candidates. Maximal degree in co-relation 133274. Up to 48395 conditions per place. [2025-04-13 20:05:20,331 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 246 selfloop transitions, 5 changer transitions 4/255 dead transitions. [2025-04-13 20:05:20,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 255 transitions, 1643 flow [2025-04-13 20:05:20,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:05:20,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:05:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-04-13 20:05:20,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2025-04-13 20:05:20,332 INFO L175 Difference]: Start difference. First operand has 112 places, 186 transitions, 952 flow. Second operand 3 states and 175 transitions. [2025-04-13 20:05:20,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 255 transitions, 1643 flow [2025-04-13 20:05:20,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 255 transitions, 1637 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:05:20,421 INFO L231 Difference]: Finished difference. Result has 111 places, 189 transitions, 994 flow [2025-04-13 20:05:20,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=994, PETRI_PLACES=111, PETRI_TRANSITIONS=189} [2025-04-13 20:05:20,422 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-04-13 20:05:20,422 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 189 transitions, 994 flow [2025-04-13 20:05:20,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:20,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:20,422 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:05:20,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:05:20,422 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:05:20,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:20,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2113267611, now seen corresponding path program 2 times [2025-04-13 20:05:20,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:20,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857644407] [2025-04-13 20:05:20,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:05:20,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:20,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:05:20,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:05:20,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:05:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:05:20,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:20,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857644407] [2025-04-13 20:05:20,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857644407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:05:20,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:05:20,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:05:20,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216594857] [2025-04-13 20:05:20,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:05:20,934 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:05:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:20,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:05:20,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:05:20,935 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:05:20,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 189 transitions, 994 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:20,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:20,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:05:20,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:31,975 INFO L116 PetriNetUnfolderBase]: 49722/65717 cut-off events. [2025-04-13 20:05:31,976 INFO L117 PetriNetUnfolderBase]: For 21502/21502 co-relation queries the response was YES. [2025-04-13 20:05:32,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150420 conditions, 65717 events. 49722/65717 cut-off events. For 21502/21502 co-relation queries the response was YES. Maximal size of possible extension queue 2727. Compared 376257 event pairs, 22099 based on Foata normal form. 514/48475 useless extension candidates. Maximal degree in co-relation 150404. Up to 36904 conditions per place. [2025-04-13 20:05:32,247 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 241 selfloop transitions, 7 changer transitions 3/251 dead transitions. [2025-04-13 20:05:32,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 251 transitions, 1667 flow [2025-04-13 20:05:32,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:05:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:05:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-04-13 20:05:32,248 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-13 20:05:32,248 INFO L175 Difference]: Start difference. First operand has 111 places, 189 transitions, 994 flow. Second operand 3 states and 167 transitions. [2025-04-13 20:05:32,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 251 transitions, 1667 flow [2025-04-13 20:05:32,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 251 transitions, 1662 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:05:32,502 INFO L231 Difference]: Finished difference. Result has 114 places, 193 transitions, 1055 flow [2025-04-13 20:05:32,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1055, PETRI_PLACES=114, PETRI_TRANSITIONS=193} [2025-04-13 20:05:32,503 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2025-04-13 20:05:32,503 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 193 transitions, 1055 flow [2025-04-13 20:05:32,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:32,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:32,503 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:05:32,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:05:32,504 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:05:32,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash 962990801, now seen corresponding path program 1 times [2025-04-13 20:05:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:32,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98672308] [2025-04-13 20:05:32,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:05:32,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:32,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:05:32,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:05:32,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:05:32,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:05:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:33,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98672308] [2025-04-13 20:05:33,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98672308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:05:33,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:05:33,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:05:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481414080] [2025-04-13 20:05:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:05:33,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:05:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:33,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:05:33,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:05:33,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:05:33,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 193 transitions, 1055 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:33,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:33,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:05:33,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:05:46,846 INFO L116 PetriNetUnfolderBase]: 54212/72416 cut-off events. [2025-04-13 20:05:46,847 INFO L117 PetriNetUnfolderBase]: For 35187/35187 co-relation queries the response was YES. [2025-04-13 20:05:47,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171816 conditions, 72416 events. 54212/72416 cut-off events. For 35187/35187 co-relation queries the response was YES. Maximal size of possible extension queue 3057. Compared 432950 event pairs, 32731 based on Foata normal form. 301/53618 useless extension candidates. Maximal degree in co-relation 171799. Up to 59881 conditions per place. [2025-04-13 20:05:47,190 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 267 selfloop transitions, 4 changer transitions 4/275 dead transitions. [2025-04-13 20:05:47,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 275 transitions, 1921 flow [2025-04-13 20:05:47,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:05:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:05:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-04-13 20:05:47,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2025-04-13 20:05:47,191 INFO L175 Difference]: Start difference. First operand has 114 places, 193 transitions, 1055 flow. Second operand 3 states and 175 transitions. [2025-04-13 20:05:47,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 275 transitions, 1921 flow [2025-04-13 20:05:47,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 275 transitions, 1894 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:05:47,509 INFO L231 Difference]: Finished difference. Result has 117 places, 197 transitions, 1093 flow [2025-04-13 20:05:47,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=117, PETRI_TRANSITIONS=197} [2025-04-13 20:05:47,510 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2025-04-13 20:05:47,510 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 197 transitions, 1093 flow [2025-04-13 20:05:47,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:47,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:05:47,510 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:05:47,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:05:47,510 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:05:47,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:05:47,511 INFO L85 PathProgramCache]: Analyzing trace with hash 107306271, now seen corresponding path program 2 times [2025-04-13 20:05:47,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:05:47,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123418918] [2025-04-13 20:05:47,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:05:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:05:47,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:05:47,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:05:47,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:05:47,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:05:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:05:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:05:47,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123418918] [2025-04-13 20:05:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123418918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:05:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:05:47,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:05:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534356400] [2025-04-13 20:05:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:05:47,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:05:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:05:47,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:05:47,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:05:47,919 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:05:47,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 197 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:05:47,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:05:47,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:05:47,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:01,173 INFO L116 PetriNetUnfolderBase]: 56258/75687 cut-off events. [2025-04-13 20:06:01,173 INFO L117 PetriNetUnfolderBase]: For 44856/44856 co-relation queries the response was YES. [2025-04-13 20:06:01,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186330 conditions, 75687 events. 56258/75687 cut-off events. For 44856/44856 co-relation queries the response was YES. Maximal size of possible extension queue 3199. Compared 468197 event pairs, 28238 based on Foata normal form. 612/56469 useless extension candidates. Maximal degree in co-relation 186312. Up to 44858 conditions per place. [2025-04-13 20:06:01,545 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 259 selfloop transitions, 5 changer transitions 3/267 dead transitions. [2025-04-13 20:06:01,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 267 transitions, 1893 flow [2025-04-13 20:06:01,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:06:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:06:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-04-13 20:06:01,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2025-04-13 20:06:01,547 INFO L175 Difference]: Start difference. First operand has 117 places, 197 transitions, 1093 flow. Second operand 3 states and 167 transitions. [2025-04-13 20:06:01,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 267 transitions, 1893 flow [2025-04-13 20:06:02,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 267 transitions, 1889 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:02,028 INFO L231 Difference]: Finished difference. Result has 120 places, 202 transitions, 1158 flow [2025-04-13 20:06:02,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=120, PETRI_TRANSITIONS=202} [2025-04-13 20:06:02,029 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2025-04-13 20:06:02,029 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 202 transitions, 1158 flow [2025-04-13 20:06:02,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:02,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:02,030 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:02,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:06:02,030 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:02,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:02,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1065084927, now seen corresponding path program 1 times [2025-04-13 20:06:02,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:02,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676601482] [2025-04-13 20:06:02,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:06:02,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:02,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:06:02,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:06:02,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:06:02,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:06:02,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:02,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676601482] [2025-04-13 20:06:02,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676601482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:02,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:02,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:06:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578562253] [2025-04-13 20:06:02,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:02,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:06:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:02,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:06:02,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:06:02,764 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:06:02,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 202 transitions, 1158 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:02,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:02,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:06:02,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:17,414 INFO L116 PetriNetUnfolderBase]: 59916/81150 cut-off events. [2025-04-13 20:06:17,414 INFO L117 PetriNetUnfolderBase]: For 59995/59995 co-relation queries the response was YES. [2025-04-13 20:06:17,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207581 conditions, 81150 events. 59916/81150 cut-off events. For 59995/59995 co-relation queries the response was YES. Maximal size of possible extension queue 3508. Compared 509280 event pairs, 41531 based on Foata normal form. 2/60306 useless extension candidates. Maximal degree in co-relation 207562. Up to 74888 conditions per place. [2025-04-13 20:06:17,875 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 249 selfloop transitions, 2 changer transitions 24/275 dead transitions. [2025-04-13 20:06:17,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 275 transitions, 2010 flow [2025-04-13 20:06:17,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:06:17,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:06:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-04-13 20:06:17,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2025-04-13 20:06:17,876 INFO L175 Difference]: Start difference. First operand has 120 places, 202 transitions, 1158 flow. Second operand 4 states and 166 transitions. [2025-04-13 20:06:17,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 275 transitions, 2010 flow [2025-04-13 20:06:18,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 275 transitions, 1995 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:06:18,279 INFO L231 Difference]: Finished difference. Result has 124 places, 202 transitions, 1157 flow [2025-04-13 20:06:18,279 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1157, PETRI_PLACES=124, PETRI_TRANSITIONS=202} [2025-04-13 20:06:18,279 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2025-04-13 20:06:18,279 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 202 transitions, 1157 flow [2025-04-13 20:06:18,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:18,280 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:18,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:06:18,280 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:18,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1893453175, now seen corresponding path program 2 times [2025-04-13 20:06:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:18,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8193629] [2025-04-13 20:06:18,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:18,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:06:18,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:06:18,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:18,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:18,545 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:06:18,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:18,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8193629] [2025-04-13 20:06:18,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8193629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:18,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:18,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:06:18,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66560021] [2025-04-13 20:06:18,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:18,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:06:18,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:18,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:06:18,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:06:18,546 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:06:18,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 202 transitions, 1157 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:18,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:06:18,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:33,598 INFO L116 PetriNetUnfolderBase]: 63747/86764 cut-off events. [2025-04-13 20:06:33,599 INFO L117 PetriNetUnfolderBase]: For 58311/58311 co-relation queries the response was YES. [2025-04-13 20:06:33,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221672 conditions, 86764 events. 63747/86764 cut-off events. For 58311/58311 co-relation queries the response was YES. Maximal size of possible extension queue 3839. Compared 553821 event pairs, 45218 based on Foata normal form. 2/64794 useless extension candidates. Maximal degree in co-relation 221651. Up to 79982 conditions per place. [2025-04-13 20:06:34,057 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 240 selfloop transitions, 3 changer transitions 23/266 dead transitions. [2025-04-13 20:06:34,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 266 transitions, 1923 flow [2025-04-13 20:06:34,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:06:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:06:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-04-13 20:06:34,058 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37962962962962965 [2025-04-13 20:06:34,058 INFO L175 Difference]: Start difference. First operand has 124 places, 202 transitions, 1157 flow. Second operand 4 states and 164 transitions. [2025-04-13 20:06:34,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 266 transitions, 1923 flow [2025-04-13 20:06:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 266 transitions, 1915 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:34,361 INFO L231 Difference]: Finished difference. Result has 126 places, 202 transitions, 1168 flow [2025-04-13 20:06:34,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1168, PETRI_PLACES=126, PETRI_TRANSITIONS=202} [2025-04-13 20:06:34,362 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-04-13 20:06:34,362 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 202 transitions, 1168 flow [2025-04-13 20:06:34,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:34,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:34,363 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:34,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:06:34,363 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:34,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -713740385, now seen corresponding path program 2 times [2025-04-13 20:06:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:34,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370103033] [2025-04-13 20:06:34,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:06:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:34,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:06:34,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:06:34,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:06:34,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:34,760 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:06:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:34,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370103033] [2025-04-13 20:06:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370103033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:06:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084027438] [2025-04-13 20:06:34,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:34,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:06:34,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:34,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:06:34,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:06:34,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:06:34,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 202 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:34,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:34,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:06:34,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:06:51,332 INFO L116 PetriNetUnfolderBase]: 69210/95186 cut-off events. [2025-04-13 20:06:51,332 INFO L117 PetriNetUnfolderBase]: For 73907/73907 co-relation queries the response was YES. [2025-04-13 20:06:51,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241071 conditions, 95186 events. 69210/95186 cut-off events. For 73907/73907 co-relation queries the response was YES. Maximal size of possible extension queue 4326. Compared 637135 event pairs, 32719 based on Foata normal form. 1134/72302 useless extension candidates. Maximal degree in co-relation 241049. Up to 50018 conditions per place. [2025-04-13 20:06:51,821 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 257 selfloop transitions, 15 changer transitions 4/276 dead transitions. [2025-04-13 20:06:51,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 276 transitions, 2047 flow [2025-04-13 20:06:51,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:06:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:06:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-13 20:06:51,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-04-13 20:06:51,822 INFO L175 Difference]: Start difference. First operand has 126 places, 202 transitions, 1168 flow. Second operand 3 states and 165 transitions. [2025-04-13 20:06:51,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 276 transitions, 2047 flow [2025-04-13 20:06:52,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 276 transitions, 2038 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:06:52,258 INFO L231 Difference]: Finished difference. Result has 127 places, 215 transitions, 1376 flow [2025-04-13 20:06:52,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1376, PETRI_PLACES=127, PETRI_TRANSITIONS=215} [2025-04-13 20:06:52,259 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 49 predicate places. [2025-04-13 20:06:52,259 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 215 transitions, 1376 flow [2025-04-13 20:06:52,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:52,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:06:52,259 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:06:52,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:06:52,259 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:52,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:06:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -659331751, now seen corresponding path program 3 times [2025-04-13 20:06:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:06:52,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417251281] [2025-04-13 20:06:52,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:06:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:06:52,306 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:06:52,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:06:52,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:06:52,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:06:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:06:52,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:06:52,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417251281] [2025-04-13 20:06:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417251281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:06:52,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:06:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:06:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25660881] [2025-04-13 20:06:52,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:06:52,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:06:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:06:52,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:06:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:06:52,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:06:52,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 215 transitions, 1376 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:52,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:06:52,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:06:52,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:08,674 INFO L116 PetriNetUnfolderBase]: 68140/93954 cut-off events. [2025-04-13 20:07:08,674 INFO L117 PetriNetUnfolderBase]: For 108946/108946 co-relation queries the response was YES. [2025-04-13 20:07:08,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245850 conditions, 93954 events. 68140/93954 cut-off events. For 108946/108946 co-relation queries the response was YES. Maximal size of possible extension queue 4318. Compared 629730 event pairs, 43326 based on Foata normal form. 975/70753 useless extension candidates. Maximal degree in co-relation 245828. Up to 74888 conditions per place. [2025-04-13 20:07:09,158 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 269 selfloop transitions, 10 changer transitions 6/285 dead transitions. [2025-04-13 20:07:09,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 285 transitions, 2244 flow [2025-04-13 20:07:09,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:07:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:07:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-04-13 20:07:09,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5092592592592593 [2025-04-13 20:07:09,160 INFO L175 Difference]: Start difference. First operand has 127 places, 215 transitions, 1376 flow. Second operand 3 states and 165 transitions. [2025-04-13 20:07:09,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 285 transitions, 2244 flow [2025-04-13 20:07:11,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 285 transitions, 2219 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 20:07:11,647 INFO L231 Difference]: Finished difference. Result has 130 places, 225 transitions, 1531 flow [2025-04-13 20:07:11,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1531, PETRI_PLACES=130, PETRI_TRANSITIONS=225} [2025-04-13 20:07:11,648 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 52 predicate places. [2025-04-13 20:07:11,648 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 225 transitions, 1531 flow [2025-04-13 20:07:11,648 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 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:11,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:11,648 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:07:11,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:07:11,648 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:07:11,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:11,649 INFO L85 PathProgramCache]: Analyzing trace with hash -409548417, now seen corresponding path program 1 times [2025-04-13 20:07:11,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:11,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626284896] [2025-04-13 20:07:11,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:11,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:11,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:07:11,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:07:11,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:11,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:07:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:12,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626284896] [2025-04-13 20:07:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626284896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820187410] [2025-04-13 20:07:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:12,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:12,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:12,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:12,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:07:12,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 225 transitions, 1531 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:12,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:12,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:07:12,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:30,656 INFO L116 PetriNetUnfolderBase]: 76215/106401 cut-off events. [2025-04-13 20:07:30,656 INFO L117 PetriNetUnfolderBase]: For 127955/127955 co-relation queries the response was YES. [2025-04-13 20:07:31,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282906 conditions, 106401 events. 76215/106401 cut-off events. For 127955/127955 co-relation queries the response was YES. Maximal size of possible extension queue 4899. Compared 758591 event pairs, 10831 based on Foata normal form. 1592/80677 useless extension candidates. Maximal degree in co-relation 282883. Up to 49510 conditions per place. [2025-04-13 20:07:31,190 INFO L140 encePairwiseOnDemand]: 90/108 looper letters, 283 selfloop transitions, 57 changer transitions 5/345 dead transitions. [2025-04-13 20:07:31,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 345 transitions, 2828 flow [2025-04-13 20:07:31,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:07:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:07:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2025-04-13 20:07:31,191 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2025-04-13 20:07:31,191 INFO L175 Difference]: Start difference. First operand has 130 places, 225 transitions, 1531 flow. Second operand 4 states and 222 transitions. [2025-04-13 20:07:31,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 345 transitions, 2828 flow [2025-04-13 20:07:32,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 345 transitions, 2778 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-13 20:07:32,654 INFO L231 Difference]: Finished difference. Result has 135 places, 258 transitions, 2157 flow [2025-04-13 20:07:32,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2157, PETRI_PLACES=135, PETRI_TRANSITIONS=258} [2025-04-13 20:07:32,655 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 57 predicate places. [2025-04-13 20:07:32,655 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 258 transitions, 2157 flow [2025-04-13 20:07:32,655 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:32,655 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:07:32,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:07:32,655 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:07:32,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash -591373017, now seen corresponding path program 2 times [2025-04-13 20:07:32,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:32,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779430625] [2025-04-13 20:07:32,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:07:32,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:32,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:07:32,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:07:32,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:07:32,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:07:33,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:33,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779430625] [2025-04-13 20:07:33,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779430625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:33,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:33,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61735356] [2025-04-13 20:07:33,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:33,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:33,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:33,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:33,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:33,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:07:33,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 258 transitions, 2157 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:33,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:33,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:07:33,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:44,957 INFO L116 PetriNetUnfolderBase]: 51586/72961 cut-off events. [2025-04-13 20:07:44,957 INFO L117 PetriNetUnfolderBase]: For 186082/186082 co-relation queries the response was YES. [2025-04-13 20:07:45,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186997 conditions, 72961 events. 51586/72961 cut-off events. For 186082/186082 co-relation queries the response was YES. Maximal size of possible extension queue 3482. Compared 512072 event pairs, 18039 based on Foata normal form. 4602/56621 useless extension candidates. Maximal degree in co-relation 186972. Up to 44587 conditions per place. [2025-04-13 20:07:45,293 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 326 selfloop transitions, 21 changer transitions 12/359 dead transitions. [2025-04-13 20:07:45,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 359 transitions, 3069 flow [2025-04-13 20:07:45,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2025-04-13 20:07:45,295 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-04-13 20:07:45,295 INFO L175 Difference]: Start difference. First operand has 135 places, 258 transitions, 2157 flow. Second operand 5 states and 243 transitions. [2025-04-13 20:07:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 359 transitions, 3069 flow [2025-04-13 20:07:45,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 359 transitions, 2991 flow, removed 31 selfloop flow, removed 3 redundant places. [2025-04-13 20:07:45,503 INFO L231 Difference]: Finished difference. Result has 138 places, 241 transitions, 1855 flow [2025-04-13 20:07:45,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1855, PETRI_PLACES=138, PETRI_TRANSITIONS=241} [2025-04-13 20:07:45,503 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-04-13 20:07:45,503 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 241 transitions, 1855 flow [2025-04-13 20:07:45,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:45,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:45,504 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:07:45,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:07:45,504 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:07:45,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1214067239, now seen corresponding path program 3 times [2025-04-13 20:07:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:45,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719324012] [2025-04-13 20:07:45,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:07:45,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:45,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:07:45,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:07:45,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:07:45,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:07:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:07:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:07:45,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719324012] [2025-04-13 20:07:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719324012] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:07:45,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:07:45,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:07:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766958580] [2025-04-13 20:07:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:07:45,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:07:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:07:45,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:07:45,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:07:45,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:07:45,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 241 transitions, 1855 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:45,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:07:45,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:07:45,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:07:58,165 INFO L116 PetriNetUnfolderBase]: 51784/73287 cut-off events. [2025-04-13 20:07:58,166 INFO L117 PetriNetUnfolderBase]: For 102712/102712 co-relation queries the response was YES. [2025-04-13 20:07:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190061 conditions, 73287 events. 51784/73287 cut-off events. For 102712/102712 co-relation queries the response was YES. Maximal size of possible extension queue 3459. Compared 515827 event pairs, 10947 based on Foata normal form. 86/52267 useless extension candidates. Maximal degree in co-relation 190034. Up to 45109 conditions per place. [2025-04-13 20:07:58,567 INFO L140 encePairwiseOnDemand]: 89/108 looper letters, 303 selfloop transitions, 45 changer transitions 13/361 dead transitions. [2025-04-13 20:07:58,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 361 transitions, 3059 flow [2025-04-13 20:07:58,568 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:07:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:07:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2025-04-13 20:07:58,569 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2025-04-13 20:07:58,569 INFO L175 Difference]: Start difference. First operand has 138 places, 241 transitions, 1855 flow. Second operand 5 states and 256 transitions. [2025-04-13 20:07:58,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 361 transitions, 3059 flow [2025-04-13 20:07:58,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 361 transitions, 3053 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:07:58,856 INFO L231 Difference]: Finished difference. Result has 144 places, 253 transitions, 2176 flow [2025-04-13 20:07:58,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2176, PETRI_PLACES=144, PETRI_TRANSITIONS=253} [2025-04-13 20:07:58,856 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 66 predicate places. [2025-04-13 20:07:58,856 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 253 transitions, 2176 flow [2025-04-13 20:07:58,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:58,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:07:58,857 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:07:58,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:07:58,857 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:07:58,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:07:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 83275971, now seen corresponding path program 1 times [2025-04-13 20:07:58,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:07:58,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452501922] [2025-04-13 20:07:58,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:07:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:07:58,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:07:59,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:07:59,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:07:59,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:08:00,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:00,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452501922] [2025-04-13 20:08:00,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452501922] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:08:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:08:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:08:00,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237125278] [2025-04-13 20:08:00,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:08:00,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:08:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:00,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:08:00,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:08:00,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:08:00,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 253 transitions, 2176 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:00,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:00,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:08:00,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:08,948 INFO L116 PetriNetUnfolderBase]: 38390/54404 cut-off events. [2025-04-13 20:08:08,949 INFO L117 PetriNetUnfolderBase]: For 135790/135790 co-relation queries the response was YES. [2025-04-13 20:08:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150789 conditions, 54404 events. 38390/54404 cut-off events. For 135790/135790 co-relation queries the response was YES. Maximal size of possible extension queue 3002. Compared 371915 event pairs, 15289 based on Foata normal form. 1079/38383 useless extension candidates. Maximal degree in co-relation 150760. Up to 24027 conditions per place. [2025-04-13 20:08:09,205 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 290 selfloop transitions, 46 changer transitions 13/349 dead transitions. [2025-04-13 20:08:09,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 349 transitions, 3087 flow [2025-04-13 20:08:09,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:08:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:08:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 238 transitions. [2025-04-13 20:08:09,207 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2025-04-13 20:08:09,207 INFO L175 Difference]: Start difference. First operand has 144 places, 253 transitions, 2176 flow. Second operand 5 states and 238 transitions. [2025-04-13 20:08:09,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 349 transitions, 3087 flow [2025-04-13 20:08:09,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 349 transitions, 2975 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-04-13 20:08:09,533 INFO L231 Difference]: Finished difference. Result has 150 places, 253 transitions, 2234 flow [2025-04-13 20:08:09,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2009, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2234, PETRI_PLACES=150, PETRI_TRANSITIONS=253} [2025-04-13 20:08:09,534 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 72 predicate places. [2025-04-13 20:08:09,534 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 253 transitions, 2234 flow [2025-04-13 20:08:09,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:09,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:09,534 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:08:09,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:08:09,534 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:08:09,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1376400019, now seen corresponding path program 2 times [2025-04-13 20:08:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:09,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694576311] [2025-04-13 20:08:09,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:08:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:09,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:08:09,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:08:09,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:08:09,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:09,894 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:08:09,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:09,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694576311] [2025-04-13 20:08:09,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694576311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:08:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:08:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:08:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496102496] [2025-04-13 20:08:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:08:09,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:08:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:09,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:08:09,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:08:09,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:08:09,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 253 transitions, 2234 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:09,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:09,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:08:09,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:19,474 INFO L116 PetriNetUnfolderBase]: 38264/54233 cut-off events. [2025-04-13 20:08:19,474 INFO L117 PetriNetUnfolderBase]: For 135256/135256 co-relation queries the response was YES. [2025-04-13 20:08:19,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153147 conditions, 54233 events. 38264/54233 cut-off events. For 135256/135256 co-relation queries the response was YES. Maximal size of possible extension queue 3059. Compared 370542 event pairs, 19686 based on Foata normal form. 91/37223 useless extension candidates. Maximal degree in co-relation 153115. Up to 29885 conditions per place. [2025-04-13 20:08:19,767 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 287 selfloop transitions, 26 changer transitions 17/330 dead transitions. [2025-04-13 20:08:19,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 330 transitions, 3080 flow [2025-04-13 20:08:19,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:08:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:08:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-04-13 20:08:19,768 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2025-04-13 20:08:19,768 INFO L175 Difference]: Start difference. First operand has 150 places, 253 transitions, 2234 flow. Second operand 4 states and 200 transitions. [2025-04-13 20:08:19,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 330 transitions, 3080 flow [2025-04-13 20:08:20,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 330 transitions, 3017 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-13 20:08:20,666 INFO L231 Difference]: Finished difference. Result has 153 places, 254 transitions, 2262 flow [2025-04-13 20:08:20,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2171, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2262, PETRI_PLACES=153, PETRI_TRANSITIONS=254} [2025-04-13 20:08:20,667 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 75 predicate places. [2025-04-13 20:08:20,667 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 254 transitions, 2262 flow [2025-04-13 20:08:20,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:20,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:20,667 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:08:20,667 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:08:20,668 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:08:20,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -212414861, now seen corresponding path program 1 times [2025-04-13 20:08:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:20,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456004356] [2025-04-13 20:08:20,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:08:20,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:20,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:08:21,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:08:21,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:08:21,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:08:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:22,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456004356] [2025-04-13 20:08:22,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456004356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:08:22,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:08:22,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:08:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770850503] [2025-04-13 20:08:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:08:22,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:08:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:22,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:08:22,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:08:22,134 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:08:22,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 254 transitions, 2262 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:08:22,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:22,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:08:22,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:31,999 INFO L116 PetriNetUnfolderBase]: 39708/56522 cut-off events. [2025-04-13 20:08:31,999 INFO L117 PetriNetUnfolderBase]: For 138928/138928 co-relation queries the response was YES. [2025-04-13 20:08:32,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159316 conditions, 56522 events. 39708/56522 cut-off events. For 138928/138928 co-relation queries the response was YES. Maximal size of possible extension queue 3127. Compared 393357 event pairs, 13152 based on Foata normal form. 5/39020 useless extension candidates. Maximal degree in co-relation 159283. Up to 36652 conditions per place. [2025-04-13 20:08:32,353 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 282 selfloop transitions, 38 changer transitions 28/348 dead transitions. [2025-04-13 20:08:32,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 348 transitions, 3217 flow [2025-04-13 20:08:32,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:08:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:08:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-04-13 20:08:32,354 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 20:08:32,355 INFO L175 Difference]: Start difference. First operand has 153 places, 254 transitions, 2262 flow. Second operand 6 states and 216 transitions. [2025-04-13 20:08:32,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 348 transitions, 3217 flow [2025-04-13 20:08:33,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 348 transitions, 3195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:08:33,246 INFO L231 Difference]: Finished difference. Result has 160 places, 253 transitions, 2344 flow [2025-04-13 20:08:33,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2344, PETRI_PLACES=160, PETRI_TRANSITIONS=253} [2025-04-13 20:08:33,246 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2025-04-13 20:08:33,246 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 253 transitions, 2344 flow [2025-04-13 20:08:33,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:08:33,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:33,247 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:08:33,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:08:33,247 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:08:33,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 299840067, now seen corresponding path program 2 times [2025-04-13 20:08:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:33,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204074593] [2025-04-13 20:08:33,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:08:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:33,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:08:33,517 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:08:33,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:08:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:34,001 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:08:34,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:34,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204074593] [2025-04-13 20:08:34,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204074593] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:08:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:08:34,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:08:34,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701797690] [2025-04-13 20:08:34,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:08:34,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:08:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:34,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:08:34,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:08:34,002 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:08:34,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 253 transitions, 2344 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:08:34,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:34,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:08:34,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:44,600 INFO L116 PetriNetUnfolderBase]: 40633/57955 cut-off events. [2025-04-13 20:08:44,601 INFO L117 PetriNetUnfolderBase]: For 163433/163433 co-relation queries the response was YES. [2025-04-13 20:08:44,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165391 conditions, 57955 events. 40633/57955 cut-off events. For 163433/163433 co-relation queries the response was YES. Maximal size of possible extension queue 3171. Compared 406393 event pairs, 13211 based on Foata normal form. 5/40107 useless extension candidates. Maximal degree in co-relation 165355. Up to 38725 conditions per place. [2025-04-13 20:08:44,971 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 274 selfloop transitions, 34 changer transitions 30/338 dead transitions. [2025-04-13 20:08:44,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 338 transitions, 3251 flow [2025-04-13 20:08:44,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:08:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:08:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2025-04-13 20:08:44,972 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-04-13 20:08:44,972 INFO L175 Difference]: Start difference. First operand has 160 places, 253 transitions, 2344 flow. Second operand 6 states and 210 transitions. [2025-04-13 20:08:44,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 338 transitions, 3251 flow [2025-04-13 20:08:46,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 338 transitions, 3182 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:08:46,023 INFO L231 Difference]: Finished difference. Result has 164 places, 249 transitions, 2315 flow [2025-04-13 20:08:46,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2315, PETRI_PLACES=164, PETRI_TRANSITIONS=249} [2025-04-13 20:08:46,024 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 86 predicate places. [2025-04-13 20:08:46,024 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 249 transitions, 2315 flow [2025-04-13 20:08:46,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:08:46,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:08:46,024 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:08:46,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 20:08:46,024 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:08:46,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:08:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1101226529, now seen corresponding path program 3 times [2025-04-13 20:08:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:08:46,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991118502] [2025-04-13 20:08:46,025 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:08:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:08:46,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:08:46,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:08:46,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:08:46,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:08:47,227 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:08:47,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:08:47,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991118502] [2025-04-13 20:08:47,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991118502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:08:47,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:08:47,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:08:47,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328229879] [2025-04-13 20:08:47,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:08:47,228 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:08:47,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:08:47,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:08:47,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:08:47,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:08:47,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 249 transitions, 2315 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:08:47,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:08:47,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:08:47,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:08:58,907 INFO L116 PetriNetUnfolderBase]: 47659/67938 cut-off events. [2025-04-13 20:08:58,907 INFO L117 PetriNetUnfolderBase]: For 191741/191741 co-relation queries the response was YES. [2025-04-13 20:08:59,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188989 conditions, 67938 events. 47659/67938 cut-off events. For 191741/191741 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 476161 event pairs, 25224 based on Foata normal form. 2/47699 useless extension candidates. Maximal degree in co-relation 188951. Up to 39721 conditions per place. [2025-04-13 20:08:59,326 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 312 selfloop transitions, 26 changer transitions 16/354 dead transitions. [2025-04-13 20:08:59,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 354 transitions, 3401 flow [2025-04-13 20:08:59,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:08:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:08:59,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-04-13 20:08:59,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2025-04-13 20:08:59,327 INFO L175 Difference]: Start difference. First operand has 164 places, 249 transitions, 2315 flow. Second operand 5 states and 218 transitions. [2025-04-13 20:08:59,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 354 transitions, 3401 flow [2025-04-13 20:09:01,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 354 transitions, 3354 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:09:01,235 INFO L231 Difference]: Finished difference. Result has 168 places, 258 transitions, 2450 flow [2025-04-13 20:09:01,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2277, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2450, PETRI_PLACES=168, PETRI_TRANSITIONS=258} [2025-04-13 20:09:01,235 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 90 predicate places. [2025-04-13 20:09:01,235 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 258 transitions, 2450 flow [2025-04-13 20:09:01,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:09:01,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:09:01,235 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:09:01,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:09:01,236 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:09:01,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:09:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash 431432787, now seen corresponding path program 3 times [2025-04-13 20:09:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:09:01,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893140103] [2025-04-13 20:09:01,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:09:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:09:01,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:09:01,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:09:01,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:09:01,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:09:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:09:01,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893140103] [2025-04-13 20:09:01,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893140103] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:09:01,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:09:01,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:09:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669448800] [2025-04-13 20:09:01,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:09:01,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:09:01,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:09:01,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:09:01,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:09:01,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:09:01,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 258 transitions, 2450 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:01,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:09:01,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:09:01,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:09:13,476 INFO L116 PetriNetUnfolderBase]: 42383/60344 cut-off events. [2025-04-13 20:09:13,476 INFO L117 PetriNetUnfolderBase]: For 192293/192293 co-relation queries the response was YES. [2025-04-13 20:09:13,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171687 conditions, 60344 events. 42383/60344 cut-off events. For 192293/192293 co-relation queries the response was YES. Maximal size of possible extension queue 2950. Compared 415249 event pairs, 21264 based on Foata normal form. 484/42387 useless extension candidates. Maximal degree in co-relation 171647. Up to 29334 conditions per place. [2025-04-13 20:09:13,965 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 274 selfloop transitions, 15 changer transitions 31/320 dead transitions. [2025-04-13 20:09:13,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 320 transitions, 3093 flow [2025-04-13 20:09:13,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:09:13,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:09:13,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-04-13 20:09:13,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46064814814814814 [2025-04-13 20:09:13,966 INFO L175 Difference]: Start difference. First operand has 168 places, 258 transitions, 2450 flow. Second operand 4 states and 199 transitions. [2025-04-13 20:09:13,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 320 transitions, 3093 flow [2025-04-13 20:09:15,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 320 transitions, 3037 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-13 20:09:15,972 INFO L231 Difference]: Finished difference. Result has 166 places, 243 transitions, 2207 flow [2025-04-13 20:09:15,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2207, PETRI_PLACES=166, PETRI_TRANSITIONS=243} [2025-04-13 20:09:15,973 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 88 predicate places. [2025-04-13 20:09:15,973 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 243 transitions, 2207 flow [2025-04-13 20:09:15,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:15,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:09:15,973 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:09:15,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:09:15,973 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:09:15,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:09:15,974 INFO L85 PathProgramCache]: Analyzing trace with hash 647996883, now seen corresponding path program 4 times [2025-04-13 20:09:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:09:15,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300966591] [2025-04-13 20:09:15,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:09:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:09:16,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:09:16,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:09:16,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:09:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:17,110 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:09:17,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:09:17,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300966591] [2025-04-13 20:09:17,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300966591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:09:17,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:09:17,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:09:17,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391159008] [2025-04-13 20:09:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:09:17,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:09:17,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:09:17,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:09:17,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:09:17,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:09:17,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 243 transitions, 2207 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:09:17,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:09:17,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:09:17,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:09:28,879 INFO L116 PetriNetUnfolderBase]: 46763/66528 cut-off events. [2025-04-13 20:09:28,879 INFO L117 PetriNetUnfolderBase]: For 164145/164145 co-relation queries the response was YES. [2025-04-13 20:09:29,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184020 conditions, 66528 events. 46763/66528 cut-off events. For 164145/164145 co-relation queries the response was YES. Maximal size of possible extension queue 2911. Compared 458995 event pairs, 22904 based on Foata normal form. 2/46585 useless extension candidates. Maximal degree in co-relation 183983. Up to 36071 conditions per place. [2025-04-13 20:09:29,272 INFO L140 encePairwiseOnDemand]: 96/108 looper letters, 292 selfloop transitions, 26 changer transitions 35/353 dead transitions. [2025-04-13 20:09:29,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 353 transitions, 3297 flow [2025-04-13 20:09:29,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:09:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:09:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 232 transitions. [2025-04-13 20:09:29,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30687830687830686 [2025-04-13 20:09:29,274 INFO L175 Difference]: Start difference. First operand has 166 places, 243 transitions, 2207 flow. Second operand 7 states and 232 transitions. [2025-04-13 20:09:29,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 353 transitions, 3297 flow [2025-04-13 20:09:30,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 353 transitions, 3261 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 20:09:30,984 INFO L231 Difference]: Finished difference. Result has 172 places, 248 transitions, 2316 flow [2025-04-13 20:09:30,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2173, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2316, PETRI_PLACES=172, PETRI_TRANSITIONS=248} [2025-04-13 20:09:30,985 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2025-04-13 20:09:30,985 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 248 transitions, 2316 flow [2025-04-13 20:09:30,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:09:30,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:09:30,985 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:09:30,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:09:30,985 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:09:30,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:09:30,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1600528483, now seen corresponding path program 1 times [2025-04-13 20:09:30,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:09:30,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248706818] [2025-04-13 20:09:30,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:09:30,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:09:31,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:09:31,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:09:31,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:09:31,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:09:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:09:31,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248706818] [2025-04-13 20:09:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248706818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:09:31,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:09:31,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:09:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702337291] [2025-04-13 20:09:31,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:09:31,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:09:31,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:09:31,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:09:31,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:09:31,891 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:09:31,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 248 transitions, 2316 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:31,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:09:31,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:09:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:09:43,619 INFO L116 PetriNetUnfolderBase]: 46237/65719 cut-off events. [2025-04-13 20:09:43,620 INFO L117 PetriNetUnfolderBase]: For 173214/173214 co-relation queries the response was YES. [2025-04-13 20:09:43,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185067 conditions, 65719 events. 46237/65719 cut-off events. For 173214/173214 co-relation queries the response was YES. Maximal size of possible extension queue 2828. Compared 449064 event pairs, 14491 based on Foata normal form. 97/45930 useless extension candidates. Maximal degree in co-relation 185028. Up to 38866 conditions per place. [2025-04-13 20:09:44,056 INFO L140 encePairwiseOnDemand]: 91/108 looper letters, 271 selfloop transitions, 39 changer transitions 13/323 dead transitions. [2025-04-13 20:09:44,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 323 transitions, 3157 flow [2025-04-13 20:09:44,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:09:44,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:09:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-04-13 20:09:44,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-04-13 20:09:44,057 INFO L175 Difference]: Start difference. First operand has 172 places, 248 transitions, 2316 flow. Second operand 4 states and 204 transitions. [2025-04-13 20:09:44,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 323 transitions, 3157 flow [2025-04-13 20:09:46,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 323 transitions, 3143 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:09:46,068 INFO L231 Difference]: Finished difference. Result has 172 places, 248 transitions, 2400 flow [2025-04-13 20:09:46,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2400, PETRI_PLACES=172, PETRI_TRANSITIONS=248} [2025-04-13 20:09:46,069 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2025-04-13 20:09:46,069 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 248 transitions, 2400 flow [2025-04-13 20:09:46,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:46,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:09:46,070 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:09:46,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 20:09:46,070 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:09:46,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:09:46,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1726696211, now seen corresponding path program 5 times [2025-04-13 20:09:46,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:09:46,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656819417] [2025-04-13 20:09:46,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:09:46,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:09:46,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:09:47,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:09:47,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-13 20:09:47,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:09:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:09:48,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:09:48,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656819417] [2025-04-13 20:09:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656819417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:09:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:09:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:09:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279518925] [2025-04-13 20:09:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:09:48,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:09:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:09:48,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:09:48,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:09:48,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:09:48,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 248 transitions, 2400 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:09:48,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:09:48,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:09:48,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:00,097 INFO L116 PetriNetUnfolderBase]: 47506/67686 cut-off events. [2025-04-13 20:10:00,097 INFO L117 PetriNetUnfolderBase]: For 180809/180809 co-relation queries the response was YES. [2025-04-13 20:10:00,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193204 conditions, 67686 events. 47506/67686 cut-off events. For 180809/180809 co-relation queries the response was YES. Maximal size of possible extension queue 2839. Compared 461408 event pairs, 35368 based on Foata normal form. 2/47464 useless extension candidates. Maximal degree in co-relation 193165. Up to 57514 conditions per place. [2025-04-13 20:10:00,520 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 288 selfloop transitions, 17 changer transitions 23/328 dead transitions. [2025-04-13 20:10:00,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 328 transitions, 3461 flow [2025-04-13 20:10:00,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:10:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:10:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-04-13 20:10:00,521 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-04-13 20:10:00,521 INFO L175 Difference]: Start difference. First operand has 172 places, 248 transitions, 2400 flow. Second operand 5 states and 189 transitions. [2025-04-13 20:10:00,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 328 transitions, 3461 flow [2025-04-13 20:10:02,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 328 transitions, 3380 flow, removed 30 selfloop flow, removed 2 redundant places. [2025-04-13 20:10:02,155 INFO L231 Difference]: Finished difference. Result has 176 places, 246 transitions, 2340 flow [2025-04-13 20:10:02,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2340, PETRI_PLACES=176, PETRI_TRANSITIONS=246} [2025-04-13 20:10:02,155 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 98 predicate places. [2025-04-13 20:10:02,155 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 246 transitions, 2340 flow [2025-04-13 20:10:02,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:02,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:02,156 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:10:02,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:10:02,156 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:10:02,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2049768787, now seen corresponding path program 4 times [2025-04-13 20:10:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:02,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221011348] [2025-04-13 20:10:02,157 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:10:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:02,202 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:10:02,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:10:02,234 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:10:02,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:03,020 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:10:03,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:03,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221011348] [2025-04-13 20:10:03,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221011348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:03,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:03,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:10:03,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631959778] [2025-04-13 20:10:03,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:03,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:10:03,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:03,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:10:03,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:10:03,022 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:10:03,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 246 transitions, 2340 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:03,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:10:03,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:14,552 INFO L116 PetriNetUnfolderBase]: 46639/66376 cut-off events. [2025-04-13 20:10:14,552 INFO L117 PetriNetUnfolderBase]: For 163033/163033 co-relation queries the response was YES. [2025-04-13 20:10:14,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187646 conditions, 66376 events. 46639/66376 cut-off events. For 163033/163033 co-relation queries the response was YES. Maximal size of possible extension queue 2746. Compared 451876 event pairs, 13891 based on Foata normal form. 88/46479 useless extension candidates. Maximal degree in co-relation 187606. Up to 37464 conditions per place. [2025-04-13 20:10:15,012 INFO L140 encePairwiseOnDemand]: 89/108 looper letters, 265 selfloop transitions, 29 changer transitions 38/332 dead transitions. [2025-04-13 20:10:15,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 332 transitions, 3144 flow [2025-04-13 20:10:15,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:10:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:10:15,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 221 transitions. [2025-04-13 20:10:15,013 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40925925925925927 [2025-04-13 20:10:15,013 INFO L175 Difference]: Start difference. First operand has 176 places, 246 transitions, 2340 flow. Second operand 5 states and 221 transitions. [2025-04-13 20:10:15,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 332 transitions, 3144 flow [2025-04-13 20:10:16,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 332 transitions, 3109 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:10:16,934 INFO L231 Difference]: Finished difference. Result has 177 places, 240 transitions, 2291 flow [2025-04-13 20:10:16,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2237, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2291, PETRI_PLACES=177, PETRI_TRANSITIONS=240} [2025-04-13 20:10:16,937 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 99 predicate places. [2025-04-13 20:10:16,937 INFO L485 AbstractCegarLoop]: Abstraction has has 177 places, 240 transitions, 2291 flow [2025-04-13 20:10:16,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:16,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:16,938 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:10:16,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:10:16,938 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:10:16,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1433693651, now seen corresponding path program 6 times [2025-04-13 20:10:16,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:16,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168636589] [2025-04-13 20:10:16,939 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:10:16,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:16,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 110 statements into 8 equivalence classes. [2025-04-13 20:10:17,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:10:17,157 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:10:17,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:10:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:17,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168636589] [2025-04-13 20:10:17,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168636589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:17,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:17,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:10:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366598679] [2025-04-13 20:10:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:17,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:10:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:17,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:10:17,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:10:17,879 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:10:17,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 240 transitions, 2291 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:17,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:17,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:10:17,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:28,706 INFO L116 PetriNetUnfolderBase]: 43282/61611 cut-off events. [2025-04-13 20:10:28,707 INFO L117 PetriNetUnfolderBase]: For 166982/166982 co-relation queries the response was YES. [2025-04-13 20:10:29,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175726 conditions, 61611 events. 43282/61611 cut-off events. For 166982/166982 co-relation queries the response was YES. Maximal size of possible extension queue 2482. Compared 411818 event pairs, 32259 based on Foata normal form. 6/43586 useless extension candidates. Maximal degree in co-relation 175686. Up to 52242 conditions per place. [2025-04-13 20:10:29,179 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 278 selfloop transitions, 12 changer transitions 30/320 dead transitions. [2025-04-13 20:10:29,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 320 transitions, 3325 flow [2025-04-13 20:10:29,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:10:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:10:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 191 transitions. [2025-04-13 20:10:29,180 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29475308641975306 [2025-04-13 20:10:29,180 INFO L175 Difference]: Start difference. First operand has 177 places, 240 transitions, 2291 flow. Second operand 6 states and 191 transitions. [2025-04-13 20:10:29,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 320 transitions, 3325 flow [2025-04-13 20:10:30,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 320 transitions, 3170 flow, removed 17 selfloop flow, removed 7 redundant places. [2025-04-13 20:10:30,772 INFO L231 Difference]: Finished difference. Result has 176 places, 235 transitions, 2092 flow [2025-04-13 20:10:30,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2092, PETRI_PLACES=176, PETRI_TRANSITIONS=235} [2025-04-13 20:10:30,773 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 98 predicate places. [2025-04-13 20:10:30,773 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 235 transitions, 2092 flow [2025-04-13 20:10:30,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 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:30,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:30,773 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:10:30,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:10:30,773 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:10:30,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1550240339, now seen corresponding path program 4 times [2025-04-13 20:10:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:30,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484867637] [2025-04-13 20:10:30,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:10:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:30,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:10:30,875 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:10:30,875 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:10:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:10:31,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:31,604 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484867637] [2025-04-13 20:10:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484867637] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:31,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:10:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438330362] [2025-04-13 20:10:31,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:31,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:10:31,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:31,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:10:31,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:10:31,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:10:31,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 235 transitions, 2092 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:31,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:31,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:10:31,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:42,473 INFO L116 PetriNetUnfolderBase]: 42422/60227 cut-off events. [2025-04-13 20:10:42,473 INFO L117 PetriNetUnfolderBase]: For 136262/136262 co-relation queries the response was YES. [2025-04-13 20:10:42,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169936 conditions, 60227 events. 42422/60227 cut-off events. For 136262/136262 co-relation queries the response was YES. Maximal size of possible extension queue 2421. Compared 401360 event pairs, 21700 based on Foata normal form. 36/42370 useless extension candidates. Maximal degree in co-relation 169897. Up to 37884 conditions per place. [2025-04-13 20:10:42,873 INFO L140 encePairwiseOnDemand]: 98/108 looper letters, 241 selfloop transitions, 7 changer transitions 27/275 dead transitions. [2025-04-13 20:10:42,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 275 transitions, 2740 flow [2025-04-13 20:10:42,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:10:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:10:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-04-13 20:10:42,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3587962962962963 [2025-04-13 20:10:42,874 INFO L175 Difference]: Start difference. First operand has 176 places, 235 transitions, 2092 flow. Second operand 4 states and 155 transitions. [2025-04-13 20:10:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 275 transitions, 2740 flow [2025-04-13 20:10:43,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 275 transitions, 2675 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-04-13 20:10:43,891 INFO L231 Difference]: Finished difference. Result has 173 places, 231 transitions, 1982 flow [2025-04-13 20:10:43,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1982, PETRI_PLACES=173, PETRI_TRANSITIONS=231} [2025-04-13 20:10:43,892 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 95 predicate places. [2025-04-13 20:10:43,892 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 231 transitions, 1982 flow [2025-04-13 20:10:43,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:43,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:43,892 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:10:43,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:10:43,892 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:10:43,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:43,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1959308875, now seen corresponding path program 1 times [2025-04-13 20:10:43,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:43,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492064186] [2025-04-13 20:10:43,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:10:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:43,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-13 20:10:44,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-13 20:10:44,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:10:44,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:10:44,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:44,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492064186] [2025-04-13 20:10:44,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492064186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:44,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:44,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:10:44,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652028737] [2025-04-13 20:10:44,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:44,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:10:44,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:44,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:10:44,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:10:44,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:10:44,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 231 transitions, 1982 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:44,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:44,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:10:44,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:10:55,078 INFO L116 PetriNetUnfolderBase]: 39299/55740 cut-off events. [2025-04-13 20:10:55,079 INFO L117 PetriNetUnfolderBase]: For 110144/110144 co-relation queries the response was YES. [2025-04-13 20:10:55,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154419 conditions, 55740 events. 39299/55740 cut-off events. For 110144/110144 co-relation queries the response was YES. Maximal size of possible extension queue 2160. Compared 365614 event pairs, 32829 based on Foata normal form. 2/39632 useless extension candidates. Maximal degree in co-relation 154381. Up to 54683 conditions per place. [2025-04-13 20:10:55,551 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 231 selfloop transitions, 3 changer transitions 28/262 dead transitions. [2025-04-13 20:10:55,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 262 transitions, 2602 flow [2025-04-13 20:10:55,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:10:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:10:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-04-13 20:10:55,552 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3194444444444444 [2025-04-13 20:10:55,552 INFO L175 Difference]: Start difference. First operand has 173 places, 231 transitions, 1982 flow. Second operand 4 states and 138 transitions. [2025-04-13 20:10:55,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 262 transitions, 2602 flow [2025-04-13 20:10:55,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 262 transitions, 2564 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:10:55,959 INFO L231 Difference]: Finished difference. Result has 171 places, 226 transitions, 1867 flow [2025-04-13 20:10:55,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1867, PETRI_PLACES=171, PETRI_TRANSITIONS=226} [2025-04-13 20:10:55,960 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2025-04-13 20:10:55,960 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 226 transitions, 1867 flow [2025-04-13 20:10:55,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:55,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:10:55,960 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:10:55,960 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 20:10:55,960 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:10:55,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:10:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash 552970541, now seen corresponding path program 2 times [2025-04-13 20:10:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:10:55,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486233887] [2025-04-13 20:10:55,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:10:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:10:56,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-04-13 20:10:56,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 110 statements. [2025-04-13 20:10:56,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:10:56,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:10:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:10:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:10:56,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486233887] [2025-04-13 20:10:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486233887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:10:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:10:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:10:56,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662518061] [2025-04-13 20:10:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:10:56,171 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:10:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:10:56,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:10:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:10:56,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:10:56,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 226 transitions, 1867 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:56,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:10:56,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:10:56,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:05,779 INFO L116 PetriNetUnfolderBase]: 38665/54750 cut-off events. [2025-04-13 20:11:05,779 INFO L117 PetriNetUnfolderBase]: For 96266/96266 co-relation queries the response was YES. [2025-04-13 20:11:06,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150047 conditions, 54750 events. 38665/54750 cut-off events. For 96266/96266 co-relation queries the response was YES. Maximal size of possible extension queue 2097. Compared 356595 event pairs, 32343 based on Foata normal form. 1/38888 useless extension candidates. Maximal degree in co-relation 150010. Up to 53966 conditions per place. [2025-04-13 20:11:06,158 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 218 selfloop transitions, 2 changer transitions 28/248 dead transitions. [2025-04-13 20:11:06,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 248 transitions, 2420 flow [2025-04-13 20:11:06,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:11:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:11:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-04-13 20:11:06,159 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29398148148148145 [2025-04-13 20:11:06,159 INFO L175 Difference]: Start difference. First operand has 171 places, 226 transitions, 1867 flow. Second operand 4 states and 127 transitions. [2025-04-13 20:11:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 248 transitions, 2420 flow [2025-04-13 20:11:06,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 248 transitions, 2391 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 20:11:06,459 INFO L231 Difference]: Finished difference. Result has 171 places, 220 transitions, 1791 flow [2025-04-13 20:11:06,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1791, PETRI_PLACES=171, PETRI_TRANSITIONS=220} [2025-04-13 20:11:06,459 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2025-04-13 20:11:06,459 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 220 transitions, 1791 flow [2025-04-13 20:11:06,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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:06,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:06,460 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:06,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:11:06,460 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:11:06,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -214321720, now seen corresponding path program 1 times [2025-04-13 20:11:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:06,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347818121] [2025-04-13 20:11:06,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:06,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:06,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-13 20:11:06,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-13 20:11:06,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:06,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:11:06,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:06,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347818121] [2025-04-13 20:11:06,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347818121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:06,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:06,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:11:06,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858362734] [2025-04-13 20:11:06,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:06,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:11:06,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:06,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:11:06,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:11:06,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:11:06,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 220 transitions, 1791 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:06,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:06,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:11:06,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:14,722 INFO L116 PetriNetUnfolderBase]: 31933/45138 cut-off events. [2025-04-13 20:11:14,723 INFO L117 PetriNetUnfolderBase]: For 74677/74677 co-relation queries the response was YES. [2025-04-13 20:11:14,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124143 conditions, 45138 events. 31933/45138 cut-off events. For 74677/74677 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 283146 event pairs, 22683 based on Foata normal form. 700/34145 useless extension candidates. Maximal degree in co-relation 124107. Up to 38002 conditions per place. [2025-04-13 20:11:15,038 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 235 selfloop transitions, 14 changer transitions 7/256 dead transitions. [2025-04-13 20:11:15,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 256 transitions, 2446 flow [2025-04-13 20:11:15,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:11:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:11:15,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-04-13 20:11:15,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2025-04-13 20:11:15,039 INFO L175 Difference]: Start difference. First operand has 171 places, 220 transitions, 1791 flow. Second operand 3 states and 128 transitions. [2025-04-13 20:11:15,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 256 transitions, 2446 flow [2025-04-13 20:11:15,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 256 transitions, 2413 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 20:11:15,219 INFO L231 Difference]: Finished difference. Result has 160 places, 221 transitions, 1810 flow [2025-04-13 20:11:15,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1759, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1810, PETRI_PLACES=160, PETRI_TRANSITIONS=221} [2025-04-13 20:11:15,219 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 82 predicate places. [2025-04-13 20:11:15,219 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 221 transitions, 1810 flow [2025-04-13 20:11:15,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:15,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:15,219 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:15,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 20:11:15,220 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:11:15,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:15,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1158532869, now seen corresponding path program 1 times [2025-04-13 20:11:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:15,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854618461] [2025-04-13 20:11:15,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:15,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-13 20:11:15,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-13 20:11:15,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:15,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:11:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:15,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854618461] [2025-04-13 20:11:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854618461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:15,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:15,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:11:15,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312304059] [2025-04-13 20:11:15,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:15,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:11:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:15,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:11:15,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:11:15,479 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:11:15,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 221 transitions, 1810 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:15,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:15,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:11:15,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:25,148 INFO L116 PetriNetUnfolderBase]: 35770/50499 cut-off events. [2025-04-13 20:11:25,148 INFO L117 PetriNetUnfolderBase]: For 91459/91459 co-relation queries the response was YES. [2025-04-13 20:11:25,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140508 conditions, 50499 events. 35770/50499 cut-off events. For 91459/91459 co-relation queries the response was YES. Maximal size of possible extension queue 1699. Compared 321806 event pairs, 26503 based on Foata normal form. 508/37606 useless extension candidates. Maximal degree in co-relation 140472. Up to 45161 conditions per place. [2025-04-13 20:11:25,518 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 254 selfloop transitions, 8 changer transitions 5/267 dead transitions. [2025-04-13 20:11:25,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 267 transitions, 2602 flow [2025-04-13 20:11:25,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:11:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:11:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-04-13 20:11:25,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2025-04-13 20:11:25,519 INFO L175 Difference]: Start difference. First operand has 160 places, 221 transitions, 1810 flow. Second operand 3 states and 130 transitions. [2025-04-13 20:11:25,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 267 transitions, 2602 flow [2025-04-13 20:11:25,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 267 transitions, 2588 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:11:25,738 INFO L231 Difference]: Finished difference. Result has 162 places, 222 transitions, 1828 flow [2025-04-13 20:11:25,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1796, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1828, PETRI_PLACES=162, PETRI_TRANSITIONS=222} [2025-04-13 20:11:25,739 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 84 predicate places. [2025-04-13 20:11:25,739 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 222 transitions, 1828 flow [2025-04-13 20:11:25,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states 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:25,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:25,739 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:25,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:11:25,739 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:11:25,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2085888643, now seen corresponding path program 1 times [2025-04-13 20:11:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:25,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648281149] [2025-04-13 20:11:25,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:25,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-13 20:11:25,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-13 20:11:25,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:11:25,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:11:26,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:26,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648281149] [2025-04-13 20:11:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648281149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:11:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526061168] [2025-04-13 20:11:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:26,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:11:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:26,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:11:26,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:11:26,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:11:26,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 222 transitions, 1828 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:26,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:26,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:11:26,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:36,662 INFO L116 PetriNetUnfolderBase]: 37583/53285 cut-off events. [2025-04-13 20:11:36,663 INFO L117 PetriNetUnfolderBase]: For 94973/94973 co-relation queries the response was YES. [2025-04-13 20:11:37,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148895 conditions, 53285 events. 37583/53285 cut-off events. For 94973/94973 co-relation queries the response was YES. Maximal size of possible extension queue 1790. Compared 344445 event pairs, 28301 based on Foata normal form. 1/39421 useless extension candidates. Maximal degree in co-relation 148858. Up to 46817 conditions per place. [2025-04-13 20:11:37,099 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 262 selfloop transitions, 10 changer transitions 21/293 dead transitions. [2025-04-13 20:11:37,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 293 transitions, 2654 flow [2025-04-13 20:11:37,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:11:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:11:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2025-04-13 20:11:37,107 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2623456790123457 [2025-04-13 20:11:37,107 INFO L175 Difference]: Start difference. First operand has 162 places, 222 transitions, 1828 flow. Second operand 6 states and 170 transitions. [2025-04-13 20:11:37,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 293 transitions, 2654 flow [2025-04-13 20:11:37,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 293 transitions, 2646 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:11:37,410 INFO L231 Difference]: Finished difference. Result has 168 places, 222 transitions, 1849 flow [2025-04-13 20:11:37,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1820, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1849, PETRI_PLACES=168, PETRI_TRANSITIONS=222} [2025-04-13 20:11:37,411 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 90 predicate places. [2025-04-13 20:11:37,411 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 222 transitions, 1849 flow [2025-04-13 20:11:37,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:37,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:37,411 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:37,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 20:11:37,411 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:11:37,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1690410459, now seen corresponding path program 2 times [2025-04-13 20:11:37,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:37,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765241255] [2025-04-13 20:11:37,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:11:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:37,457 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-13 20:11:37,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 114 statements. [2025-04-13 20:11:37,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:11:37,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:11:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:37,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765241255] [2025-04-13 20:11:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765241255] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:37,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:11:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157607609] [2025-04-13 20:11:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:37,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:11:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:37,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:11:37,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:11:37,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:11:37,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 222 transitions, 1849 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:37,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:37,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:11:37,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:47,539 INFO L116 PetriNetUnfolderBase]: 37447/53077 cut-off events. [2025-04-13 20:11:47,540 INFO L117 PetriNetUnfolderBase]: For 97156/97156 co-relation queries the response was YES. [2025-04-13 20:11:47,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148581 conditions, 53077 events. 37447/53077 cut-off events. For 97156/97156 co-relation queries the response was YES. Maximal size of possible extension queue 1778. Compared 340959 event pairs, 28814 based on Foata normal form. 1/39229 useless extension candidates. Maximal degree in co-relation 148542. Up to 48327 conditions per place. [2025-04-13 20:11:47,959 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 253 selfloop transitions, 11 changer transitions 22/286 dead transitions. [2025-04-13 20:11:47,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 286 transitions, 2656 flow [2025-04-13 20:11:47,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:11:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:11:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2025-04-13 20:11:47,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25462962962962965 [2025-04-13 20:11:47,960 INFO L175 Difference]: Start difference. First operand has 168 places, 222 transitions, 1849 flow. Second operand 6 states and 165 transitions. [2025-04-13 20:11:47,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 286 transitions, 2656 flow [2025-04-13 20:11:48,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 286 transitions, 2638 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:11:48,219 INFO L231 Difference]: Finished difference. Result has 171 places, 223 transitions, 1900 flow [2025-04-13 20:11:48,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1835, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=171, PETRI_TRANSITIONS=223} [2025-04-13 20:11:48,220 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2025-04-13 20:11:48,220 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 223 transitions, 1900 flow [2025-04-13 20:11:48,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:48,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:48,220 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:48,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 20:11:48,220 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:11:48,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash -272048061, now seen corresponding path program 3 times [2025-04-13 20:11:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:48,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528068572] [2025-04-13 20:11:48,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:11:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:48,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 8 equivalence classes. [2025-04-13 20:11:48,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 114 statements. [2025-04-13 20:11:48,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:11:48,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:11:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:11:48,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:11:48,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528068572] [2025-04-13 20:11:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528068572] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:11:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:11:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:11:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833000681] [2025-04-13 20:11:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:11:48,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:11:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:11:48,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:11:48,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:11:48,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:11:48,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 223 transitions, 1900 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:48,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:11:48,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:11:48,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:11:58,746 INFO L116 PetriNetUnfolderBase]: 37312/52870 cut-off events. [2025-04-13 20:11:58,747 INFO L117 PetriNetUnfolderBase]: For 101180/101180 co-relation queries the response was YES. [2025-04-13 20:11:59,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148555 conditions, 52870 events. 37312/52870 cut-off events. For 101180/101180 co-relation queries the response was YES. Maximal size of possible extension queue 1766. Compared 341130 event pairs, 28687 based on Foata normal form. 1/39038 useless extension candidates. Maximal degree in co-relation 148515. Up to 46817 conditions per place. [2025-04-13 20:11:59,121 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 240 selfloop transitions, 6 changer transitions 24/270 dead transitions. [2025-04-13 20:11:59,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 270 transitions, 2585 flow [2025-04-13 20:11:59,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:11:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:11:59,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2025-04-13 20:11:59,122 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2330246913580247 [2025-04-13 20:11:59,122 INFO L175 Difference]: Start difference. First operand has 171 places, 223 transitions, 1900 flow. Second operand 6 states and 151 transitions. [2025-04-13 20:11:59,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 270 transitions, 2585 flow [2025-04-13 20:11:59,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 270 transitions, 2568 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-04-13 20:11:59,512 INFO L231 Difference]: Finished difference. Result has 171 places, 221 transitions, 1856 flow [2025-04-13 20:11:59,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1856, PETRI_PLACES=171, PETRI_TRANSITIONS=221} [2025-04-13 20:11:59,512 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 93 predicate places. [2025-04-13 20:11:59,512 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 221 transitions, 1856 flow [2025-04-13 20:11:59,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:59,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:11:59,513 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:11:59,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 20:11:59,513 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:11:59,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:11:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1037403805, now seen corresponding path program 1 times [2025-04-13 20:11:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:11:59,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670531672] [2025-04-13 20:11:59,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:11:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:11:59,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-13 20:12:00,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-13 20:12:00,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:00,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:12:01,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:01,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670531672] [2025-04-13 20:12:01,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670531672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:01,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:01,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:12:01,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906925262] [2025-04-13 20:12:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:01,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:01,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:01,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:01,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:01,321 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:12:01,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 221 transitions, 1856 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:01,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:01,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:12:01,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:12,020 INFO L116 PetriNetUnfolderBase]: 38095/54048 cut-off events. [2025-04-13 20:12:12,020 INFO L117 PetriNetUnfolderBase]: For 99123/99123 co-relation queries the response was YES. [2025-04-13 20:12:12,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151773 conditions, 54048 events. 38095/54048 cut-off events. For 99123/99123 co-relation queries the response was YES. Maximal size of possible extension queue 1828. Compared 350284 event pairs, 24681 based on Foata normal form. 1/39953 useless extension candidates. Maximal degree in co-relation 151734. Up to 37164 conditions per place. [2025-04-13 20:12:12,402 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 258 selfloop transitions, 10 changer transitions 21/289 dead transitions. [2025-04-13 20:12:12,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 289 transitions, 2626 flow [2025-04-13 20:12:12,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:12:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:12:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-04-13 20:12:12,403 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32407407407407407 [2025-04-13 20:12:12,403 INFO L175 Difference]: Start difference. First operand has 171 places, 221 transitions, 1856 flow. Second operand 5 states and 175 transitions. [2025-04-13 20:12:12,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 289 transitions, 2626 flow [2025-04-13 20:12:12,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 289 transitions, 2609 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:12:12,667 INFO L231 Difference]: Finished difference. Result has 172 places, 221 transitions, 1872 flow [2025-04-13 20:12:12,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1872, PETRI_PLACES=172, PETRI_TRANSITIONS=221} [2025-04-13 20:12:12,668 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 94 predicate places. [2025-04-13 20:12:12,668 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 221 transitions, 1872 flow [2025-04-13 20:12:12,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:12,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:12,668 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:12,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:12:12,668 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:12:12,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1545562521, now seen corresponding path program 2 times [2025-04-13 20:12:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:12,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066616190] [2025-04-13 20:12:12,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:12,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:12,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-13 20:12:12,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 34 of 114 statements. [2025-04-13 20:12:12,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:12:12,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:12:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:13,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066616190] [2025-04-13 20:12:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066616190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:12:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746600097] [2025-04-13 20:12:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:13,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:13,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:13,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:13,111 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:12:13,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 221 transitions, 1872 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:13,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:13,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:12:13,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:24,001 INFO L116 PetriNetUnfolderBase]: 38798/55129 cut-off events. [2025-04-13 20:12:24,002 INFO L117 PetriNetUnfolderBase]: For 103390/103390 co-relation queries the response was YES. [2025-04-13 20:12:24,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154954 conditions, 55129 events. 38798/55129 cut-off events. For 103390/103390 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 359833 event pairs, 24819 based on Foata normal form. 35/40810 useless extension candidates. Maximal degree in co-relation 154914. Up to 37164 conditions per place. [2025-04-13 20:12:24,426 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 254 selfloop transitions, 9 changer transitions 23/286 dead transitions. [2025-04-13 20:12:24,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 286 transitions, 2622 flow [2025-04-13 20:12:24,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:12:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:12:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-04-13 20:12:24,427 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32037037037037036 [2025-04-13 20:12:24,427 INFO L175 Difference]: Start difference. First operand has 172 places, 221 transitions, 1872 flow. Second operand 5 states and 173 transitions. [2025-04-13 20:12:24,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 286 transitions, 2622 flow [2025-04-13 20:12:24,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 286 transitions, 2603 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:24,702 INFO L231 Difference]: Finished difference. Result has 174 places, 220 transitions, 1868 flow [2025-04-13 20:12:24,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1868, PETRI_PLACES=174, PETRI_TRANSITIONS=220} [2025-04-13 20:12:24,703 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 96 predicate places. [2025-04-13 20:12:24,703 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 220 transitions, 1868 flow [2025-04-13 20:12:24,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:24,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:24,703 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:24,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 20:12:24,703 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:12:24,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash 873559345, now seen corresponding path program 1 times [2025-04-13 20:12:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:24,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703919378] [2025-04-13 20:12:24,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:12:24,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:24,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-13 20:12:25,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-13 20:12:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:12:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:25,541 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:12:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:25,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703919378] [2025-04-13 20:12:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703919378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:12:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928310275] [2025-04-13 20:12:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:25,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:25,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:25,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:12:25,542 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:12:25,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 220 transitions, 1868 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:25,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:25,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:12:25,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:36,260 INFO L116 PetriNetUnfolderBase]: 38294/54421 cut-off events. [2025-04-13 20:12:36,260 INFO L117 PetriNetUnfolderBase]: For 103930/103930 co-relation queries the response was YES. [2025-04-13 20:12:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152881 conditions, 54421 events. 38294/54421 cut-off events. For 103930/103930 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 354248 event pairs, 31204 based on Foata normal form. 1/40252 useless extension candidates. Maximal degree in co-relation 152840. Up to 52075 conditions per place. [2025-04-13 20:12:36,664 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 227 selfloop transitions, 3 changer transitions 29/259 dead transitions. [2025-04-13 20:12:36,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 259 transitions, 2550 flow [2025-04-13 20:12:36,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:36,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-04-13 20:12:36,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2025-04-13 20:12:36,665 INFO L175 Difference]: Start difference. First operand has 174 places, 220 transitions, 1868 flow. Second operand 4 states and 136 transitions. [2025-04-13 20:12:36,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 259 transitions, 2550 flow [2025-04-13 20:12:36,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 259 transitions, 2530 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:12:36,984 INFO L231 Difference]: Finished difference. Result has 174 places, 215 transitions, 1794 flow [2025-04-13 20:12:36,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1794, PETRI_PLACES=174, PETRI_TRANSITIONS=215} [2025-04-13 20:12:36,984 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 96 predicate places. [2025-04-13 20:12:36,985 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 215 transitions, 1794 flow [2025-04-13 20:12:36,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:36,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:36,985 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:36,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 20:12:36,985 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:12:36,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1436278471, now seen corresponding path program 2 times [2025-04-13 20:12:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:36,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218108988] [2025-04-13 20:12:36,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:12:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:37,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-04-13 20:12:37,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 114 statements. [2025-04-13 20:12:37,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:12:37,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-04-13 20:12:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:37,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218108988] [2025-04-13 20:12:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218108988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:12:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259774371] [2025-04-13 20:12:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:37,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:12:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:12:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:12:37,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:12:37,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 215 transitions, 1794 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:37,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:37,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:12:37,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:47,818 INFO L116 PetriNetUnfolderBase]: 36923/52386 cut-off events. [2025-04-13 20:12:47,819 INFO L117 PetriNetUnfolderBase]: For 94801/94801 co-relation queries the response was YES. [2025-04-13 20:12:48,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146277 conditions, 52386 events. 36923/52386 cut-off events. For 94801/94801 co-relation queries the response was YES. Maximal size of possible extension queue 1759. Compared 337242 event pairs, 30230 based on Foata normal form. 1/38709 useless extension candidates. Maximal degree in co-relation 146237. Up to 50589 conditions per place. [2025-04-13 20:12:48,291 INFO L140 encePairwiseOnDemand]: 105/108 looper letters, 208 selfloop transitions, 0 changer transitions 39/247 dead transitions. [2025-04-13 20:12:48,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 247 transitions, 2413 flow [2025-04-13 20:12:48,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:12:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:12:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-04-13 20:12:48,292 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2986111111111111 [2025-04-13 20:12:48,292 INFO L175 Difference]: Start difference. First operand has 174 places, 215 transitions, 1794 flow. Second operand 4 states and 129 transitions. [2025-04-13 20:12:48,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 247 transitions, 2413 flow [2025-04-13 20:12:48,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 247 transitions, 2408 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-13 20:12:48,572 INFO L231 Difference]: Finished difference. Result has 175 places, 208 transitions, 1728 flow [2025-04-13 20:12:48,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1728, PETRI_PLACES=175, PETRI_TRANSITIONS=208} [2025-04-13 20:12:48,573 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2025-04-13 20:12:48,573 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 208 transitions, 1728 flow [2025-04-13 20:12:48,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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:48,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:48,573 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:48,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 20:12:48,573 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:12:48,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -374619771, now seen corresponding path program 3 times [2025-04-13 20:12:48,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:48,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672267402] [2025-04-13 20:12:48,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:12:48,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:48,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 8 equivalence classes. [2025-04-13 20:12:48,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 34 of 114 statements. [2025-04-13 20:12:48,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:12:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:12:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:12:49,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:12:49,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672267402] [2025-04-13 20:12:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672267402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:12:49,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:12:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:12:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72923775] [2025-04-13 20:12:49,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:12:49,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:12:49,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:12:49,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:12:49,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:12:49,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:12:49,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 208 transitions, 1728 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:49,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:12:49,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:12:49,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:12:58,630 INFO L116 PetriNetUnfolderBase]: 32963/46879 cut-off events. [2025-04-13 20:12:58,630 INFO L117 PetriNetUnfolderBase]: For 85029/85029 co-relation queries the response was YES. [2025-04-13 20:12:58,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131122 conditions, 46879 events. 32963/46879 cut-off events. For 85029/85029 co-relation queries the response was YES. Maximal size of possible extension queue 1564. Compared 298248 event pairs, 26196 based on Foata normal form. 1/35783 useless extension candidates. Maximal degree in co-relation 131082. Up to 43428 conditions per place. [2025-04-13 20:12:58,961 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 246 selfloop transitions, 11 changer transitions 19/276 dead transitions. [2025-04-13 20:12:58,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 276 transitions, 2571 flow [2025-04-13 20:12:58,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:12:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:12:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-04-13 20:12:58,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25308641975308643 [2025-04-13 20:12:58,962 INFO L175 Difference]: Start difference. First operand has 175 places, 208 transitions, 1728 flow. Second operand 6 states and 164 transitions. [2025-04-13 20:12:58,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 276 transitions, 2571 flow [2025-04-13 20:12:59,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 276 transitions, 2557 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:12:59,157 INFO L231 Difference]: Finished difference. Result has 175 places, 211 transitions, 1823 flow [2025-04-13 20:12:59,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1823, PETRI_PLACES=175, PETRI_TRANSITIONS=211} [2025-04-13 20:12:59,158 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2025-04-13 20:12:59,158 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 211 transitions, 1823 flow [2025-04-13 20:12:59,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:59,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:12:59,158 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:12:59,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 20:12:59,158 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:12:59,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:12:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -27189849, now seen corresponding path program 4 times [2025-04-13 20:12:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:12:59,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826484205] [2025-04-13 20:12:59,159 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:12:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:12:59,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 114 statements into 2 equivalence classes. [2025-04-13 20:12:59,263 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-04-13 20:12:59,264 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:12:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-04-13 20:13:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:00,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826484205] [2025-04-13 20:13:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826484205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:13:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:13:00,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:13:00,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666065744] [2025-04-13 20:13:00,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:13:00,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:13:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:13:00,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:13:00,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:13:00,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:13:00,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 211 transitions, 1823 flow. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:13:00,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:13:00,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:13:00,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:13:10,369 INFO L116 PetriNetUnfolderBase]: 34144/48704 cut-off events. [2025-04-13 20:13:10,369 INFO L117 PetriNetUnfolderBase]: For 95164/95164 co-relation queries the response was YES. [2025-04-13 20:13:10,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136564 conditions, 48704 events. 34144/48704 cut-off events. For 95164/95164 co-relation queries the response was YES. Maximal size of possible extension queue 1643. Compared 312986 event pairs, 27653 based on Foata normal form. 35/37274 useless extension candidates. Maximal degree in co-relation 136521. Up to 45817 conditions per place. [2025-04-13 20:13:10,782 INFO L140 encePairwiseOnDemand]: 101/108 looper letters, 244 selfloop transitions, 10 changer transitions 21/275 dead transitions. [2025-04-13 20:13:10,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 275 transitions, 2673 flow [2025-04-13 20:13:10,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:13:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:13:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2025-04-13 20:13:10,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24537037037037038 [2025-04-13 20:13:10,783 INFO L175 Difference]: Start difference. First operand has 175 places, 211 transitions, 1823 flow. Second operand 6 states and 159 transitions. [2025-04-13 20:13:10,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 275 transitions, 2673 flow [2025-04-13 20:13:11,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 275 transitions, 2648 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 20:13:11,056 INFO L231 Difference]: Finished difference. Result has 179 places, 215 transitions, 1934 flow [2025-04-13 20:13:11,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1934, PETRI_PLACES=179, PETRI_TRANSITIONS=215} [2025-04-13 20:13:11,057 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 101 predicate places. [2025-04-13 20:13:11,057 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 215 transitions, 1934 flow [2025-04-13 20:13:11,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:13:11,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:13:11,057 INFO L206 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:13:11,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 20:13:11,057 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:13:11,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:13:11,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1025841349, now seen corresponding path program 5 times [2025-04-13 20:13:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:13:11,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358633768] [2025-04-13 20:13:11,059 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:13:11,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 8 equivalence classes. [2025-04-13 20:13:12,677 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 114 of 114 statements. [2025-04-13 20:13:12,677 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-04-13 20:13:12,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:13:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-04-13 20:13:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:13:14,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358633768] [2025-04-13 20:13:14,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358633768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:13:14,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162273412] [2025-04-13 20:13:14,021 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:13:14,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:13:14,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:13:14,025 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:13:14,028 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:13:14,999 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 114 statements into 8 equivalence classes. Received shutdown request... [2025-04-13 20:15:31,839 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:15:31,840 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:15:32,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-13 20:15:33,040 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-13 20:15:33,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-13 20:15:33,061 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 20:15:33,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:15:33,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-04-13 20:15:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360394023] [2025-04-13 20:15:33,061 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-13 20:15:33,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:15:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:15:33,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:15:33,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:15:33,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 108 [2025-04-13 20:15:33,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 215 transitions, 1934 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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:15:33,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:15:33,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 108 [2025-04-13 20:15:33,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:15:33,063 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:15:33,063 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 20:15:33,064 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 20:15:33,065 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:15:33,065 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:15:33,065 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:15:33,066 INFO L422 BasicCegarLoop]: Path program histogram: [6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:15:33,073 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:15:33,073 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:15:33,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:15:33 BasicIcfg [2025-04-13 20:15:33,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:15:33,079 INFO L158 Benchmark]: Toolchain (without parser) took 697203.11ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 107.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2025-04-13 20:15:33,079 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:15:33,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.10ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 79.5MB in the end (delta: 28.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 20:15:33,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.72ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 67.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:15:33,081 INFO L158 Benchmark]: Boogie Preprocessor took 144.52ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 52.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 20:15:33,082 INFO L158 Benchmark]: RCFGBuilder took 4120.22ms. Allocated memory was 155.2MB in the beginning and 721.4MB in the end (delta: 566.2MB). Free memory was 52.6MB in the beginning and 592.0MB in the end (delta: -539.4MB). Peak memory consumption was 209.4MB. Max. memory is 8.0GB. [2025-04-13 20:15:33,082 INFO L158 Benchmark]: TraceAbstraction took 692501.54ms. Allocated memory was 721.4MB in the beginning and 2.9GB in the end (delta: 2.2GB). Free memory was 589.9MB in the beginning and 1.5GB in the end (delta: -947.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-04-13 20:15:33,083 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 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.10ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 79.5MB in the end (delta: 28.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 101.72ms. Allocated memory is still 155.2MB. Free memory was 79.5MB in the beginning and 67.2MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 144.52ms. Allocated memory is still 155.2MB. Free memory was 67.2MB in the beginning and 52.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * RCFGBuilder took 4120.22ms. Allocated memory was 155.2MB in the beginning and 721.4MB in the end (delta: 566.2MB). Free memory was 52.6MB in the beginning and 592.0MB in the end (delta: -539.4MB). Peak memory consumption was 209.4MB. Max. memory is 8.0GB. * TraceAbstraction took 692501.54ms. Allocated memory was 721.4MB in the beginning and 2.9GB in the end (delta: 2.2GB). Free memory was 589.9MB in the beginning and 1.5GB in the end (delta: -947.3MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 344]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 338]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 336]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 124 locations, 183 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 692.1s, OverallIterations: 45, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 514.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3133 SdHoareTripleChecker+Valid, 13.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3133 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16138 IncrementalHoareTripleChecker+Invalid, 16782 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 643 mSolverCounterUnsat, 0 mSDtfsCounter, 16138 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2450occurred in iteration=24, InterpolantAutomatonStates: 223, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 4900 NumberOfCodeBlocks, 3488 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 5061 ConstructedInterpolants, 0 QuantifiedInterpolants, 13421 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3501 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 52 InterpolantComputations, 41 PerfectInterpolantSequences, 15539/15743 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown