/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:08:03,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:08:03,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:08:03,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:08:03,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:08:03,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:08:03,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:08:03,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:08:03,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:08:03,689 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:08:03,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:08:03,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:08:03,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:08:03,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:08:03,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:08:03,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:08:03,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:08:03,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:08:03,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:08:03,693 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:08:03,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:08:03,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:08:03,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:08:03,888 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:08:03,888 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:08:03,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-04-14 01:08:05,139 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c61e509/2eac4133bf51482ebb9d4ab3040144e6/FLAGb109ef3ef [2025-04-14 01:08:05,333 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:08:05,334 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-04-14 01:08:05,354 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c61e509/2eac4133bf51482ebb9d4ab3040144e6/FLAGb109ef3ef [2025-04-14 01:08:06,190 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c61e509/2eac4133bf51482ebb9d4ab3040144e6 [2025-04-14 01:08:06,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:08:06,196 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:08:06,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:08:06,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:08:06,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:08:06,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5a91ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06, skipping insertion in model container [2025-04-14 01:08:06,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:08:06,394 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/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-04-14 01:08:06,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:08:06,410 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:08:06,441 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/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-04-14 01:08:06,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:08:06,458 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:08:06,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06 WrapperNode [2025-04-14 01:08:06,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:08:06,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:08:06,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:08:06,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:08:06,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,499 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2025-04-14 01:08:06,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:08:06,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:08:06,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:08:06,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:08:06,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,522 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:08:06,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:08:06,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:08:06,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:08:06,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:08:06,531 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (1/1) ... [2025-04-14 01:08:06,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:08:06,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:06,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:08:06,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:08:06,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:08:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:08:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:08:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:08:06,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:08:06,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:08:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:08:06,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:08:06,575 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:08:06,651 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:08:06,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:08:06,868 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:08:06,869 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:08:06,869 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:08:07,065 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:08:07,066 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:08:07,069 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:08:07,073 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:08:07,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:08:07 BoogieIcfgContainer [2025-04-14 01:08:07,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:08:07,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:08:07,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:08:07,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:08:07,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:08:06" (1/3) ... [2025-04-14 01:08:07,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e140e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:08:07, skipping insertion in model container [2025-04-14 01:08:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:08:06" (2/3) ... [2025-04-14 01:08:07,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e140e54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:08:07, skipping insertion in model container [2025-04-14 01:08:07,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:08:07" (3/3) ... [2025-04-14 01:08:07,096 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-04-14 01:08:07,104 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:08:07,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:08:07,106 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:08:07,146 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:08:07,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:08:07,184 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:08:07,186 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:08:07,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-14 01:08:07,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:08:07,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:08:07,198 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:08:07,207 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;@fa8b678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:08:07,207 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:08:07,213 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:08:07,213 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:08:07,213 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:08:07,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:07,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:07,214 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:07,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:07,217 INFO L85 PathProgramCache]: Analyzing trace with hash 369069248, now seen corresponding path program 1 times [2025-04-14 01:08:07,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:07,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707161228] [2025-04-14 01:08:07,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:07,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:08:07,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:08:07,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:07,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:07,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707161228] [2025-04-14 01:08:07,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707161228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:08:07,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811193900] [2025-04-14 01:08:07,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:07,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:08:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:07,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:08:07,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:08:07,526 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:07,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:07,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:07,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:07,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:07,731 INFO L116 PetriNetUnfolderBase]: 728/1005 cut-off events. [2025-04-14 01:08:07,731 INFO L117 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-04-14 01:08:07,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1005 events. 728/1005 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3401 event pairs, 126 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 1860. Up to 788 conditions per place. [2025-04-14 01:08:07,739 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2025-04-14 01:08:07,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 45 transitions, 213 flow [2025-04-14 01:08:07,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:08:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:08:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-14 01:08:07,747 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-04-14 01:08:07,748 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 55 transitions. [2025-04-14 01:08:07,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 45 transitions, 213 flow [2025-04-14 01:08:07,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:07,753 INFO L231 Difference]: Finished difference. Result has 28 places, 31 transitions, 88 flow [2025-04-14 01:08:07,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=28, PETRI_TRANSITIONS=31} [2025-04-14 01:08:07,757 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-14 01:08:07,757 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 31 transitions, 88 flow [2025-04-14 01:08:07,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:07,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:07,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:07,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:08:07,757 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:07,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1785021513, now seen corresponding path program 1 times [2025-04-14 01:08:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:07,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864919686] [2025-04-14 01:08:07,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:07,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:08:07,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:08:07,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:07,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864919686] [2025-04-14 01:08:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864919686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:08:07,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810921736] [2025-04-14 01:08:07,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:07,881 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:07,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:07,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:07,881 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:07,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 31 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:07,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:07,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:07,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:08,040 INFO L116 PetriNetUnfolderBase]: 991/1389 cut-off events. [2025-04-14 01:08:08,041 INFO L117 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2025-04-14 01:08:08,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 1389 events. 991/1389 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4844 event pairs, 566 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1023. Up to 851 conditions per place. [2025-04-14 01:08:08,050 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 52 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-04-14 01:08:08,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 56 transitions, 268 flow [2025-04-14 01:08:08,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:08,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 01:08:08,052 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:08:08,052 INFO L175 Difference]: Start difference. First operand has 28 places, 31 transitions, 88 flow. Second operand 4 states and 64 transitions. [2025-04-14 01:08:08,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 56 transitions, 268 flow [2025-04-14 01:08:08,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:08,054 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 114 flow [2025-04-14 01:08:08,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-04-14 01:08:08,055 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-14 01:08:08,055 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 114 flow [2025-04-14 01:08:08,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:08,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:08,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:08:08,055 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:08,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash 777352789, now seen corresponding path program 1 times [2025-04-14 01:08:08,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:08,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414306903] [2025-04-14 01:08:08,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:08,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:08,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:08:08,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:08:08,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:08,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:08,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:08,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414306903] [2025-04-14 01:08:08,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414306903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:08,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:08,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:08,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275622454] [2025-04-14 01:08:08,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:08,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:08,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:08,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:08,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:08,140 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:08,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:08,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:08,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:08,299 INFO L116 PetriNetUnfolderBase]: 1053/1503 cut-off events. [2025-04-14 01:08:08,300 INFO L117 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-04-14 01:08:08,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 1503 events. 1053/1503 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5704 event pairs, 369 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2489. Up to 889 conditions per place. [2025-04-14 01:08:08,307 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-04-14 01:08:08,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 61 transitions, 317 flow [2025-04-14 01:08:08,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 01:08:08,308 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:08:08,308 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 114 flow. Second operand 4 states and 64 transitions. [2025-04-14 01:08:08,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 61 transitions, 317 flow [2025-04-14 01:08:08,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 315 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-14 01:08:08,310 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 150 flow [2025-04-14 01:08:08,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-04-14 01:08:08,311 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-04-14 01:08:08,311 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 150 flow [2025-04-14 01:08:08,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:08,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:08,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:08:08,311 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:08,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1357850277, now seen corresponding path program 2 times [2025-04-14 01:08:08,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:08,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084331963] [2025-04-14 01:08:08,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:08,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:08,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:08:08,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:08:08,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:08,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:08,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084331963] [2025-04-14 01:08:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084331963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:08,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470096423] [2025-04-14 01:08:08,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:08,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:08,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:08,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:08,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:08,398 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:08,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:08,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:08,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:08,528 INFO L116 PetriNetUnfolderBase]: 889/1294 cut-off events. [2025-04-14 01:08:08,529 INFO L117 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2025-04-14 01:08:08,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 1294 events. 889/1294 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4884 event pairs, 192 based on Foata normal form. 76/1126 useless extension candidates. Maximal degree in co-relation 2551. Up to 1014 conditions per place. [2025-04-14 01:08:08,534 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 51 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-04-14 01:08:08,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 315 flow [2025-04-14 01:08:08,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-14 01:08:08,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-14 01:08:08,535 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 150 flow. Second operand 4 states and 58 transitions. [2025-04-14 01:08:08,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 315 flow [2025-04-14 01:08:08,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:08,537 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 178 flow [2025-04-14 01:08:08,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-14 01:08:08,537 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2025-04-14 01:08:08,537 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 178 flow [2025-04-14 01:08:08,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:08,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:08,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:08:08,538 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:08,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -159777157, now seen corresponding path program 1 times [2025-04-14 01:08:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:08,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111820039] [2025-04-14 01:08:08,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:08:08,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:08:08,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:08,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:08,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:08,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111820039] [2025-04-14 01:08:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111820039] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289683090] [2025-04-14 01:08:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:08,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:08,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:08,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:08,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:08,608 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:08,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:08,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:08,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:08,744 INFO L116 PetriNetUnfolderBase]: 944/1402 cut-off events. [2025-04-14 01:08:08,744 INFO L117 PetriNetUnfolderBase]: For 1564/1564 co-relation queries the response was YES. [2025-04-14 01:08:08,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1402 events. 944/1402 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5463 event pairs, 434 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 3008. Up to 1024 conditions per place. [2025-04-14 01:08:08,752 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 54 selfloop transitions, 7 changer transitions 9/70 dead transitions. [2025-04-14 01:08:08,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 451 flow [2025-04-14 01:08:08,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-14 01:08:08,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:08:08,754 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 178 flow. Second operand 4 states and 64 transitions. [2025-04-14 01:08:08,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 451 flow [2025-04-14 01:08:08,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:08,757 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 197 flow [2025-04-14 01:08:08,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-04-14 01:08:08,757 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-04-14 01:08:08,757 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 197 flow [2025-04-14 01:08:08,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:08,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:08,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:08:08,759 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:08,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1935194527, now seen corresponding path program 2 times [2025-04-14 01:08:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:08,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618893142] [2025-04-14 01:08:08,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:08,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:08:08,774 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:08:08,774 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:08,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:08,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:08,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618893142] [2025-04-14 01:08:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618893142] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:08,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:08,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450387854] [2025-04-14 01:08:08,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:08,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:08,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:08,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:08,826 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:08,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:08,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:08,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:08,962 INFO L116 PetriNetUnfolderBase]: 864/1284 cut-off events. [2025-04-14 01:08:08,962 INFO L117 PetriNetUnfolderBase]: For 2123/2123 co-relation queries the response was YES. [2025-04-14 01:08:08,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1284 events. 864/1284 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4794 event pairs, 231 based on Foata normal form. 32/1132 useless extension candidates. Maximal degree in co-relation 3008. Up to 1093 conditions per place. [2025-04-14 01:08:08,967 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 44 selfloop transitions, 4 changer transitions 8/56 dead transitions. [2025-04-14 01:08:08,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 376 flow [2025-04-14 01:08:08,967 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-14 01:08:08,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 01:08:08,968 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 197 flow. Second operand 4 states and 56 transitions. [2025-04-14 01:08:08,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 376 flow [2025-04-14 01:08:08,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:08,974 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 166 flow [2025-04-14 01:08:08,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-04-14 01:08:08,974 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-14 01:08:08,974 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 166 flow [2025-04-14 01:08:08,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:08,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:08,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:08,975 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:08:08,975 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:08,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1864635653, now seen corresponding path program 1 times [2025-04-14 01:08:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:08,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868576479] [2025-04-14 01:08:08,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:08,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:08,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:08:08,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:08:08,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:08,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:09,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:09,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868576479] [2025-04-14 01:08:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868576479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:09,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202161323] [2025-04-14 01:08:09,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:09,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:09,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:09,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:09,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:08:09,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:08:09,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:08:09,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:09,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:08:09,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:09,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202161323] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:09,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:09,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-14 01:08:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789198293] [2025-04-14 01:08:09,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:09,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:08:09,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:08:09,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:08:09,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:09,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:09,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:09,334 INFO L116 PetriNetUnfolderBase]: 726/1058 cut-off events. [2025-04-14 01:08:09,334 INFO L117 PetriNetUnfolderBase]: For 1367/1367 co-relation queries the response was YES. [2025-04-14 01:08:09,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 1058 events. 726/1058 cut-off events. For 1367/1367 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3728 event pairs, 163 based on Foata normal form. 12/908 useless extension candidates. Maximal degree in co-relation 3085. Up to 666 conditions per place. [2025-04-14 01:08:09,339 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 52 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-04-14 01:08:09,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 366 flow [2025-04-14 01:08:09,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:08:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:08:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-14 01:08:09,340 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38125 [2025-04-14 01:08:09,340 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 166 flow. Second operand 5 states and 61 transitions. [2025-04-14 01:08:09,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 366 flow [2025-04-14 01:08:09,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 319 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-04-14 01:08:09,343 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 171 flow [2025-04-14 01:08:09,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-14 01:08:09,343 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-14 01:08:09,343 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 171 flow [2025-04-14 01:08:09,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:09,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:09,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:08:09,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:09,548 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:09,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1213215271, now seen corresponding path program 2 times [2025-04-14 01:08:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:09,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999543203] [2025-04-14 01:08:09,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:09,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:09,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:08:09,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-04-14 01:08:09,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:09,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:09,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999543203] [2025-04-14 01:08:09,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999543203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:09,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:09,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657616625] [2025-04-14 01:08:09,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:09,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:09,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:09,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:09,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:09,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:09,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:09,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:09,782 INFO L116 PetriNetUnfolderBase]: 789/1150 cut-off events. [2025-04-14 01:08:09,782 INFO L117 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2025-04-14 01:08:09,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1150 events. 789/1150 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4357 event pairs, 50 based on Foata normal form. 9/983 useless extension candidates. Maximal degree in co-relation 3309. Up to 657 conditions per place. [2025-04-14 01:08:09,788 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 75 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2025-04-14 01:08:09,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 83 transitions, 488 flow [2025-04-14 01:08:09,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:08:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:08:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-14 01:08:09,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-14 01:08:09,789 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 171 flow. Second operand 5 states and 84 transitions. [2025-04-14 01:08:09,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 83 transitions, 488 flow [2025-04-14 01:08:09,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:08:09,791 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 231 flow [2025-04-14 01:08:09,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-04-14 01:08:09,791 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-14 01:08:09,791 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 231 flow [2025-04-14 01:08:09,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:09,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:09,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:08:09,792 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:09,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:09,792 INFO L85 PathProgramCache]: Analyzing trace with hash 852478981, now seen corresponding path program 3 times [2025-04-14 01:08:09,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:09,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169876990] [2025-04-14 01:08:09,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:09,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:09,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:08:09,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-04-14 01:08:09,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:09,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:09,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:09,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169876990] [2025-04-14 01:08:09,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169876990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:09,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:09,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:09,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837841634] [2025-04-14 01:08:09,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:09,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:09,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:09,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:09,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:09,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:09,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:09,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:09,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:09,989 INFO L116 PetriNetUnfolderBase]: 787/1148 cut-off events. [2025-04-14 01:08:09,989 INFO L117 PetriNetUnfolderBase]: For 1946/1946 co-relation queries the response was YES. [2025-04-14 01:08:09,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3683 conditions, 1148 events. 787/1148 cut-off events. For 1946/1946 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4148 event pairs, 335 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 3656. Up to 950 conditions per place. [2025-04-14 01:08:09,995 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 67 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2025-04-14 01:08:09,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 480 flow [2025-04-14 01:08:09,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:08:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:08:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-14 01:08:09,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-04-14 01:08:09,996 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 231 flow. Second operand 4 states and 62 transitions. [2025-04-14 01:08:09,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 480 flow [2025-04-14 01:08:09,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 465 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:09,999 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 245 flow [2025-04-14 01:08:09,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=245, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-04-14 01:08:09,999 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2025-04-14 01:08:09,999 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 245 flow [2025-04-14 01:08:09,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:09,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:09,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:09,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:08:09,999 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:10,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 834857679, now seen corresponding path program 4 times [2025-04-14 01:08:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:10,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502495144] [2025-04-14 01:08:10,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:10,008 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-14 01:08:10,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 18 statements. [2025-04-14 01:08:10,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:08:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:10,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502495144] [2025-04-14 01:08:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502495144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:08:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659780016] [2025-04-14 01:08:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:10,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:08:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:10,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:08:10,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:08:10,040 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:10,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:10,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:10,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:10,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:10,217 INFO L116 PetriNetUnfolderBase]: 774/1123 cut-off events. [2025-04-14 01:08:10,218 INFO L117 PetriNetUnfolderBase]: For 1938/1938 co-relation queries the response was YES. [2025-04-14 01:08:10,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3582 conditions, 1123 events. 774/1123 cut-off events. For 1938/1938 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4099 event pairs, 127 based on Foata normal form. 9/958 useless extension candidates. Maximal degree in co-relation 3553. Up to 616 conditions per place. [2025-04-14 01:08:10,223 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 75 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2025-04-14 01:08:10,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 561 flow [2025-04-14 01:08:10,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:08:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:08:10,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-14 01:08:10,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:08:10,224 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 245 flow. Second operand 5 states and 80 transitions. [2025-04-14 01:08:10,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 561 flow [2025-04-14 01:08:10,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:10,229 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 293 flow [2025-04-14 01:08:10,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-04-14 01:08:10,230 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2025-04-14 01:08:10,230 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 293 flow [2025-04-14 01:08:10,230 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:10,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:10,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:10,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:08:10,230 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:10,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:10,231 INFO L85 PathProgramCache]: Analyzing trace with hash 683634762, now seen corresponding path program 1 times [2025-04-14 01:08:10,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:10,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953578336] [2025-04-14 01:08:10,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:10,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:10,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:10,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:10,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:10,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:10,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:10,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:10,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953578336] [2025-04-14 01:08:10,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953578336] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:10,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:10,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:10,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084167755] [2025-04-14 01:08:10,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:10,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:10,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:10,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:10,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:10,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 293 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:10,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:10,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:10,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:10,887 INFO L116 PetriNetUnfolderBase]: 928/1356 cut-off events. [2025-04-14 01:08:10,887 INFO L117 PetriNetUnfolderBase]: For 2435/2435 co-relation queries the response was YES. [2025-04-14 01:08:10,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4417 conditions, 1356 events. 928/1356 cut-off events. For 2435/2435 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5362 event pairs, 62 based on Foata normal form. 1/1135 useless extension candidates. Maximal degree in co-relation 4387. Up to 1076 conditions per place. [2025-04-14 01:08:10,892 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 95 selfloop transitions, 33 changer transitions 1/129 dead transitions. [2025-04-14 01:08:10,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 129 transitions, 956 flow [2025-04-14 01:08:10,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:08:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:08:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2025-04-14 01:08:10,894 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:08:10,894 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 293 flow. Second operand 11 states and 132 transitions. [2025-04-14 01:08:10,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 129 transitions, 956 flow [2025-04-14 01:08:10,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 938 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:10,898 INFO L231 Difference]: Finished difference. Result has 70 places, 75 transitions, 540 flow [2025-04-14 01:08:10,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=540, PETRI_PLACES=70, PETRI_TRANSITIONS=75} [2025-04-14 01:08:10,898 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2025-04-14 01:08:10,898 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 75 transitions, 540 flow [2025-04-14 01:08:10,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:10,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:10,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:10,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:08:10,899 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:10,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1858281244, now seen corresponding path program 2 times [2025-04-14 01:08:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:10,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644234339] [2025-04-14 01:08:10,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:10,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:10,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:10,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:10,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:11,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644234339] [2025-04-14 01:08:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644234339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:11,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:11,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:11,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375499532] [2025-04-14 01:08:11,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:11,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:11,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:11,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:11,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:11,219 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:11,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 75 transitions, 540 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:11,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:11,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:11,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:11,436 INFO L116 PetriNetUnfolderBase]: 983/1452 cut-off events. [2025-04-14 01:08:11,436 INFO L117 PetriNetUnfolderBase]: For 3192/3192 co-relation queries the response was YES. [2025-04-14 01:08:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1452 events. 983/1452 cut-off events. For 3192/3192 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5866 event pairs, 102 based on Foata normal form. 1/1215 useless extension candidates. Maximal degree in co-relation 5462. Up to 1268 conditions per place. [2025-04-14 01:08:11,444 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 100 selfloop transitions, 26 changer transitions 1/127 dead transitions. [2025-04-14 01:08:11,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 127 transitions, 1088 flow [2025-04-14 01:08:11,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:11,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2025-04-14 01:08:11,446 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33125 [2025-04-14 01:08:11,446 INFO L175 Difference]: Start difference. First operand has 70 places, 75 transitions, 540 flow. Second operand 10 states and 106 transitions. [2025-04-14 01:08:11,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 127 transitions, 1088 flow [2025-04-14 01:08:11,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 127 transitions, 1043 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-14 01:08:11,453 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 741 flow [2025-04-14 01:08:11,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=741, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2025-04-14 01:08:11,454 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-04-14 01:08:11,454 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 741 flow [2025-04-14 01:08:11,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:11,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:11,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:11,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:08:11,454 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:11,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:11,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1005024108, now seen corresponding path program 1 times [2025-04-14 01:08:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:11,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174877423] [2025-04-14 01:08:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:11,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:11,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:11,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:11,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:11,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:11,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:11,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174877423] [2025-04-14 01:08:11,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174877423] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:11,798 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002234685] [2025-04-14 01:08:11,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:08:11,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:11,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:11,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:11,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:08:11,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:11,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 01:08:11,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:11,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:11,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:08:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002234685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:08:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-04-14 01:08:11,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360395383] [2025-04-14 01:08:11,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:11,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:08:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:11,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:08:11,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:08:11,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:11,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 741 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:08:11,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:11,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:11,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:12,222 INFO L116 PetriNetUnfolderBase]: 1257/1846 cut-off events. [2025-04-14 01:08:12,222 INFO L117 PetriNetUnfolderBase]: For 4473/4473 co-relation queries the response was YES. [2025-04-14 01:08:12,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7372 conditions, 1846 events. 1257/1846 cut-off events. For 4473/4473 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7777 event pairs, 177 based on Foata normal form. 1/1550 useless extension candidates. Maximal degree in co-relation 7329. Up to 1429 conditions per place. [2025-04-14 01:08:12,230 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 116 selfloop transitions, 35 changer transitions 1/152 dead transitions. [2025-04-14 01:08:12,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 152 transitions, 1388 flow [2025-04-14 01:08:12,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:08:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:08:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-04-14 01:08:12,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47767857142857145 [2025-04-14 01:08:12,231 INFO L175 Difference]: Start difference. First operand has 82 places, 94 transitions, 741 flow. Second operand 7 states and 107 transitions. [2025-04-14 01:08:12,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 152 transitions, 1388 flow [2025-04-14 01:08:12,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 152 transitions, 1356 flow, removed 15 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:12,238 INFO L231 Difference]: Finished difference. Result has 90 places, 108 transitions, 937 flow [2025-04-14 01:08:12,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=937, PETRI_PLACES=90, PETRI_TRANSITIONS=108} [2025-04-14 01:08:12,238 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 59 predicate places. [2025-04-14 01:08:12,238 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 108 transitions, 937 flow [2025-04-14 01:08:12,238 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:08:12,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:12,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:12,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:08:12,443 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,SelfDestructingSolverStorable12 [2025-04-14 01:08:12,443 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:12,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1778496092, now seen corresponding path program 2 times [2025-04-14 01:08:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:12,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164098115] [2025-04-14 01:08:12,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:12,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:12,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:12,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:12,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:12,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:12,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164098115] [2025-04-14 01:08:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164098115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042122582] [2025-04-14 01:08:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:12,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:12,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:12,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:12,638 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:12,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 108 transitions, 937 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:12,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:12,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:12,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:13,021 INFO L116 PetriNetUnfolderBase]: 1619/2383 cut-off events. [2025-04-14 01:08:13,022 INFO L117 PetriNetUnfolderBase]: For 7884/7884 co-relation queries the response was YES. [2025-04-14 01:08:13,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 2383 events. 1619/2383 cut-off events. For 7884/7884 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 10922 event pairs, 135 based on Foata normal form. 1/2028 useless extension candidates. Maximal degree in co-relation 10272. Up to 1626 conditions per place. [2025-04-14 01:08:13,037 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 118 selfloop transitions, 72 changer transitions 1/191 dead transitions. [2025-04-14 01:08:13,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 191 transitions, 1861 flow [2025-04-14 01:08:13,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-04-14 01:08:13,039 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2025-04-14 01:08:13,039 INFO L175 Difference]: Start difference. First operand has 90 places, 108 transitions, 937 flow. Second operand 9 states and 134 transitions. [2025-04-14 01:08:13,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 191 transitions, 1861 flow [2025-04-14 01:08:13,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 191 transitions, 1761 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:13,052 INFO L231 Difference]: Finished difference. Result has 97 places, 131 transitions, 1242 flow [2025-04-14 01:08:13,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1242, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2025-04-14 01:08:13,053 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2025-04-14 01:08:13,053 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1242 flow [2025-04-14 01:08:13,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:13,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:13,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:13,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:08:13,053 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:13,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:13,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1257510554, now seen corresponding path program 3 times [2025-04-14 01:08:13,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:13,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108740489] [2025-04-14 01:08:13,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:13,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:13,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:13,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:13,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:13,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108740489] [2025-04-14 01:08:13,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108740489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:13,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:13,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:13,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935306459] [2025-04-14 01:08:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:13,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:13,303 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:13,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1242 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:13,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:13,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:13,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:13,740 INFO L116 PetriNetUnfolderBase]: 1657/2462 cut-off events. [2025-04-14 01:08:13,740 INFO L117 PetriNetUnfolderBase]: For 8243/8243 co-relation queries the response was YES. [2025-04-14 01:08:13,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11203 conditions, 2462 events. 1657/2462 cut-off events. For 8243/8243 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 11552 event pairs, 115 based on Foata normal form. 1/2101 useless extension candidates. Maximal degree in co-relation 11153. Up to 1831 conditions per place. [2025-04-14 01:08:13,753 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 122 selfloop transitions, 74 changer transitions 1/197 dead transitions. [2025-04-14 01:08:13,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 197 transitions, 2019 flow [2025-04-14 01:08:13,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:08:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:08:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2025-04-14 01:08:13,755 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3880208333333333 [2025-04-14 01:08:13,755 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 1242 flow. Second operand 12 states and 149 transitions. [2025-04-14 01:08:13,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 197 transitions, 2019 flow [2025-04-14 01:08:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 197 transitions, 1945 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-04-14 01:08:13,772 INFO L231 Difference]: Finished difference. Result has 109 places, 140 transitions, 1460 flow [2025-04-14 01:08:13,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1460, PETRI_PLACES=109, PETRI_TRANSITIONS=140} [2025-04-14 01:08:13,772 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 78 predicate places. [2025-04-14 01:08:13,772 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 140 transitions, 1460 flow [2025-04-14 01:08:13,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:13,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:13,772 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:13,772 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:08:13,773 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:13,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash -75196964, now seen corresponding path program 4 times [2025-04-14 01:08:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:13,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986935231] [2025-04-14 01:08:13,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:13,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:13,785 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:13,785 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:13,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:14,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:14,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986935231] [2025-04-14 01:08:14,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986935231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:14,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:14,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:14,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483846853] [2025-04-14 01:08:14,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:14,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:14,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:14,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:14,059 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:14,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 140 transitions, 1460 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:14,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:14,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:14,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:14,568 INFO L116 PetriNetUnfolderBase]: 2030/3012 cut-off events. [2025-04-14 01:08:14,569 INFO L117 PetriNetUnfolderBase]: For 11732/11732 co-relation queries the response was YES. [2025-04-14 01:08:14,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14556 conditions, 3012 events. 2030/3012 cut-off events. For 11732/11732 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 14528 event pairs, 262 based on Foata normal form. 1/2577 useless extension candidates. Maximal degree in co-relation 14502. Up to 2289 conditions per place. [2025-04-14 01:08:14,586 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 143 selfloop transitions, 92 changer transitions 1/236 dead transitions. [2025-04-14 01:08:14,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 236 transitions, 2714 flow [2025-04-14 01:08:14,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:08:14,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:08:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2025-04-14 01:08:14,587 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:08:14,587 INFO L175 Difference]: Start difference. First operand has 109 places, 140 transitions, 1460 flow. Second operand 12 states and 148 transitions. [2025-04-14 01:08:14,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 236 transitions, 2714 flow [2025-04-14 01:08:14,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 236 transitions, 2467 flow, removed 44 selfloop flow, removed 8 redundant places. [2025-04-14 01:08:14,611 INFO L231 Difference]: Finished difference. Result has 119 places, 186 transitions, 2143 flow [2025-04-14 01:08:14,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2143, PETRI_PLACES=119, PETRI_TRANSITIONS=186} [2025-04-14 01:08:14,612 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2025-04-14 01:08:14,612 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 186 transitions, 2143 flow [2025-04-14 01:08:14,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:14,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:14,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:14,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:08:14,613 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:14,613 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1373299750, now seen corresponding path program 5 times [2025-04-14 01:08:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:14,613 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134386751] [2025-04-14 01:08:14,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:14,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:14,628 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:14,629 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:14,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:14,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134386751] [2025-04-14 01:08:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134386751] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:14,873 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587162234] [2025-04-14 01:08:14,873 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:14,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:14,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:14,875 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:14,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:08:14,922 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:14,938 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:14,938 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:14,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:14,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:08:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:14,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:08:15,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:08:15,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-14 01:08:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:15,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:15,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:15,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587162234] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:15,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:15,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 18 [2025-04-14 01:08:15,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485125168] [2025-04-14 01:08:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:15,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:08:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:15,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:08:15,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:08:15,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:15,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 186 transitions, 2143 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:15,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:15,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:15,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:15,995 INFO L116 PetriNetUnfolderBase]: 2796/4144 cut-off events. [2025-04-14 01:08:15,996 INFO L117 PetriNetUnfolderBase]: For 23595/23595 co-relation queries the response was YES. [2025-04-14 01:08:16,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21530 conditions, 4144 events. 2796/4144 cut-off events. For 23595/23595 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 21269 event pairs, 280 based on Foata normal form. 1/3601 useless extension candidates. Maximal degree in co-relation 21470. Up to 2452 conditions per place. [2025-04-14 01:08:16,025 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 173 selfloop transitions, 184 changer transitions 1/358 dead transitions. [2025-04-14 01:08:16,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 358 transitions, 4430 flow [2025-04-14 01:08:16,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:08:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:08:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 196 transitions. [2025-04-14 01:08:16,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-14 01:08:16,027 INFO L175 Difference]: Start difference. First operand has 119 places, 186 transitions, 2143 flow. Second operand 14 states and 196 transitions. [2025-04-14 01:08:16,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 358 transitions, 4430 flow [2025-04-14 01:08:16,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 358 transitions, 4327 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-04-14 01:08:16,085 INFO L231 Difference]: Finished difference. Result has 139 places, 280 transitions, 3827 flow [2025-04-14 01:08:16,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3827, PETRI_PLACES=139, PETRI_TRANSITIONS=280} [2025-04-14 01:08:16,086 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2025-04-14 01:08:16,086 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 280 transitions, 3827 flow [2025-04-14 01:08:16,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:16,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:16,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:08:16,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:16,287 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:16,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:16,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2113765798, now seen corresponding path program 6 times [2025-04-14 01:08:16,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:16,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617627371] [2025-04-14 01:08:16,287 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:08:16,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:16,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:16,303 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:16,303 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:08:16,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:16,505 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617627371] [2025-04-14 01:08:16,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617627371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:16,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:16,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639660943] [2025-04-14 01:08:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:16,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:16,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:16,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:16,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:16,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:16,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 280 transitions, 3827 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:16,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:16,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:16,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:17,139 INFO L116 PetriNetUnfolderBase]: 2890/4289 cut-off events. [2025-04-14 01:08:17,139 INFO L117 PetriNetUnfolderBase]: For 33355/33355 co-relation queries the response was YES. [2025-04-14 01:08:17,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27077 conditions, 4289 events. 2890/4289 cut-off events. For 33355/33355 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 22051 event pairs, 367 based on Foata normal form. 1/3726 useless extension candidates. Maximal degree in co-relation 27006. Up to 3366 conditions per place. [2025-04-14 01:08:17,171 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 187 selfloop transitions, 184 changer transitions 1/372 dead transitions. [2025-04-14 01:08:17,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 372 transitions, 5432 flow [2025-04-14 01:08:17,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:08:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:08:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2025-04-14 01:08:17,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3880208333333333 [2025-04-14 01:08:17,173 INFO L175 Difference]: Start difference. First operand has 139 places, 280 transitions, 3827 flow. Second operand 12 states and 149 transitions. [2025-04-14 01:08:17,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 372 transitions, 5432 flow [2025-04-14 01:08:17,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 372 transitions, 5248 flow, removed 92 selfloop flow, removed 0 redundant places. [2025-04-14 01:08:17,296 INFO L231 Difference]: Finished difference. Result has 154 places, 316 transitions, 4655 flow [2025-04-14 01:08:17,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3675, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4655, PETRI_PLACES=154, PETRI_TRANSITIONS=316} [2025-04-14 01:08:17,296 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 123 predicate places. [2025-04-14 01:08:17,296 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 316 transitions, 4655 flow [2025-04-14 01:08:17,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:17,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:17,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:17,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:08:17,297 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:17,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash 993625540, now seen corresponding path program 7 times [2025-04-14 01:08:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:17,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369916409] [2025-04-14 01:08:17,297 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:08:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:17,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:17,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:17,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:17,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:17,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:17,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369916409] [2025-04-14 01:08:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369916409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311633999] [2025-04-14 01:08:17,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:17,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:17,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:17,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:17,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:17,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 316 transitions, 4655 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:17,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:17,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:17,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:18,120 INFO L116 PetriNetUnfolderBase]: 2962/4416 cut-off events. [2025-04-14 01:08:18,120 INFO L117 PetriNetUnfolderBase]: For 34585/34585 co-relation queries the response was YES. [2025-04-14 01:08:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28624 conditions, 4416 events. 2962/4416 cut-off events. For 34585/34585 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 23063 event pairs, 441 based on Foata normal form. 1/3831 useless extension candidates. Maximal degree in co-relation 28546. Up to 4142 conditions per place. [2025-04-14 01:08:18,152 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 311 selfloop transitions, 64 changer transitions 1/376 dead transitions. [2025-04-14 01:08:18,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 376 transitions, 5948 flow [2025-04-14 01:08:18,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:08:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:08:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2025-04-14 01:08:18,153 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2025-04-14 01:08:18,153 INFO L175 Difference]: Start difference. First operand has 154 places, 316 transitions, 4655 flow. Second operand 11 states and 125 transitions. [2025-04-14 01:08:18,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 376 transitions, 5948 flow [2025-04-14 01:08:18,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 376 transitions, 5806 flow, removed 45 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:18,282 INFO L231 Difference]: Finished difference. Result has 167 places, 337 transitions, 5077 flow [2025-04-14 01:08:18,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4527, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5077, PETRI_PLACES=167, PETRI_TRANSITIONS=337} [2025-04-14 01:08:18,283 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2025-04-14 01:08:18,283 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 337 transitions, 5077 flow [2025-04-14 01:08:18,283 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:18,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:18,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:18,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:08:18,283 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:18,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1492530846, now seen corresponding path program 8 times [2025-04-14 01:08:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:18,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970072246] [2025-04-14 01:08:18,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:18,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:18,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:18,297 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:18,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:18,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:18,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970072246] [2025-04-14 01:08:18,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970072246] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:18,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:18,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:18,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054049371] [2025-04-14 01:08:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:18,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:18,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:18,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:18,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:18,457 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:18,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 337 transitions, 5077 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:18,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:18,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:18,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:19,101 INFO L116 PetriNetUnfolderBase]: 3003/4486 cut-off events. [2025-04-14 01:08:19,101 INFO L117 PetriNetUnfolderBase]: For 35213/35213 co-relation queries the response was YES. [2025-04-14 01:08:19,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29357 conditions, 4486 events. 3003/4486 cut-off events. For 35213/35213 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 23573 event pairs, 461 based on Foata normal form. 1/3885 useless extension candidates. Maximal degree in co-relation 29272. Up to 4276 conditions per place. [2025-04-14 01:08:19,136 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 319 selfloop transitions, 53 changer transitions 1/373 dead transitions. [2025-04-14 01:08:19,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 373 transitions, 6100 flow [2025-04-14 01:08:19,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-04-14 01:08:19,137 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-14 01:08:19,137 INFO L175 Difference]: Start difference. First operand has 167 places, 337 transitions, 5077 flow. Second operand 9 states and 102 transitions. [2025-04-14 01:08:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 373 transitions, 6100 flow [2025-04-14 01:08:19,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 373 transitions, 6004 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:19,283 INFO L231 Difference]: Finished difference. Result has 174 places, 344 transitions, 5205 flow [2025-04-14 01:08:19,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4982, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5205, PETRI_PLACES=174, PETRI_TRANSITIONS=344} [2025-04-14 01:08:19,284 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 143 predicate places. [2025-04-14 01:08:19,284 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 344 transitions, 5205 flow [2025-04-14 01:08:19,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:19,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:19,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:19,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:08:19,284 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:19,284 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:19,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1104855520, now seen corresponding path program 3 times [2025-04-14 01:08:19,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:19,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260027712] [2025-04-14 01:08:19,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:19,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:19,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:19,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:19,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:19,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:19,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260027712] [2025-04-14 01:08:19,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260027712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:19,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:19,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:19,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899482292] [2025-04-14 01:08:19,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:19,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:19,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:19,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:19,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:19,441 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:19,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 344 transitions, 5205 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:19,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:19,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:20,075 INFO L116 PetriNetUnfolderBase]: 3252/4844 cut-off events. [2025-04-14 01:08:20,075 INFO L117 PetriNetUnfolderBase]: For 40872/40872 co-relation queries the response was YES. [2025-04-14 01:08:20,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31891 conditions, 4844 events. 3252/4844 cut-off events. For 40872/40872 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 25784 event pairs, 487 based on Foata normal form. 1/4184 useless extension candidates. Maximal degree in co-relation 31804. Up to 4398 conditions per place. [2025-04-14 01:08:20,105 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 337 selfloop transitions, 67 changer transitions 1/405 dead transitions. [2025-04-14 01:08:20,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 405 transitions, 6590 flow [2025-04-14 01:08:20,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:08:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:08:20,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2025-04-14 01:08:20,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44140625 [2025-04-14 01:08:20,108 INFO L175 Difference]: Start difference. First operand has 174 places, 344 transitions, 5205 flow. Second operand 8 states and 113 transitions. [2025-04-14 01:08:20,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 405 transitions, 6590 flow [2025-04-14 01:08:20,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 405 transitions, 6477 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-04-14 01:08:20,240 INFO L231 Difference]: Finished difference. Result has 179 places, 363 transitions, 5519 flow [2025-04-14 01:08:20,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5092, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5519, PETRI_PLACES=179, PETRI_TRANSITIONS=363} [2025-04-14 01:08:20,241 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2025-04-14 01:08:20,241 INFO L485 AbstractCegarLoop]: Abstraction has has 179 places, 363 transitions, 5519 flow [2025-04-14 01:08:20,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:20,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:20,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:20,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:08:20,241 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:20,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash 501085222, now seen corresponding path program 9 times [2025-04-14 01:08:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:20,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872220686] [2025-04-14 01:08:20,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:20,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:20,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:20,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:20,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872220686] [2025-04-14 01:08:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872220686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:20,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057941094] [2025-04-14 01:08:20,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:20,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:20,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:20,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:20,418 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:20,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 363 transitions, 5519 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:20,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:20,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:20,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:21,060 INFO L116 PetriNetUnfolderBase]: 3270/4883 cut-off events. [2025-04-14 01:08:21,061 INFO L117 PetriNetUnfolderBase]: For 44191/44191 co-relation queries the response was YES. [2025-04-14 01:08:21,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33582 conditions, 4883 events. 3270/4883 cut-off events. For 44191/44191 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 26036 event pairs, 521 based on Foata normal form. 1/4219 useless extension candidates. Maximal degree in co-relation 33492. Up to 4644 conditions per place. [2025-04-14 01:08:21,095 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 339 selfloop transitions, 57 changer transitions 1/397 dead transitions. [2025-04-14 01:08:21,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 397 transitions, 6579 flow [2025-04-14 01:08:21,096 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2025-04-14 01:08:21,097 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3375 [2025-04-14 01:08:21,097 INFO L175 Difference]: Start difference. First operand has 179 places, 363 transitions, 5519 flow. Second operand 10 states and 108 transitions. [2025-04-14 01:08:21,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 397 transitions, 6579 flow [2025-04-14 01:08:21,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 397 transitions, 6481 flow, removed 48 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:21,273 INFO L231 Difference]: Finished difference. Result has 188 places, 367 transitions, 5627 flow [2025-04-14 01:08:21,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5421, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5627, PETRI_PLACES=188, PETRI_TRANSITIONS=367} [2025-04-14 01:08:21,274 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 157 predicate places. [2025-04-14 01:08:21,274 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 367 transitions, 5627 flow [2025-04-14 01:08:21,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:21,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:21,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:21,274 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 01:08:21,274 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:21,275 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1455662794, now seen corresponding path program 10 times [2025-04-14 01:08:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:21,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509143333] [2025-04-14 01:08:21,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:21,283 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:21,288 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:21,288 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:21,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509143333] [2025-04-14 01:08:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509143333] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243934788] [2025-04-14 01:08:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:21,441 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:21,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:21,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 367 transitions, 5627 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:21,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:21,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:21,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:22,248 INFO L116 PetriNetUnfolderBase]: 3308/4948 cut-off events. [2025-04-14 01:08:22,248 INFO L117 PetriNetUnfolderBase]: For 44662/44662 co-relation queries the response was YES. [2025-04-14 01:08:22,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33946 conditions, 4948 events. 3308/4948 cut-off events. For 44662/44662 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 26507 event pairs, 513 based on Foata normal form. 1/4268 useless extension candidates. Maximal degree in co-relation 33853. Up to 4738 conditions per place. [2025-04-14 01:08:22,290 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 347 selfloop transitions, 53 changer transitions 1/401 dead transitions. [2025-04-14 01:08:22,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 401 transitions, 6711 flow [2025-04-14 01:08:22,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:22,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-04-14 01:08:22,291 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-14 01:08:22,291 INFO L175 Difference]: Start difference. First operand has 188 places, 367 transitions, 5627 flow. Second operand 9 states and 102 transitions. [2025-04-14 01:08:22,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 401 transitions, 6711 flow [2025-04-14 01:08:22,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 401 transitions, 6587 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:22,453 INFO L231 Difference]: Finished difference. Result has 192 places, 372 transitions, 5726 flow [2025-04-14 01:08:22,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5503, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5726, PETRI_PLACES=192, PETRI_TRANSITIONS=372} [2025-04-14 01:08:22,454 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2025-04-14 01:08:22,454 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 372 transitions, 5726 flow [2025-04-14 01:08:22,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:22,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:22,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:22,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:08:22,454 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:22,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash 576081058, now seen corresponding path program 11 times [2025-04-14 01:08:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:22,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158579177] [2025-04-14 01:08:22,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:22,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:22,459 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:22,465 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:22,465 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:22,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:22,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158579177] [2025-04-14 01:08:22,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158579177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:22,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699092285] [2025-04-14 01:08:22,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:22,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:22,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:22,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:22,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:08:22,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:22,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:22,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:22,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:22,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:08:22,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:22,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:08:22,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:22,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:22,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699092285] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:22,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:22,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 19 [2025-04-14 01:08:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368684179] [2025-04-14 01:08:22,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:22,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:08:22,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:22,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:08:22,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-04-14 01:08:22,955 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:22,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 372 transitions, 5726 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:22,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:22,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:22,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:23,653 INFO L116 PetriNetUnfolderBase]: 3413/5114 cut-off events. [2025-04-14 01:08:23,653 INFO L117 PetriNetUnfolderBase]: For 46159/46159 co-relation queries the response was YES. [2025-04-14 01:08:23,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35068 conditions, 5114 events. 3413/5114 cut-off events. For 46159/46159 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 27693 event pairs, 506 based on Foata normal form. 1/4410 useless extension candidates. Maximal degree in co-relation 34972. Up to 4378 conditions per place. [2025-04-14 01:08:23,696 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 326 selfloop transitions, 121 changer transitions 1/448 dead transitions. [2025-04-14 01:08:23,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 448 transitions, 7339 flow [2025-04-14 01:08:23,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:23,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2025-04-14 01:08:23,697 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-04-14 01:08:23,697 INFO L175 Difference]: Start difference. First operand has 192 places, 372 transitions, 5726 flow. Second operand 10 states and 133 transitions. [2025-04-14 01:08:23,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 448 transitions, 7339 flow [2025-04-14 01:08:23,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 448 transitions, 7220 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:23,888 INFO L231 Difference]: Finished difference. Result has 199 places, 394 transitions, 6284 flow [2025-04-14 01:08:23,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5607, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6284, PETRI_PLACES=199, PETRI_TRANSITIONS=394} [2025-04-14 01:08:23,889 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2025-04-14 01:08:23,889 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 394 transitions, 6284 flow [2025-04-14 01:08:23,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:23,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:23,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:23,894 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-14 01:08:24,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:24,093 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:24,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:24,093 INFO L85 PathProgramCache]: Analyzing trace with hash 656265690, now seen corresponding path program 12 times [2025-04-14 01:08:24,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:24,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269928368] [2025-04-14 01:08:24,094 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:08:24,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:24,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:24,102 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:24,102 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:08:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:24,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:24,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:24,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269928368] [2025-04-14 01:08:24,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269928368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:24,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:24,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:24,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723727825] [2025-04-14 01:08:24,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:24,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:24,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:24,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:24,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:24,257 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:24,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 394 transitions, 6284 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:24,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:24,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:24,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:24,953 INFO L116 PetriNetUnfolderBase]: 3451/5179 cut-off events. [2025-04-14 01:08:24,953 INFO L117 PetriNetUnfolderBase]: For 50923/50923 co-relation queries the response was YES. [2025-04-14 01:08:24,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36628 conditions, 5179 events. 3451/5179 cut-off events. For 50923/50923 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 28204 event pairs, 556 based on Foata normal form. 1/4459 useless extension candidates. Maximal degree in co-relation 36527. Up to 4969 conditions per place. [2025-04-14 01:08:24,997 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 372 selfloop transitions, 55 changer transitions 1/428 dead transitions. [2025-04-14 01:08:24,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 428 transitions, 7426 flow [2025-04-14 01:08:24,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:24,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-04-14 01:08:24,998 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-14 01:08:24,998 INFO L175 Difference]: Start difference. First operand has 199 places, 394 transitions, 6284 flow. Second operand 9 states and 102 transitions. [2025-04-14 01:08:24,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 428 transitions, 7426 flow [2025-04-14 01:08:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 428 transitions, 7333 flow, removed 19 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:25,225 INFO L231 Difference]: Finished difference. Result has 207 places, 400 transitions, 6433 flow [2025-04-14 01:08:25,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6193, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6433, PETRI_PLACES=207, PETRI_TRANSITIONS=400} [2025-04-14 01:08:25,226 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 176 predicate places. [2025-04-14 01:08:25,226 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 400 transitions, 6433 flow [2025-04-14 01:08:25,226 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:25,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:25,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:25,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:08:25,226 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:25,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:25,227 INFO L85 PathProgramCache]: Analyzing trace with hash -14494998, now seen corresponding path program 13 times [2025-04-14 01:08:25,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:25,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245634947] [2025-04-14 01:08:25,227 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:08:25,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:25,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:25,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:25,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:25,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:25,386 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245634947] [2025-04-14 01:08:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245634947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:25,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:25,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:25,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589685548] [2025-04-14 01:08:25,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:25,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:25,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:25,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:25,386 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:25,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 400 transitions, 6433 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:25,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:25,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:25,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:26,198 INFO L116 PetriNetUnfolderBase]: 3668/5497 cut-off events. [2025-04-14 01:08:26,198 INFO L117 PetriNetUnfolderBase]: For 56103/56103 co-relation queries the response was YES. [2025-04-14 01:08:26,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39361 conditions, 5497 events. 3668/5497 cut-off events. For 56103/56103 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 30219 event pairs, 547 based on Foata normal form. 1/4715 useless extension candidates. Maximal degree in co-relation 39255. Up to 4516 conditions per place. [2025-04-14 01:08:26,248 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 346 selfloop transitions, 139 changer transitions 1/486 dead transitions. [2025-04-14 01:08:26,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 486 transitions, 8315 flow [2025-04-14 01:08:26,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:26,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-04-14 01:08:26,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.403125 [2025-04-14 01:08:26,249 INFO L175 Difference]: Start difference. First operand has 207 places, 400 transitions, 6433 flow. Second operand 10 states and 129 transitions. [2025-04-14 01:08:26,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 486 transitions, 8315 flow [2025-04-14 01:08:26,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 486 transitions, 8171 flow, removed 41 selfloop flow, removed 4 redundant places. [2025-04-14 01:08:26,477 INFO L231 Difference]: Finished difference. Result has 216 places, 426 transitions, 7099 flow [2025-04-14 01:08:26,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6293, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7099, PETRI_PLACES=216, PETRI_TRANSITIONS=426} [2025-04-14 01:08:26,478 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 185 predicate places. [2025-04-14 01:08:26,478 INFO L485 AbstractCegarLoop]: Abstraction has has 216 places, 426 transitions, 7099 flow [2025-04-14 01:08:26,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:26,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:26,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:26,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 01:08:26,478 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:26,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1879706006, now seen corresponding path program 14 times [2025-04-14 01:08:26,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:26,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23839598] [2025-04-14 01:08:26,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:26,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:26,495 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:26,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:26,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:26,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:26,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23839598] [2025-04-14 01:08:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23839598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229325050] [2025-04-14 01:08:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:26,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:26,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:26,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:26,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 426 transitions, 7099 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:26,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:26,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:26,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:27,600 INFO L116 PetriNetUnfolderBase]: 3879/5821 cut-off events. [2025-04-14 01:08:27,600 INFO L117 PetriNetUnfolderBase]: For 68833/68833 co-relation queries the response was YES. [2025-04-14 01:08:27,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43959 conditions, 5821 events. 3879/5821 cut-off events. For 68833/68833 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 32390 event pairs, 547 based on Foata normal form. 1/5005 useless extension candidates. Maximal degree in co-relation 43848. Up to 4492 conditions per place. [2025-04-14 01:08:27,664 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 340 selfloop transitions, 215 changer transitions 1/556 dead transitions. [2025-04-14 01:08:27,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 556 transitions, 9787 flow [2025-04-14 01:08:27,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:08:27,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:08:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 181 transitions. [2025-04-14 01:08:27,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3770833333333333 [2025-04-14 01:08:27,665 INFO L175 Difference]: Start difference. First operand has 216 places, 426 transitions, 7099 flow. Second operand 15 states and 181 transitions. [2025-04-14 01:08:27,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 556 transitions, 9787 flow [2025-04-14 01:08:27,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 556 transitions, 9548 flow, removed 85 selfloop flow, removed 5 redundant places. [2025-04-14 01:08:27,966 INFO L231 Difference]: Finished difference. Result has 229 places, 477 transitions, 8424 flow [2025-04-14 01:08:27,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6910, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=8424, PETRI_PLACES=229, PETRI_TRANSITIONS=477} [2025-04-14 01:08:27,967 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2025-04-14 01:08:27,967 INFO L485 AbstractCegarLoop]: Abstraction has has 229 places, 477 transitions, 8424 flow [2025-04-14 01:08:27,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:27,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:27,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:27,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 01:08:27,967 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:27,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash 693133742, now seen corresponding path program 15 times [2025-04-14 01:08:27,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:27,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595253844] [2025-04-14 01:08:27,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:27,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:27,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:27,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:27,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:28,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595253844] [2025-04-14 01:08:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595253844] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:28,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:28,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281356968] [2025-04-14 01:08:28,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:28,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:28,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:28,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:28,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:28,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:28,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 477 transitions, 8424 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:28,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:28,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:28,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:28,871 INFO L116 PetriNetUnfolderBase]: 3912/5879 cut-off events. [2025-04-14 01:08:28,871 INFO L117 PetriNetUnfolderBase]: For 75012/75012 co-relation queries the response was YES. [2025-04-14 01:08:28,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45544 conditions, 5879 events. 3912/5879 cut-off events. For 75012/75012 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 32883 event pairs, 635 based on Foata normal form. 1/5049 useless extension candidates. Maximal degree in co-relation 45428. Up to 5669 conditions per place. [2025-04-14 01:08:28,928 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 448 selfloop transitions, 57 changer transitions 1/506 dead transitions. [2025-04-14 01:08:28,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 506 transitions, 9653 flow [2025-04-14 01:08:28,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2025-04-14 01:08:28,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2025-04-14 01:08:28,929 INFO L175 Difference]: Start difference. First operand has 229 places, 477 transitions, 8424 flow. Second operand 9 states and 102 transitions. [2025-04-14 01:08:28,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 506 transitions, 9653 flow [2025-04-14 01:08:29,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 506 transitions, 9426 flow, removed 66 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:29,284 INFO L231 Difference]: Finished difference. Result has 232 places, 479 transitions, 8364 flow [2025-04-14 01:08:29,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8197, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8364, PETRI_PLACES=232, PETRI_TRANSITIONS=479} [2025-04-14 01:08:29,285 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 201 predicate places. [2025-04-14 01:08:29,285 INFO L485 AbstractCegarLoop]: Abstraction has has 232 places, 479 transitions, 8364 flow [2025-04-14 01:08:29,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:29,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:29,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:29,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 01:08:29,285 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:29,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:29,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1645085538, now seen corresponding path program 16 times [2025-04-14 01:08:29,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:29,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251706175] [2025-04-14 01:08:29,286 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:29,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:29,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:29,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:29,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:29,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:29,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:29,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251706175] [2025-04-14 01:08:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251706175] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697339811] [2025-04-14 01:08:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:29,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:29,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:29,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:29,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:29,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 479 transitions, 8364 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:29,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:29,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:29,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:30,395 INFO L116 PetriNetUnfolderBase]: 3930/5918 cut-off events. [2025-04-14 01:08:30,395 INFO L117 PetriNetUnfolderBase]: For 72552/72552 co-relation queries the response was YES. [2025-04-14 01:08:30,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45559 conditions, 5918 events. 3930/5918 cut-off events. For 72552/72552 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 33296 event pairs, 635 based on Foata normal form. 1/5084 useless extension candidates. Maximal degree in co-relation 45442. Up to 5679 conditions per place. [2025-04-14 01:08:30,446 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 449 selfloop transitions, 61 changer transitions 1/511 dead transitions. [2025-04-14 01:08:30,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 511 transitions, 9632 flow [2025-04-14 01:08:30,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2025-04-14 01:08:30,447 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3375 [2025-04-14 01:08:30,447 INFO L175 Difference]: Start difference. First operand has 232 places, 479 transitions, 8364 flow. Second operand 10 states and 108 transitions. [2025-04-14 01:08:30,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 511 transitions, 9632 flow [2025-04-14 01:08:30,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 511 transitions, 9490 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:30,745 INFO L231 Difference]: Finished difference. Result has 237 places, 483 transitions, 8435 flow [2025-04-14 01:08:30,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8222, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8435, PETRI_PLACES=237, PETRI_TRANSITIONS=483} [2025-04-14 01:08:30,746 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2025-04-14 01:08:30,746 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 483 transitions, 8435 flow [2025-04-14 01:08:30,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:30,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:30,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:30,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 01:08:30,746 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:30,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:30,746 INFO L85 PathProgramCache]: Analyzing trace with hash 829513382, now seen corresponding path program 17 times [2025-04-14 01:08:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:30,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365142997] [2025-04-14 01:08:30,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:30,750 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:30,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:30,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:30,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:30,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365142997] [2025-04-14 01:08:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365142997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:30,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789656283] [2025-04-14 01:08:30,954 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:30,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:30,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:30,955 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:30,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:08:30,995 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:31,010 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:31,010 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:31,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:31,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:08:31,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:31,024 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:08:31,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:31,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789656283] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 8] total 15 [2025-04-14 01:08:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908814734] [2025-04-14 01:08:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:31,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:08:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:31,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:08:31,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:08:31,209 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:31,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 483 transitions, 8435 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:31,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:31,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:31,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:32,251 INFO L116 PetriNetUnfolderBase]: 4067/6139 cut-off events. [2025-04-14 01:08:32,251 INFO L117 PetriNetUnfolderBase]: For 75138/75138 co-relation queries the response was YES. [2025-04-14 01:08:32,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47087 conditions, 6139 events. 4067/6139 cut-off events. For 75138/75138 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 34898 event pairs, 607 based on Foata normal form. 2/5268 useless extension candidates. Maximal degree in co-relation 46969. Up to 4897 conditions per place. [2025-04-14 01:08:32,312 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 334 selfloop transitions, 238 changer transitions 1/573 dead transitions. [2025-04-14 01:08:32,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 573 transitions, 10604 flow [2025-04-14 01:08:32,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:08:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:08:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2025-04-14 01:08:32,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39903846153846156 [2025-04-14 01:08:32,313 INFO L175 Difference]: Start difference. First operand has 237 places, 483 transitions, 8435 flow. Second operand 13 states and 166 transitions. [2025-04-14 01:08:32,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 573 transitions, 10604 flow [2025-04-14 01:08:32,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 573 transitions, 10449 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-04-14 01:08:32,677 INFO L231 Difference]: Finished difference. Result has 247 places, 521 transitions, 9726 flow [2025-04-14 01:08:32,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8284, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9726, PETRI_PLACES=247, PETRI_TRANSITIONS=521} [2025-04-14 01:08:32,677 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 216 predicate places. [2025-04-14 01:08:32,677 INFO L485 AbstractCegarLoop]: Abstraction has has 247 places, 521 transitions, 9726 flow [2025-04-14 01:08:32,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:32,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:32,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:32,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:08:32,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:32,878 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:32,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2009291046, now seen corresponding path program 18 times [2025-04-14 01:08:32,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:32,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662852998] [2025-04-14 01:08:32,879 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:08:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:32,883 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:32,886 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:32,886 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:08:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:33,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:33,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662852998] [2025-04-14 01:08:33,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662852998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:33,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:33,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:33,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848530668] [2025-04-14 01:08:33,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:33,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:33,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:33,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:33,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:33,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 521 transitions, 9726 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:33,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:33,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:33,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:34,062 INFO L116 PetriNetUnfolderBase]: 4085/6176 cut-off events. [2025-04-14 01:08:34,062 INFO L117 PetriNetUnfolderBase]: For 85300/85300 co-relation queries the response was YES. [2025-04-14 01:08:34,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49814 conditions, 6176 events. 4085/6176 cut-off events. For 85300/85300 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 35280 event pairs, 663 based on Foata normal form. 1/5298 useless extension candidates. Maximal degree in co-relation 49689. Up to 5945 conditions per place. [2025-04-14 01:08:34,114 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 468 selfloop transitions, 82 changer transitions 1/551 dead transitions. [2025-04-14 01:08:34,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 551 transitions, 11066 flow [2025-04-14 01:08:34,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2025-04-14 01:08:34,115 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2025-04-14 01:08:34,116 INFO L175 Difference]: Start difference. First operand has 247 places, 521 transitions, 9726 flow. Second operand 9 states and 106 transitions. [2025-04-14 01:08:34,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 551 transitions, 11066 flow [2025-04-14 01:08:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 551 transitions, 10844 flow, removed 75 selfloop flow, removed 4 redundant places. [2025-04-14 01:08:34,460 INFO L231 Difference]: Finished difference. Result has 253 places, 524 transitions, 9775 flow [2025-04-14 01:08:34,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9508, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9775, PETRI_PLACES=253, PETRI_TRANSITIONS=524} [2025-04-14 01:08:34,461 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2025-04-14 01:08:34,461 INFO L485 AbstractCegarLoop]: Abstraction has has 253 places, 524 transitions, 9775 flow [2025-04-14 01:08:34,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:34,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:34,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:34,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 01:08:34,461 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:34,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:34,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1570089702, now seen corresponding path program 19 times [2025-04-14 01:08:34,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:34,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061204322] [2025-04-14 01:08:34,462 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:08:34,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:34,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:34,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:34,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:34,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:34,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:34,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061204322] [2025-04-14 01:08:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061204322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:34,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:34,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755122505] [2025-04-14 01:08:34,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:34,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:34,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:34,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:34,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:34,624 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:34,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 524 transitions, 9775 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:34,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:34,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:35,668 INFO L116 PetriNetUnfolderBase]: 4103/6213 cut-off events. [2025-04-14 01:08:35,669 INFO L117 PetriNetUnfolderBase]: For 84894/84894 co-relation queries the response was YES. [2025-04-14 01:08:35,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50000 conditions, 6213 events. 4103/6213 cut-off events. For 84894/84894 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 35618 event pairs, 655 based on Foata normal form. 1/5329 useless extension candidates. Maximal degree in co-relation 49871. Up to 5964 conditions per place. [2025-04-14 01:08:35,729 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 493 selfloop transitions, 62 changer transitions 1/556 dead transitions. [2025-04-14 01:08:35,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 556 transitions, 11122 flow [2025-04-14 01:08:35,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-14 01:08:35,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:08:35,730 INFO L175 Difference]: Start difference. First operand has 253 places, 524 transitions, 9775 flow. Second operand 10 states and 110 transitions. [2025-04-14 01:08:35,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 556 transitions, 11122 flow [2025-04-14 01:08:36,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 556 transitions, 10920 flow, removed 38 selfloop flow, removed 5 redundant places. [2025-04-14 01:08:36,233 INFO L231 Difference]: Finished difference. Result has 258 places, 526 transitions, 9763 flow [2025-04-14 01:08:36,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9573, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9763, PETRI_PLACES=258, PETRI_TRANSITIONS=526} [2025-04-14 01:08:36,233 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2025-04-14 01:08:36,233 INFO L485 AbstractCegarLoop]: Abstraction has has 258 places, 526 transitions, 9763 flow [2025-04-14 01:08:36,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:36,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:36,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:36,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 01:08:36,234 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:36,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash -253932398, now seen corresponding path program 20 times [2025-04-14 01:08:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:36,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322253974] [2025-04-14 01:08:36,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:36,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:36,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:36,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:36,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:36,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322253974] [2025-04-14 01:08:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322253974] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:36,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:36,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095394117] [2025-04-14 01:08:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:36,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:36,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:36,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:36,466 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:36,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 526 transitions, 9763 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:37,769 INFO L116 PetriNetUnfolderBase]: 4121/6250 cut-off events. [2025-04-14 01:08:37,769 INFO L117 PetriNetUnfolderBase]: For 85138/85138 co-relation queries the response was YES. [2025-04-14 01:08:37,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50149 conditions, 6250 events. 4121/6250 cut-off events. For 85138/85138 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 35881 event pairs, 657 based on Foata normal form. 1/5360 useless extension candidates. Maximal degree in co-relation 50019. Up to 5980 conditions per place. [2025-04-14 01:08:37,839 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 471 selfloop transitions, 86 changer transitions 1/558 dead transitions. [2025-04-14 01:08:37,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 558 transitions, 11118 flow [2025-04-14 01:08:37,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:37,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-14 01:08:37,840 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-14 01:08:37,840 INFO L175 Difference]: Start difference. First operand has 258 places, 526 transitions, 9763 flow. Second operand 10 states and 114 transitions. [2025-04-14 01:08:37,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 558 transitions, 11118 flow [2025-04-14 01:08:38,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 558 transitions, 10976 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-04-14 01:08:38,252 INFO L231 Difference]: Finished difference. Result has 261 places, 528 transitions, 9863 flow [2025-04-14 01:08:38,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9625, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9863, PETRI_PLACES=261, PETRI_TRANSITIONS=528} [2025-04-14 01:08:38,252 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 230 predicate places. [2025-04-14 01:08:38,252 INFO L485 AbstractCegarLoop]: Abstraction has has 261 places, 528 transitions, 9863 flow [2025-04-14 01:08:38,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:38,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:38,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:38,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 01:08:38,253 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:38,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash -248580584, now seen corresponding path program 21 times [2025-04-14 01:08:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:38,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020644753] [2025-04-14 01:08:38,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:38,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:38,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:38,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:38,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:38,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:38,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020644753] [2025-04-14 01:08:38,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020644753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:38,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:38,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773033369] [2025-04-14 01:08:38,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:38,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:38,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:38,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:38,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:38,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 528 transitions, 9863 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:38,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:38,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:38,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:39,471 INFO L116 PetriNetUnfolderBase]: 4121/6249 cut-off events. [2025-04-14 01:08:39,471 INFO L117 PetriNetUnfolderBase]: For 84787/84787 co-relation queries the response was YES. [2025-04-14 01:08:39,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50108 conditions, 6249 events. 4121/6249 cut-off events. For 84787/84787 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 35880 event pairs, 655 based on Foata normal form. 1/5359 useless extension candidates. Maximal degree in co-relation 49978. Up to 5879 conditions per place. [2025-04-14 01:08:39,537 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 452 selfloop transitions, 111 changer transitions 1/564 dead transitions. [2025-04-14 01:08:39,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 564 transitions, 11249 flow [2025-04-14 01:08:39,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:08:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:08:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2025-04-14 01:08:39,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35511363636363635 [2025-04-14 01:08:39,538 INFO L175 Difference]: Start difference. First operand has 261 places, 528 transitions, 9863 flow. Second operand 11 states and 125 transitions. [2025-04-14 01:08:39,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 564 transitions, 11249 flow [2025-04-14 01:08:39,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 564 transitions, 11070 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:39,942 INFO L231 Difference]: Finished difference. Result has 267 places, 531 transitions, 10027 flow [2025-04-14 01:08:39,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9692, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10027, PETRI_PLACES=267, PETRI_TRANSITIONS=531} [2025-04-14 01:08:39,943 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2025-04-14 01:08:39,944 INFO L485 AbstractCegarLoop]: Abstraction has has 267 places, 531 transitions, 10027 flow [2025-04-14 01:08:39,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:39,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:39,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:39,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-14 01:08:39,944 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:39,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1100293680, now seen corresponding path program 22 times [2025-04-14 01:08:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:39,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788668280] [2025-04-14 01:08:39,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:39,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:39,951 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:39,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:39,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:40,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:40,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788668280] [2025-04-14 01:08:40,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788668280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:40,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:40,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:40,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475914490] [2025-04-14 01:08:40,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:40,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:40,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:40,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:40,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:40,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:40,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 531 transitions, 10027 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:40,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:40,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:40,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:41,281 INFO L116 PetriNetUnfolderBase]: 4370/6621 cut-off events. [2025-04-14 01:08:41,281 INFO L117 PetriNetUnfolderBase]: For 93235/93235 co-relation queries the response was YES. [2025-04-14 01:08:41,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53229 conditions, 6621 events. 4370/6621 cut-off events. For 93235/93235 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 38316 event pairs, 693 based on Foata normal form. 1/5667 useless extension candidates. Maximal degree in co-relation 53097. Up to 5543 conditions per place. [2025-04-14 01:08:41,350 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 456 selfloop transitions, 189 changer transitions 1/646 dead transitions. [2025-04-14 01:08:41,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 646 transitions, 13190 flow [2025-04-14 01:08:41,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:08:41,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:08:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2025-04-14 01:08:41,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2025-04-14 01:08:41,351 INFO L175 Difference]: Start difference. First operand has 267 places, 531 transitions, 10027 flow. Second operand 12 states and 143 transitions. [2025-04-14 01:08:41,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 646 transitions, 13190 flow [2025-04-14 01:08:41,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 646 transitions, 12965 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-04-14 01:08:41,775 INFO L231 Difference]: Finished difference. Result has 278 places, 590 transitions, 11944 flow [2025-04-14 01:08:41,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9820, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11944, PETRI_PLACES=278, PETRI_TRANSITIONS=590} [2025-04-14 01:08:41,776 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 247 predicate places. [2025-04-14 01:08:41,776 INFO L485 AbstractCegarLoop]: Abstraction has has 278 places, 590 transitions, 11944 flow [2025-04-14 01:08:41,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:41,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:41,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:41,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 01:08:41,776 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:41,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1546440512, now seen corresponding path program 23 times [2025-04-14 01:08:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:41,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376010433] [2025-04-14 01:08:41,777 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:41,780 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:41,783 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:41,783 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:41,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:41,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:41,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376010433] [2025-04-14 01:08:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376010433] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:41,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901388599] [2025-04-14 01:08:41,915 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:41,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:41,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:08:41,961 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:41,974 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:41,974 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:41,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:41,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:08:41,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:41,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:08:42,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:42,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:42,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901388599] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:42,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:42,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 18 [2025-04-14 01:08:42,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683742101] [2025-04-14 01:08:42,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:42,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:08:42,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:42,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:08:42,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-04-14 01:08:42,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:42,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 590 transitions, 11944 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:42,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:42,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:42,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:43,292 INFO L116 PetriNetUnfolderBase]: 4370/6620 cut-off events. [2025-04-14 01:08:43,292 INFO L117 PetriNetUnfolderBase]: For 107793/107793 co-relation queries the response was YES. [2025-04-14 01:08:43,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55162 conditions, 6620 events. 4370/6620 cut-off events. For 107793/107793 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 38184 event pairs, 729 based on Foata normal form. 1/5666 useless extension candidates. Maximal degree in co-relation 55023. Up to 5787 conditions per place. [2025-04-14 01:08:43,364 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 508 selfloop transitions, 143 changer transitions 1/652 dead transitions. [2025-04-14 01:08:43,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 652 transitions, 13876 flow [2025-04-14 01:08:43,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:43,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-04-14 01:08:43,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-04-14 01:08:43,365 INFO L175 Difference]: Start difference. First operand has 278 places, 590 transitions, 11944 flow. Second operand 9 states and 122 transitions. [2025-04-14 01:08:43,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 652 transitions, 13876 flow [2025-04-14 01:08:43,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 652 transitions, 13686 flow, removed 94 selfloop flow, removed 1 redundant places. [2025-04-14 01:08:43,890 INFO L231 Difference]: Finished difference. Result has 288 places, 598 transitions, 12229 flow [2025-04-14 01:08:43,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11760, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12229, PETRI_PLACES=288, PETRI_TRANSITIONS=598} [2025-04-14 01:08:43,891 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2025-04-14 01:08:43,891 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 598 transitions, 12229 flow [2025-04-14 01:08:43,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:43,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:43,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:43,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:08:44,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:44,091 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:44,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1789743918, now seen corresponding path program 24 times [2025-04-14 01:08:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:44,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678278444] [2025-04-14 01:08:44,092 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:08:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:44,096 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:44,099 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:44,099 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:08:44,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:44,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:44,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678278444] [2025-04-14 01:08:44,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678278444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:44,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:44,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508181038] [2025-04-14 01:08:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:44,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:44,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:44,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:44,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:44,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:44,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 598 transitions, 12229 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:44,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:44,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:44,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:45,303 INFO L116 PetriNetUnfolderBase]: 4370/6619 cut-off events. [2025-04-14 01:08:45,303 INFO L117 PetriNetUnfolderBase]: For 111882/111882 co-relation queries the response was YES. [2025-04-14 01:08:45,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55562 conditions, 6619 events. 4370/6619 cut-off events. For 111882/111882 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 38181 event pairs, 768 based on Foata normal form. 1/5665 useless extension candidates. Maximal degree in co-relation 55417. Up to 6409 conditions per place. [2025-04-14 01:08:45,369 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 567 selfloop transitions, 58 changer transitions 1/626 dead transitions. [2025-04-14 01:08:45,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 626 transitions, 13712 flow [2025-04-14 01:08:45,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-04-14 01:08:45,370 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2025-04-14 01:08:45,370 INFO L175 Difference]: Start difference. First operand has 288 places, 598 transitions, 12229 flow. Second operand 9 states and 98 transitions. [2025-04-14 01:08:45,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 626 transitions, 13712 flow [2025-04-14 01:08:45,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 626 transitions, 13535 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-04-14 01:08:45,884 INFO L231 Difference]: Finished difference. Result has 294 places, 603 transitions, 12289 flow [2025-04-14 01:08:45,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12056, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12289, PETRI_PLACES=294, PETRI_TRANSITIONS=603} [2025-04-14 01:08:45,884 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 263 predicate places. [2025-04-14 01:08:45,884 INFO L485 AbstractCegarLoop]: Abstraction has has 294 places, 603 transitions, 12289 flow [2025-04-14 01:08:45,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:45,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:45,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:45,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 01:08:45,885 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:45,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash -511607310, now seen corresponding path program 25 times [2025-04-14 01:08:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:45,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727790348] [2025-04-14 01:08:45,885 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:08:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:45,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:08:45,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:45,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:08:45,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:46,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:46,032 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727790348] [2025-04-14 01:08:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727790348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:46,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:46,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:46,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556622650] [2025-04-14 01:08:46,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:46,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:46,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:46,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:46,033 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:46,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 603 transitions, 12289 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:46,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:46,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:46,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:47,109 INFO L116 PetriNetUnfolderBase]: 4370/6618 cut-off events. [2025-04-14 01:08:47,109 INFO L117 PetriNetUnfolderBase]: For 108453/108453 co-relation queries the response was YES. [2025-04-14 01:08:47,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55408 conditions, 6618 events. 4370/6618 cut-off events. For 108453/108453 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 38104 event pairs, 750 based on Foata normal form. 1/5664 useless extension candidates. Maximal degree in co-relation 55259. Up to 6379 conditions per place. [2025-04-14 01:08:47,172 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 568 selfloop transitions, 62 changer transitions 1/631 dead transitions. [2025-04-14 01:08:47,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 631 transitions, 13767 flow [2025-04-14 01:08:47,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-14 01:08:47,173 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.325 [2025-04-14 01:08:47,173 INFO L175 Difference]: Start difference. First operand has 294 places, 603 transitions, 12289 flow. Second operand 10 states and 104 transitions. [2025-04-14 01:08:47,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 631 transitions, 13767 flow [2025-04-14 01:08:47,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 631 transitions, 13617 flow, removed 28 selfloop flow, removed 5 redundant places. [2025-04-14 01:08:47,675 INFO L231 Difference]: Finished difference. Result has 300 places, 607 transitions, 12368 flow [2025-04-14 01:08:47,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12143, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12368, PETRI_PLACES=300, PETRI_TRANSITIONS=607} [2025-04-14 01:08:47,675 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 269 predicate places. [2025-04-14 01:08:47,675 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 607 transitions, 12368 flow [2025-04-14 01:08:47,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:47,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:47,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:47,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 01:08:47,676 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:47,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 719284314, now seen corresponding path program 26 times [2025-04-14 01:08:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:47,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247279000] [2025-04-14 01:08:47,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:08:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:47,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:47,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:47,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:08:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:47,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:47,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247279000] [2025-04-14 01:08:47,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247279000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:47,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:47,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:47,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654214662] [2025-04-14 01:08:47,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:47,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:47,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:47,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:47,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:47,793 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:47,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 607 transitions, 12368 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:47,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:47,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:47,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:48,890 INFO L116 PetriNetUnfolderBase]: 4414/6693 cut-off events. [2025-04-14 01:08:48,890 INFO L117 PetriNetUnfolderBase]: For 109607/109607 co-relation queries the response was YES. [2025-04-14 01:08:48,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55978 conditions, 6693 events. 4414/6693 cut-off events. For 109607/109607 co-relation queries the response was YES. Maximal size of possible extension queue 523. Compared 38832 event pairs, 766 based on Foata normal form. 1/5723 useless extension candidates. Maximal degree in co-relation 55827. Up to 6479 conditions per place. [2025-04-14 01:08:48,961 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 574 selfloop transitions, 62 changer transitions 1/637 dead transitions. [2025-04-14 01:08:48,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 637 transitions, 13992 flow [2025-04-14 01:08:48,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2025-04-14 01:08:48,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-14 01:08:48,962 INFO L175 Difference]: Start difference. First operand has 300 places, 607 transitions, 12368 flow. Second operand 9 states and 96 transitions. [2025-04-14 01:08:48,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 637 transitions, 13992 flow [2025-04-14 01:08:49,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 637 transitions, 13828 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-04-14 01:08:49,524 INFO L231 Difference]: Finished difference. Result has 304 places, 616 transitions, 12588 flow [2025-04-14 01:08:49,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12212, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12588, PETRI_PLACES=304, PETRI_TRANSITIONS=616} [2025-04-14 01:08:49,526 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 273 predicate places. [2025-04-14 01:08:49,526 INFO L485 AbstractCegarLoop]: Abstraction has has 304 places, 616 transitions, 12588 flow [2025-04-14 01:08:49,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:49,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:49,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:49,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 01:08:49,526 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:49,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:49,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1373651204, now seen corresponding path program 4 times [2025-04-14 01:08:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:49,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162273581] [2025-04-14 01:08:49,527 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:49,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:49,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:49,533 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:49,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:49,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:49,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162273581] [2025-04-14 01:08:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162273581] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:49,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:08:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967545493] [2025-04-14 01:08:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:49,649 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:08:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:49,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:08:49,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:08:49,650 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:49,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 616 transitions, 12588 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:49,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:49,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:49,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:50,870 INFO L116 PetriNetUnfolderBase]: 4724/7130 cut-off events. [2025-04-14 01:08:50,871 INFO L117 PetriNetUnfolderBase]: For 118708/118708 co-relation queries the response was YES. [2025-04-14 01:08:50,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59838 conditions, 7130 events. 4724/7130 cut-off events. For 118708/118708 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 41519 event pairs, 632 based on Foata normal form. 1/6083 useless extension candidates. Maximal degree in co-relation 59684. Up to 6614 conditions per place. [2025-04-14 01:08:50,943 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 594 selfloop transitions, 75 changer transitions 1/670 dead transitions. [2025-04-14 01:08:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 670 transitions, 14539 flow [2025-04-14 01:08:50,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:08:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:08:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2025-04-14 01:08:50,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2025-04-14 01:08:50,944 INFO L175 Difference]: Start difference. First operand has 304 places, 616 transitions, 12588 flow. Second operand 9 states and 118 transitions. [2025-04-14 01:08:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 670 transitions, 14539 flow [2025-04-14 01:08:51,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 670 transitions, 14421 flow, removed 40 selfloop flow, removed 2 redundant places. [2025-04-14 01:08:51,507 INFO L231 Difference]: Finished difference. Result has 313 places, 633 transitions, 12991 flow [2025-04-14 01:08:51,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12470, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12991, PETRI_PLACES=313, PETRI_TRANSITIONS=633} [2025-04-14 01:08:51,508 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 282 predicate places. [2025-04-14 01:08:51,508 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 633 transitions, 12991 flow [2025-04-14 01:08:51,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:08:51,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:51,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:51,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-14 01:08:51,508 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:51,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1923648992, now seen corresponding path program 5 times [2025-04-14 01:08:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:51,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787807994] [2025-04-14 01:08:51,508 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:51,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:51,519 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:51,519 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:51,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:51,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787807994] [2025-04-14 01:08:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787807994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:51,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546533620] [2025-04-14 01:08:51,634 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:51,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:51,635 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:51,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:08:51,674 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:51,686 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:51,686 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:51,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:51,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 01:08:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:51,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:51,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:08:51,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546533620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:51,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:08:51,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-04-14 01:08:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193518589] [2025-04-14 01:08:51,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:51,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:08:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:51,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:08:51,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:08:51,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:51,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 633 transitions, 12991 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:08:51,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:51,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:51,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:52,985 INFO L116 PetriNetUnfolderBase]: 4924/7440 cut-off events. [2025-04-14 01:08:52,985 INFO L117 PetriNetUnfolderBase]: For 133651/133651 co-relation queries the response was YES. [2025-04-14 01:08:53,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63951 conditions, 7440 events. 4924/7440 cut-off events. For 133651/133651 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 43691 event pairs, 686 based on Foata normal form. 1/6377 useless extension candidates. Maximal degree in co-relation 63793. Up to 6660 conditions per place. [2025-04-14 01:08:53,069 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 593 selfloop transitions, 83 changer transitions 1/677 dead transitions. [2025-04-14 01:08:53,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 677 transitions, 14874 flow [2025-04-14 01:08:53,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:08:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:08:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2025-04-14 01:08:53,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2025-04-14 01:08:53,070 INFO L175 Difference]: Start difference. First operand has 313 places, 633 transitions, 12991 flow. Second operand 7 states and 106 transitions. [2025-04-14 01:08:53,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 677 transitions, 14874 flow [2025-04-14 01:08:53,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 677 transitions, 14567 flow, removed 123 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:53,742 INFO L231 Difference]: Finished difference. Result has 318 places, 645 transitions, 13171 flow [2025-04-14 01:08:53,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12684, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=13171, PETRI_PLACES=318, PETRI_TRANSITIONS=645} [2025-04-14 01:08:53,743 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 287 predicate places. [2025-04-14 01:08:53,743 INFO L485 AbstractCegarLoop]: Abstraction has has 318 places, 645 transitions, 13171 flow [2025-04-14 01:08:53,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:08:53,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:53,743 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:53,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:08:53,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:53,944 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:53,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:53,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1501797476, now seen corresponding path program 27 times [2025-04-14 01:08:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:53,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984775536] [2025-04-14 01:08:53,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:08:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:53,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:53,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:08:53,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:08:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:54,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:54,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984775536] [2025-04-14 01:08:54,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984775536] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:54,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:54,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:54,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947220346] [2025-04-14 01:08:54,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:54,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:54,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:54,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:54,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:54,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:54,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 645 transitions, 13171 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:54,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:54,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:54,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:55,381 INFO L116 PetriNetUnfolderBase]: 4942/7479 cut-off events. [2025-04-14 01:08:55,381 INFO L117 PetriNetUnfolderBase]: For 132904/132904 co-relation queries the response was YES. [2025-04-14 01:08:55,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63966 conditions, 7479 events. 4942/7479 cut-off events. For 132904/132904 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 43985 event pairs, 872 based on Foata normal form. 1/6412 useless extension candidates. Maximal degree in co-relation 63806. Up to 7236 conditions per place. [2025-04-14 01:08:55,469 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 604 selfloop transitions, 66 changer transitions 1/671 dead transitions. [2025-04-14 01:08:55,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 671 transitions, 14769 flow [2025-04-14 01:08:55,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:08:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:08:55,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-04-14 01:08:55,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-14 01:08:55,469 INFO L175 Difference]: Start difference. First operand has 318 places, 645 transitions, 13171 flow. Second operand 10 states and 102 transitions. [2025-04-14 01:08:55,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 671 transitions, 14769 flow [2025-04-14 01:08:56,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 671 transitions, 14495 flow, removed 105 selfloop flow, removed 3 redundant places. [2025-04-14 01:08:56,166 INFO L231 Difference]: Finished difference. Result has 325 places, 649 transitions, 13173 flow [2025-04-14 01:08:56,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12905, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13173, PETRI_PLACES=325, PETRI_TRANSITIONS=649} [2025-04-14 01:08:56,166 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 294 predicate places. [2025-04-14 01:08:56,166 INFO L485 AbstractCegarLoop]: Abstraction has has 325 places, 649 transitions, 13173 flow [2025-04-14 01:08:56,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:56,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:56,167 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:56,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-14 01:08:56,167 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:56,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:56,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2146180262, now seen corresponding path program 28 times [2025-04-14 01:08:56,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:56,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688272648] [2025-04-14 01:08:56,167 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:08:56,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:56,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:56,173 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:56,173 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:08:56,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:56,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:56,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688272648] [2025-04-14 01:08:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688272648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:08:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:08:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:08:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711617755] [2025-04-14 01:08:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:56,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:08:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:08:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:08:56,299 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:56,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 649 transitions, 13173 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:56,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:56,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:56,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:08:57,581 INFO L116 PetriNetUnfolderBase]: 4993/7567 cut-off events. [2025-04-14 01:08:57,581 INFO L117 PetriNetUnfolderBase]: For 124581/124581 co-relation queries the response was YES. [2025-04-14 01:08:57,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63173 conditions, 7567 events. 4993/7567 cut-off events. For 124581/124581 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 44700 event pairs, 885 based on Foata normal form. 1/6482 useless extension candidates. Maximal degree in co-relation 63011. Up to 7303 conditions per place. [2025-04-14 01:08:57,679 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 600 selfloop transitions, 83 changer transitions 1/684 dead transitions. [2025-04-14 01:08:57,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 684 transitions, 14927 flow [2025-04-14 01:08:57,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:08:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:08:57,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2025-04-14 01:08:57,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2025-04-14 01:08:57,680 INFO L175 Difference]: Start difference. First operand has 325 places, 649 transitions, 13173 flow. Second operand 11 states and 111 transitions. [2025-04-14 01:08:57,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 684 transitions, 14927 flow [2025-04-14 01:08:58,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 684 transitions, 14744 flow, removed 56 selfloop flow, removed 6 redundant places. [2025-04-14 01:08:58,401 INFO L231 Difference]: Finished difference. Result has 332 places, 661 transitions, 13456 flow [2025-04-14 01:08:58,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12996, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13456, PETRI_PLACES=332, PETRI_TRANSITIONS=661} [2025-04-14 01:08:58,402 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 301 predicate places. [2025-04-14 01:08:58,402 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 661 transitions, 13456 flow [2025-04-14 01:08:58,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:08:58,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:08:58,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:08:58,402 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-14 01:08:58,402 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:08:58,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:08:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash 756152366, now seen corresponding path program 29 times [2025-04-14 01:08:58,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:08:58,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629825803] [2025-04-14 01:08:58,402 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:08:58,406 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:58,410 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:58,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:58,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:58,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:08:58,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629825803] [2025-04-14 01:08:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629825803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:58,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146577365] [2025-04-14 01:08:58,591 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:08:58,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:08:58,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:08:58,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:08:58,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:08:58,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:08:58,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:08:58,646 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:08:58,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:08:58,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:08:58,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:08:58,661 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:08:58,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:08:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:08:58,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:08:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:08:58,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146577365] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:08:58,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:08:58,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:08:58,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307504063] [2025-04-14 01:08:58,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:08:58,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:08:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:08:58,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:08:58,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:08:58,831 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:08:58,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 661 transitions, 13456 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:08:58,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:08:58,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:08:58,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:00,199 INFO L116 PetriNetUnfolderBase]: 5037/7644 cut-off events. [2025-04-14 01:09:00,199 INFO L117 PetriNetUnfolderBase]: For 127760/127760 co-relation queries the response was YES. [2025-04-14 01:09:00,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64916 conditions, 7644 events. 5037/7644 cut-off events. For 127760/127760 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 45357 event pairs, 888 based on Foata normal form. 1/6543 useless extension candidates. Maximal degree in co-relation 64750. Up to 6858 conditions per place. [2025-04-14 01:09:00,299 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 570 selfloop transitions, 139 changer transitions 1/710 dead transitions. [2025-04-14 01:09:00,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 710 transitions, 15373 flow [2025-04-14 01:09:00,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:09:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:09:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2025-04-14 01:09:00,300 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2025-04-14 01:09:00,300 INFO L175 Difference]: Start difference. First operand has 332 places, 661 transitions, 13456 flow. Second operand 9 states and 113 transitions. [2025-04-14 01:09:00,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 710 transitions, 15373 flow [2025-04-14 01:09:01,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 710 transitions, 15125 flow, removed 100 selfloop flow, removed 3 redundant places. [2025-04-14 01:09:01,029 INFO L231 Difference]: Finished difference. Result has 339 places, 666 transitions, 13615 flow [2025-04-14 01:09:01,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13208, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=13615, PETRI_PLACES=339, PETRI_TRANSITIONS=666} [2025-04-14 01:09:01,030 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 308 predicate places. [2025-04-14 01:09:01,030 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 666 transitions, 13615 flow [2025-04-14 01:09:01,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:01,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:01,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:01,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:09:01,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-14 01:09:01,231 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:01,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:01,231 INFO L85 PathProgramCache]: Analyzing trace with hash -856407644, now seen corresponding path program 6 times [2025-04-14 01:09:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:01,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527297638] [2025-04-14 01:09:01,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:09:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:01,235 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:01,237 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:01,237 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:09:01,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:01,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527297638] [2025-04-14 01:09:01,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527297638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:01,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:01,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:09:01,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310058779] [2025-04-14 01:09:01,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:01,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:09:01,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:01,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:09:01,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:09:01,336 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:01,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 666 transitions, 13615 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:01,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:01,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:01,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:02,704 INFO L116 PetriNetUnfolderBase]: 5229/7921 cut-off events. [2025-04-14 01:09:02,705 INFO L117 PetriNetUnfolderBase]: For 139647/139647 co-relation queries the response was YES. [2025-04-14 01:09:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67632 conditions, 7921 events. 5229/7921 cut-off events. For 139647/139647 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 47281 event pairs, 938 based on Foata normal form. 1/6769 useless extension candidates. Maximal degree in co-relation 67462. Up to 7471 conditions per place. [2025-04-14 01:09:02,839 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 642 selfloop transitions, 76 changer transitions 1/719 dead transitions. [2025-04-14 01:09:02,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 719 transitions, 15645 flow [2025-04-14 01:09:02,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:09:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:09:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-04-14 01:09:02,841 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43359375 [2025-04-14 01:09:02,841 INFO L175 Difference]: Start difference. First operand has 339 places, 666 transitions, 13615 flow. Second operand 8 states and 111 transitions. [2025-04-14 01:09:02,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 719 transitions, 15645 flow [2025-04-14 01:09:03,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 719 transitions, 15474 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-14 01:09:03,765 INFO L231 Difference]: Finished difference. Result has 344 places, 683 transitions, 13977 flow [2025-04-14 01:09:03,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13444, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=13977, PETRI_PLACES=344, PETRI_TRANSITIONS=683} [2025-04-14 01:09:03,766 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 313 predicate places. [2025-04-14 01:09:03,766 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 683 transitions, 13977 flow [2025-04-14 01:09:03,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:03,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:03,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:03,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-14 01:09:03,766 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:03,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:03,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1637240028, now seen corresponding path program 7 times [2025-04-14 01:09:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:03,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831105955] [2025-04-14 01:09:03,767 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:03,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:03,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:03,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:03,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:03,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:03,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:03,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831105955] [2025-04-14 01:09:03,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831105955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:03,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420162399] [2025-04-14 01:09:03,903 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:03,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:03,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:03,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:09:03,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:09:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:03,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:03,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:03,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:03,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-14 01:09:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:04,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:09:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:04,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:09:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420162399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:09:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2025-04-14 01:09:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729544644] [2025-04-14 01:09:04,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:04,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:09:04,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:04,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:09:04,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:09:04,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:04,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 683 transitions, 13977 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:09:04,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:04,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:04,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:05,627 INFO L116 PetriNetUnfolderBase]: 5421/8198 cut-off events. [2025-04-14 01:09:05,628 INFO L117 PetriNetUnfolderBase]: For 149725/149725 co-relation queries the response was YES. [2025-04-14 01:09:05,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71021 conditions, 8198 events. 5421/8198 cut-off events. For 149725/149725 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 48892 event pairs, 955 based on Foata normal form. 1/6995 useless extension candidates. Maximal degree in co-relation 70845. Up to 7666 conditions per place. [2025-04-14 01:09:05,728 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 643 selfloop transitions, 80 changer transitions 1/724 dead transitions. [2025-04-14 01:09:05,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 724 transitions, 15839 flow [2025-04-14 01:09:05,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:09:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:09:05,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2025-04-14 01:09:05,729 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-04-14 01:09:05,729 INFO L175 Difference]: Start difference. First operand has 344 places, 683 transitions, 13977 flow. Second operand 7 states and 104 transitions. [2025-04-14 01:09:05,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 724 transitions, 15839 flow [2025-04-14 01:09:06,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 724 transitions, 15765 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-04-14 01:09:06,487 INFO L231 Difference]: Finished difference. Result has 350 places, 686 transitions, 14174 flow [2025-04-14 01:09:06,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13903, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=14174, PETRI_PLACES=350, PETRI_TRANSITIONS=686} [2025-04-14 01:09:06,488 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 319 predicate places. [2025-04-14 01:09:06,488 INFO L485 AbstractCegarLoop]: Abstraction has has 350 places, 686 transitions, 14174 flow [2025-04-14 01:09:06,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 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-14 01:09:06,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:06,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:06,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 01:09:06,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-14 01:09:06,688 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:06,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1387499806, now seen corresponding path program 30 times [2025-04-14 01:09:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:06,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687549947] [2025-04-14 01:09:06,689 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:09:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:06,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:06,697 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:06,697 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:09:06,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:06,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:06,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687549947] [2025-04-14 01:09:06,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687549947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:06,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:06,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:09:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341715299] [2025-04-14 01:09:06,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:06,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:09:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:06,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:09:06,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:09:06,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:06,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 686 transitions, 14174 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:06,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:06,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:06,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:08,432 INFO L116 PetriNetUnfolderBase]: 5459/8263 cut-off events. [2025-04-14 01:09:08,432 INFO L117 PetriNetUnfolderBase]: For 156498/156498 co-relation queries the response was YES. [2025-04-14 01:09:08,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71829 conditions, 8263 events. 5459/8263 cut-off events. For 156498/156498 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 49497 event pairs, 1051 based on Foata normal form. 1/7044 useless extension candidates. Maximal degree in co-relation 71651. Up to 8049 conditions per place. [2025-04-14 01:09:08,536 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 643 selfloop transitions, 68 changer transitions 1/712 dead transitions. [2025-04-14 01:09:08,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 712 transitions, 15896 flow [2025-04-14 01:09:08,536 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:09:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:09:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-04-14 01:09:08,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3298611111111111 [2025-04-14 01:09:08,537 INFO L175 Difference]: Start difference. First operand has 350 places, 686 transitions, 14174 flow. Second operand 9 states and 95 transitions. [2025-04-14 01:09:08,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 712 transitions, 15896 flow [2025-04-14 01:09:09,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 712 transitions, 15646 flow, removed 56 selfloop flow, removed 4 redundant places. [2025-04-14 01:09:09,263 INFO L231 Difference]: Finished difference. Result has 356 places, 691 transitions, 14217 flow [2025-04-14 01:09:09,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13928, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14217, PETRI_PLACES=356, PETRI_TRANSITIONS=691} [2025-04-14 01:09:09,263 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 325 predicate places. [2025-04-14 01:09:09,263 INFO L485 AbstractCegarLoop]: Abstraction has has 356 places, 691 transitions, 14217 flow [2025-04-14 01:09:09,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:09,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:09,264 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:09,264 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-14 01:09:09,264 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:09,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:09,264 INFO L85 PathProgramCache]: Analyzing trace with hash 34706734, now seen corresponding path program 31 times [2025-04-14 01:09:09,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:09,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389461347] [2025-04-14 01:09:09,264 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:09,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:09,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:09,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:09,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:09,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:09,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:09,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389461347] [2025-04-14 01:09:09,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389461347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:09,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258737083] [2025-04-14 01:09:09,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:09,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:09,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:09,434 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:09:09,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:09:09,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:09,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:09,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:09,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:09,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:09:09,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:09,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:09:09,584 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:09:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:09,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:09,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258737083] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:09,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:09:09,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:09:09,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640347092] [2025-04-14 01:09:09,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:09,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:09:09,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:09,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:09:09,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:09:09,684 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:09,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 691 transitions, 14217 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:09,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:09,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:09,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:11,676 INFO L116 PetriNetUnfolderBase]: 5822/8801 cut-off events. [2025-04-14 01:09:11,677 INFO L117 PetriNetUnfolderBase]: For 166270/166270 co-relation queries the response was YES. [2025-04-14 01:09:11,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76291 conditions, 8801 events. 5822/8801 cut-off events. For 166270/166270 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 53246 event pairs, 957 based on Foata normal form. 1/7500 useless extension candidates. Maximal degree in co-relation 76111. Up to 7510 conditions per place. [2025-04-14 01:09:11,771 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 563 selfloop transitions, 240 changer transitions 1/804 dead transitions. [2025-04-14 01:09:11,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 804 transitions, 17621 flow [2025-04-14 01:09:11,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:09:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:09:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2025-04-14 01:09:11,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3880208333333333 [2025-04-14 01:09:11,773 INFO L175 Difference]: Start difference. First operand has 356 places, 691 transitions, 14217 flow. Second operand 12 states and 149 transitions. [2025-04-14 01:09:11,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 804 transitions, 17621 flow [2025-04-14 01:09:12,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 804 transitions, 17486 flow, removed 62 selfloop flow, removed 2 redundant places. [2025-04-14 01:09:12,609 INFO L231 Difference]: Finished difference. Result has 370 places, 755 transitions, 16206 flow [2025-04-14 01:09:12,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14082, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16206, PETRI_PLACES=370, PETRI_TRANSITIONS=755} [2025-04-14 01:09:12,610 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 339 predicate places. [2025-04-14 01:09:12,610 INFO L485 AbstractCegarLoop]: Abstraction has has 370 places, 755 transitions, 16206 flow [2025-04-14 01:09:12,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:12,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:12,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:12,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:09:12,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-14 01:09:12,811 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:12,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1943494130, now seen corresponding path program 32 times [2025-04-14 01:09:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:12,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144645383] [2025-04-14 01:09:12,812 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:09:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:12,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:12,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:12,820 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:09:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:12,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:12,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:12,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144645383] [2025-04-14 01:09:12,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144645383] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:12,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:09:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795502249] [2025-04-14 01:09:12,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:12,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:09:12,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:12,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:09:12,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:09:12,970 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:12,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 755 transitions, 16206 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:12,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:12,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:12,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:15,188 INFO L116 PetriNetUnfolderBase]: 6292/9485 cut-off events. [2025-04-14 01:09:15,188 INFO L117 PetriNetUnfolderBase]: For 198429/198429 co-relation queries the response was YES. [2025-04-14 01:09:15,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86277 conditions, 9485 events. 6292/9485 cut-off events. For 198429/198429 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 57907 event pairs, 998 based on Foata normal form. 1/8092 useless extension candidates. Maximal degree in co-relation 86090. Up to 8591 conditions per place. [2025-04-14 01:09:15,303 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 640 selfloop transitions, 304 changer transitions 1/945 dead transitions. [2025-04-14 01:09:15,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 945 transitions, 21880 flow [2025-04-14 01:09:15,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-14 01:09:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-14 01:09:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 210 transitions. [2025-04-14 01:09:15,304 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-14 01:09:15,304 INFO L175 Difference]: Start difference. First operand has 370 places, 755 transitions, 16206 flow. Second operand 20 states and 210 transitions. [2025-04-14 01:09:15,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 945 transitions, 21880 flow [2025-04-14 01:09:16,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 945 transitions, 21186 flow, removed 326 selfloop flow, removed 1 redundant places. [2025-04-14 01:09:16,548 INFO L231 Difference]: Finished difference. Result has 395 places, 891 transitions, 19875 flow [2025-04-14 01:09:16,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15890, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=755, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19875, PETRI_PLACES=395, PETRI_TRANSITIONS=891} [2025-04-14 01:09:16,548 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 364 predicate places. [2025-04-14 01:09:16,549 INFO L485 AbstractCegarLoop]: Abstraction has has 395 places, 891 transitions, 19875 flow [2025-04-14 01:09:16,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:16,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:16,549 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:16,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-14 01:09:16,549 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:16,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:16,549 INFO L85 PathProgramCache]: Analyzing trace with hash -296347202, now seen corresponding path program 33 times [2025-04-14 01:09:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:16,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202428326] [2025-04-14 01:09:16,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:09:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:16,554 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:16,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:16,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:09:16,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:16,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202428326] [2025-04-14 01:09:16,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202428326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:16,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:16,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:09:16,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684741775] [2025-04-14 01:09:16,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:16,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:09:16,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:16,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:09:16,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:09:16,707 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:16,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 891 transitions, 19875 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:16,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:16,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:19,011 INFO L116 PetriNetUnfolderBase]: 6343/9569 cut-off events. [2025-04-14 01:09:19,012 INFO L117 PetriNetUnfolderBase]: For 201385/201385 co-relation queries the response was YES. [2025-04-14 01:09:19,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89259 conditions, 9569 events. 6343/9569 cut-off events. For 201385/201385 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 58528 event pairs, 1088 based on Foata normal form. 1/8158 useless extension candidates. Maximal degree in co-relation 89062. Up to 9319 conditions per place. [2025-04-14 01:09:19,153 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 829 selfloop transitions, 103 changer transitions 1/933 dead transitions. [2025-04-14 01:09:19,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 933 transitions, 22399 flow [2025-04-14 01:09:19,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:09:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:09:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2025-04-14 01:09:19,154 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.334375 [2025-04-14 01:09:19,154 INFO L175 Difference]: Start difference. First operand has 395 places, 891 transitions, 19875 flow. Second operand 10 states and 107 transitions. [2025-04-14 01:09:19,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 933 transitions, 22399 flow [2025-04-14 01:09:20,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 933 transitions, 21768 flow, removed 249 selfloop flow, removed 7 redundant places. [2025-04-14 01:09:20,639 INFO L231 Difference]: Finished difference. Result has 400 places, 912 transitions, 20032 flow [2025-04-14 01:09:20,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19308, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20032, PETRI_PLACES=400, PETRI_TRANSITIONS=912} [2025-04-14 01:09:20,640 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 369 predicate places. [2025-04-14 01:09:20,640 INFO L485 AbstractCegarLoop]: Abstraction has has 400 places, 912 transitions, 20032 flow [2025-04-14 01:09:20,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:20,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:20,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:20,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-14 01:09:20,641 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:20,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -496360218, now seen corresponding path program 34 times [2025-04-14 01:09:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:20,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920324611] [2025-04-14 01:09:20,641 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:09:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:20,646 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:20,649 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:20,649 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:09:20,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:20,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:20,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920324611] [2025-04-14 01:09:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920324611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:20,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:20,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:09:20,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541046841] [2025-04-14 01:09:20,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:20,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:09:20,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:20,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:09:20,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:09:20,815 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:20,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 912 transitions, 20032 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:20,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:20,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:20,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:23,173 INFO L116 PetriNetUnfolderBase]: 6625/10016 cut-off events. [2025-04-14 01:09:23,173 INFO L117 PetriNetUnfolderBase]: For 210459/210459 co-relation queries the response was YES. [2025-04-14 01:09:23,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91056 conditions, 10016 events. 6625/10016 cut-off events. For 210459/210459 co-relation queries the response was YES. Maximal size of possible extension queue 836. Compared 62116 event pairs, 1075 based on Foata normal form. 1/8526 useless extension candidates. Maximal degree in co-relation 90858. Up to 8756 conditions per place. [2025-04-14 01:09:23,309 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 724 selfloop transitions, 284 changer transitions 1/1009 dead transitions. [2025-04-14 01:09:23,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1009 transitions, 23670 flow [2025-04-14 01:09:23,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:09:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:09:23,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-04-14 01:09:23,310 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2025-04-14 01:09:23,310 INFO L175 Difference]: Start difference. First operand has 400 places, 912 transitions, 20032 flow. Second operand 11 states and 135 transitions. [2025-04-14 01:09:23,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 1009 transitions, 23670 flow [2025-04-14 01:09:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 1009 transitions, 23431 flow, removed 75 selfloop flow, removed 4 redundant places. [2025-04-14 01:09:24,663 INFO L231 Difference]: Finished difference. Result has 410 places, 951 transitions, 21786 flow [2025-04-14 01:09:24,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19801, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=912, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21786, PETRI_PLACES=410, PETRI_TRANSITIONS=951} [2025-04-14 01:09:24,663 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 379 predicate places. [2025-04-14 01:09:24,663 INFO L485 AbstractCegarLoop]: Abstraction has has 410 places, 951 transitions, 21786 flow [2025-04-14 01:09:24,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:24,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:24,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:24,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-14 01:09:24,664 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:24,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 926845076, now seen corresponding path program 35 times [2025-04-14 01:09:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:24,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275334434] [2025-04-14 01:09:24,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:09:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:24,669 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:24,673 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:24,673 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:09:24,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:24,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275334434] [2025-04-14 01:09:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275334434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:24,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437967812] [2025-04-14 01:09:24,836 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:09:24,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:24,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:24,839 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:09:24,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:09:24,882 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:24,895 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:24,896 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:09:24,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:24,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:09:24,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:24,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:09:25,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:09:25,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-14 01:09:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:25,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437967812] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:09:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:09:25,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111805596] [2025-04-14 01:09:25,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:25,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:09:25,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:25,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:09:25,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:09:25,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:25,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 951 transitions, 21786 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:25,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:25,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:25,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:27,556 INFO L116 PetriNetUnfolderBase]: 6694/10134 cut-off events. [2025-04-14 01:09:27,556 INFO L117 PetriNetUnfolderBase]: For 244876/244876 co-relation queries the response was YES. [2025-04-14 01:09:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94730 conditions, 10134 events. 6694/10134 cut-off events. For 244876/244876 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 63110 event pairs, 1014 based on Foata normal form. 1/8632 useless extension candidates. Maximal degree in co-relation 94527. Up to 7262 conditions per place. [2025-04-14 01:09:27,710 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 464 selfloop transitions, 542 changer transitions 1/1007 dead transitions. [2025-04-14 01:09:27,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1007 transitions, 24523 flow [2025-04-14 01:09:27,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:09:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:09:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 182 transitions. [2025-04-14 01:09:27,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-14 01:09:27,710 INFO L175 Difference]: Start difference. First operand has 410 places, 951 transitions, 21786 flow. Second operand 14 states and 182 transitions. [2025-04-14 01:09:27,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1007 transitions, 24523 flow [2025-04-14 01:09:29,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 1007 transitions, 24194 flow, removed 125 selfloop flow, removed 3 redundant places. [2025-04-14 01:09:29,404 INFO L231 Difference]: Finished difference. Result has 422 places, 959 transitions, 22958 flow [2025-04-14 01:09:29,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21457, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=22958, PETRI_PLACES=422, PETRI_TRANSITIONS=959} [2025-04-14 01:09:29,405 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 391 predicate places. [2025-04-14 01:09:29,405 INFO L485 AbstractCegarLoop]: Abstraction has has 422 places, 959 transitions, 22958 flow [2025-04-14 01:09:29,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:29,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:29,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:29,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:09:29,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2025-04-14 01:09:29,606 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:29,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:29,606 INFO L85 PathProgramCache]: Analyzing trace with hash -2043828562, now seen corresponding path program 36 times [2025-04-14 01:09:29,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:29,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418495373] [2025-04-14 01:09:29,606 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:09:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:29,611 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:29,615 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:29,615 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:09:29,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:29,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418495373] [2025-04-14 01:09:29,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418495373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:29,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:29,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:09:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10734519] [2025-04-14 01:09:29,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:29,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:09:29,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:29,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:09:29,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:09:29,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:29,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 959 transitions, 22958 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:29,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:29,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:29,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:32,384 INFO L116 PetriNetUnfolderBase]: 6716/10177 cut-off events. [2025-04-14 01:09:32,385 INFO L117 PetriNetUnfolderBase]: For 255881/255881 co-relation queries the response was YES. [2025-04-14 01:09:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97957 conditions, 10177 events. 6716/10177 cut-off events. For 255881/255881 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 63525 event pairs, 1157 based on Foata normal form. 1/8671 useless extension candidates. Maximal degree in co-relation 97750. Up to 9845 conditions per place. [2025-04-14 01:09:32,541 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 864 selfloop transitions, 131 changer transitions 1/996 dead transitions. [2025-04-14 01:09:32,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 996 transitions, 25525 flow [2025-04-14 01:09:32,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:09:32,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:09:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 125 transitions. [2025-04-14 01:09:32,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3255208333333333 [2025-04-14 01:09:32,542 INFO L175 Difference]: Start difference. First operand has 422 places, 959 transitions, 22958 flow. Second operand 12 states and 125 transitions. [2025-04-14 01:09:32,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 996 transitions, 25525 flow [2025-04-14 01:09:34,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 996 transitions, 24556 flow, removed 167 selfloop flow, removed 8 redundant places. [2025-04-14 01:09:34,142 INFO L231 Difference]: Finished difference. Result has 428 places, 974 transitions, 22787 flow [2025-04-14 01:09:34,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22004, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=828, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22787, PETRI_PLACES=428, PETRI_TRANSITIONS=974} [2025-04-14 01:09:34,143 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 397 predicate places. [2025-04-14 01:09:34,143 INFO L485 AbstractCegarLoop]: Abstraction has has 428 places, 974 transitions, 22787 flow [2025-04-14 01:09:34,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:34,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:34,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:34,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-14 01:09:34,143 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:34,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1876667956, now seen corresponding path program 37 times [2025-04-14 01:09:34,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:34,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747095220] [2025-04-14 01:09:34,144 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:34,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:34,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:34,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:34,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:34,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:34,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:34,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747095220] [2025-04-14 01:09:34,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747095220] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:34,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702051770] [2025-04-14 01:09:34,345 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:09:34,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:34,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:34,347 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:09:34,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:09:34,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:09:34,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:34,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:09:34,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:34,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:09:34,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:34,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:09:34,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:09:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:34,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:34,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:34,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702051770] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:34,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:09:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:09:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060045423] [2025-04-14 01:09:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:34,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:09:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:34,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:09:34,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:09:34,598 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:34,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 974 transitions, 22787 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:34,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:34,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:34,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:36,913 INFO L116 PetriNetUnfolderBase]: 6798/10304 cut-off events. [2025-04-14 01:09:36,913 INFO L117 PetriNetUnfolderBase]: For 235552/235552 co-relation queries the response was YES. [2025-04-14 01:09:37,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97638 conditions, 10304 events. 6798/10304 cut-off events. For 235552/235552 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 64582 event pairs, 1117 based on Foata normal form. 1/8780 useless extension candidates. Maximal degree in co-relation 97426. Up to 9405 conditions per place. [2025-04-14 01:09:37,084 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 805 selfloop transitions, 236 changer transitions 1/1042 dead transitions. [2025-04-14 01:09:37,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 1042 transitions, 26168 flow [2025-04-14 01:09:37,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:09:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:09:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2025-04-14 01:09:37,084 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-04-14 01:09:37,085 INFO L175 Difference]: Start difference. First operand has 428 places, 974 transitions, 22787 flow. Second operand 11 states and 148 transitions. [2025-04-14 01:09:37,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 1042 transitions, 26168 flow [2025-04-14 01:09:38,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1042 transitions, 25786 flow, removed 55 selfloop flow, removed 9 redundant places. [2025-04-14 01:09:38,765 INFO L231 Difference]: Finished difference. Result has 433 places, 1001 transitions, 24054 flow [2025-04-14 01:09:38,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22425, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=974, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=754, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=24054, PETRI_PLACES=433, PETRI_TRANSITIONS=1001} [2025-04-14 01:09:38,765 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 402 predicate places. [2025-04-14 01:09:38,766 INFO L485 AbstractCegarLoop]: Abstraction has has 433 places, 1001 transitions, 24054 flow [2025-04-14 01:09:38,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:38,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:38,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:38,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:09:38,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-14 01:09:38,966 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:38,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1102142036, now seen corresponding path program 38 times [2025-04-14 01:09:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:38,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213189423] [2025-04-14 01:09:38,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:09:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:38,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:38,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:38,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:09:38,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:39,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:39,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213189423] [2025-04-14 01:09:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213189423] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:39,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:09:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930382638] [2025-04-14 01:09:39,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:39,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:09:39,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:09:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:09:39,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:39,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1001 transitions, 24054 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:39,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:39,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:41,898 INFO L116 PetriNetUnfolderBase]: 6831/10362 cut-off events. [2025-04-14 01:09:41,899 INFO L117 PetriNetUnfolderBase]: For 247426/247426 co-relation queries the response was YES. [2025-04-14 01:09:41,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99102 conditions, 10362 events. 6831/10362 cut-off events. For 247426/247426 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 65048 event pairs, 1189 based on Foata normal form. 1/8824 useless extension candidates. Maximal degree in co-relation 98886. Up to 10117 conditions per place. [2025-04-14 01:09:42,036 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 910 selfloop transitions, 111 changer transitions 1/1022 dead transitions. [2025-04-14 01:09:42,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1022 transitions, 26269 flow [2025-04-14 01:09:42,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:09:42,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:09:42,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2025-04-14 01:09:42,037 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3506944444444444 [2025-04-14 01:09:42,037 INFO L175 Difference]: Start difference. First operand has 433 places, 1001 transitions, 24054 flow. Second operand 9 states and 101 transitions. [2025-04-14 01:09:42,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1022 transitions, 26269 flow [2025-04-14 01:09:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 1022 transitions, 26227 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-14 01:09:43,722 INFO L231 Difference]: Finished difference. Result has 441 places, 1003 transitions, 24299 flow [2025-04-14 01:09:43,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24012, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1001, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=24299, PETRI_PLACES=441, PETRI_TRANSITIONS=1003} [2025-04-14 01:09:43,723 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 410 predicate places. [2025-04-14 01:09:43,723 INFO L485 AbstractCegarLoop]: Abstraction has has 441 places, 1003 transitions, 24299 flow [2025-04-14 01:09:43,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:43,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:43,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:43,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-14 01:09:43,723 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:43,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1647184766, now seen corresponding path program 39 times [2025-04-14 01:09:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:43,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155984366] [2025-04-14 01:09:43,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:09:43,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:43,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:43,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:09:43,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:09:43,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:43,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155984366] [2025-04-14 01:09:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155984366] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:43,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:43,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:09:43,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086653355] [2025-04-14 01:09:43,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:43,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:09:43,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:43,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:09:43,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:09:43,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:43,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 1003 transitions, 24299 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:43,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:43,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:43,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:47,044 INFO L116 PetriNetUnfolderBase]: 7034/10675 cut-off events. [2025-04-14 01:09:47,044 INFO L117 PetriNetUnfolderBase]: For 268017/268017 co-relation queries the response was YES. [2025-04-14 01:09:47,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102660 conditions, 10675 events. 7034/10675 cut-off events. For 268017/268017 co-relation queries the response was YES. Maximal size of possible extension queue 908. Compared 67303 event pairs, 1178 based on Foata normal form. 1/9079 useless extension candidates. Maximal degree in co-relation 102441. Up to 9420 conditions per place. [2025-04-14 01:09:47,186 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 821 selfloop transitions, 248 changer transitions 1/1070 dead transitions. [2025-04-14 01:09:47,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 1070 transitions, 27477 flow [2025-04-14 01:09:47,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:09:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:09:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-04-14 01:09:47,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-04-14 01:09:47,187 INFO L175 Difference]: Start difference. First operand has 441 places, 1003 transitions, 24299 flow. Second operand 10 states and 124 transitions. [2025-04-14 01:09:47,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 1070 transitions, 27477 flow [2025-04-14 01:09:49,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 1070 transitions, 27183 flow, removed 21 selfloop flow, removed 7 redundant places. [2025-04-14 01:09:49,039 INFO L231 Difference]: Finished difference. Result has 446 places, 1019 transitions, 25374 flow [2025-04-14 01:09:49,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24006, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=25374, PETRI_PLACES=446, PETRI_TRANSITIONS=1019} [2025-04-14 01:09:49,040 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 415 predicate places. [2025-04-14 01:09:49,040 INFO L485 AbstractCegarLoop]: Abstraction has has 446 places, 1019 transitions, 25374 flow [2025-04-14 01:09:49,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:09:49,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:49,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:49,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-14 01:09:49,041 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:49,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1224577236, now seen corresponding path program 40 times [2025-04-14 01:09:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:49,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293672963] [2025-04-14 01:09:49,041 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:09:49,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:49,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:49,049 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:49,049 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:09:49,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:49,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293672963] [2025-04-14 01:09:49,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293672963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:09:49,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:09:49,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:09:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570135905] [2025-04-14 01:09:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:49,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:09:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:09:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:09:49,209 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:49,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 1019 transitions, 25374 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:49,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:49,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:49,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:52,338 INFO L116 PetriNetUnfolderBase]: 7378/11187 cut-off events. [2025-04-14 01:09:52,338 INFO L117 PetriNetUnfolderBase]: For 318453/318453 co-relation queries the response was YES. [2025-04-14 01:09:52,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110060 conditions, 11187 events. 7378/11187 cut-off events. For 318453/318453 co-relation queries the response was YES. Maximal size of possible extension queue 967. Compared 70900 event pairs, 1165 based on Foata normal form. 1/9517 useless extension candidates. Maximal degree in co-relation 109840. Up to 9019 conditions per place. [2025-04-14 01:09:52,489 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 667 selfloop transitions, 480 changer transitions 1/1148 dead transitions. [2025-04-14 01:09:52,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 1148 transitions, 29790 flow [2025-04-14 01:09:52,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-14 01:09:52,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-14 01:09:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 200 transitions. [2025-04-14 01:09:52,494 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2025-04-14 01:09:52,494 INFO L175 Difference]: Start difference. First operand has 446 places, 1019 transitions, 25374 flow. Second operand 18 states and 200 transitions. [2025-04-14 01:09:52,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 1148 transitions, 29790 flow [2025-04-14 01:09:54,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1148 transitions, 29559 flow, removed 66 selfloop flow, removed 4 redundant places. [2025-04-14 01:09:54,506 INFO L231 Difference]: Finished difference. Result has 465 places, 1096 transitions, 28726 flow [2025-04-14 01:09:54,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=25143, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=28726, PETRI_PLACES=465, PETRI_TRANSITIONS=1096} [2025-04-14 01:09:54,507 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 434 predicate places. [2025-04-14 01:09:54,507 INFO L485 AbstractCegarLoop]: Abstraction has has 465 places, 1096 transitions, 28726 flow [2025-04-14 01:09:54,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:09:54,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:09:54,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:09:54,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-14 01:09:54,507 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:09:54,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:09:54,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1032960852, now seen corresponding path program 41 times [2025-04-14 01:09:54,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:09:54,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169053840] [2025-04-14 01:09:54,508 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:09:54,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:09:54,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:54,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:54,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:09:54,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:09:54,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169053840] [2025-04-14 01:09:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169053840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:54,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589688034] [2025-04-14 01:09:54,698 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:09:54,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:09:54,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:09:54,700 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:09:54,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 01:09:54,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:09:54,764 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:09:54,764 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:09:54,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:09:54,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:09:54,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:09:54,786 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:09:54,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:09:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:09:54,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:09:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:09:54,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589688034] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:09:54,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:09:54,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:09:54,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509132038] [2025-04-14 01:09:54,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:09:54,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:09:54,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:09:54,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:09:54,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:09:54,974 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:09:54,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 1096 transitions, 28726 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:09:54,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:09:54,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:09:54,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:09:58,383 INFO L116 PetriNetUnfolderBase]: 7378/11185 cut-off events. [2025-04-14 01:09:58,384 INFO L117 PetriNetUnfolderBase]: For 355376/355376 co-relation queries the response was YES. [2025-04-14 01:09:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114328 conditions, 11185 events. 7378/11185 cut-off events. For 355376/355376 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 71074 event pairs, 1196 based on Foata normal form. 2/9516 useless extension candidates. Maximal degree in co-relation 114101. Up to 10198 conditions per place. [2025-04-14 01:09:58,537 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 911 selfloop transitions, 236 changer transitions 1/1148 dead transitions. [2025-04-14 01:09:58,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1148 transitions, 31637 flow [2025-04-14 01:09:58,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:09:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:09:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-04-14 01:09:58,538 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-14 01:09:58,539 INFO L175 Difference]: Start difference. First operand has 465 places, 1096 transitions, 28726 flow. Second operand 10 states and 130 transitions. [2025-04-14 01:09:58,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 1148 transitions, 31637 flow [2025-04-14 01:10:00,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 1148 transitions, 31292 flow, removed 96 selfloop flow, removed 9 redundant places. [2025-04-14 01:10:00,878 INFO L231 Difference]: Finished difference. Result has 468 places, 1108 transitions, 29145 flow [2025-04-14 01:10:00,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28383, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1095, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=29145, PETRI_PLACES=468, PETRI_TRANSITIONS=1108} [2025-04-14 01:10:00,878 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 437 predicate places. [2025-04-14 01:10:00,879 INFO L485 AbstractCegarLoop]: Abstraction has has 468 places, 1108 transitions, 29145 flow [2025-04-14 01:10:00,879 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:10:00,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:00,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:00,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 01:10:01,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-14 01:10:01,079 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:01,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1839799904, now seen corresponding path program 42 times [2025-04-14 01:10:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:01,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556693365] [2025-04-14 01:10:01,080 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:10:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:01,084 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:01,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:10:01,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:10:01,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:01,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556693365] [2025-04-14 01:10:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556693365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:10:01,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:10:01,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:10:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062425799] [2025-04-14 01:10:01,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:01,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:10:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:01,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:10:01,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:10:01,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:01,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 1108 transitions, 29145 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:10:01,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:01,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:01,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:04,481 INFO L116 PetriNetUnfolderBase]: 7378/11184 cut-off events. [2025-04-14 01:10:04,481 INFO L117 PetriNetUnfolderBase]: For 358574/358574 co-relation queries the response was YES. [2025-04-14 01:10:04,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114759 conditions, 11184 events. 7378/11184 cut-off events. For 358574/358574 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 70985 event pairs, 1247 based on Foata normal form. 1/9514 useless extension candidates. Maximal degree in co-relation 114528. Up to 10963 conditions per place. [2025-04-14 01:10:04,648 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1043 selfloop transitions, 87 changer transitions 1/1131 dead transitions. [2025-04-14 01:10:04,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1131 transitions, 31654 flow [2025-04-14 01:10:04,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:10:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:10:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2025-04-14 01:10:04,648 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3368055555555556 [2025-04-14 01:10:04,648 INFO L175 Difference]: Start difference. First operand has 468 places, 1108 transitions, 29145 flow. Second operand 9 states and 97 transitions. [2025-04-14 01:10:04,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1131 transitions, 31654 flow [2025-04-14 01:10:07,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 1131 transitions, 31323 flow, removed 37 selfloop flow, removed 5 redundant places. [2025-04-14 01:10:07,022 INFO L231 Difference]: Finished difference. Result has 473 places, 1112 transitions, 29137 flow [2025-04-14 01:10:07,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28830, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1021, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29137, PETRI_PLACES=473, PETRI_TRANSITIONS=1112} [2025-04-14 01:10:07,023 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 442 predicate places. [2025-04-14 01:10:07,023 INFO L485 AbstractCegarLoop]: Abstraction has has 473 places, 1112 transitions, 29137 flow [2025-04-14 01:10:07,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:10:07,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:07,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:07,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-14 01:10:07,024 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:07,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash 606116262, now seen corresponding path program 43 times [2025-04-14 01:10:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:07,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734281600] [2025-04-14 01:10:07,024 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:10:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:07,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:10:07,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:10:07,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:10:07,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:07,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:07,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734281600] [2025-04-14 01:10:07,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734281600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:07,196 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080567807] [2025-04-14 01:10:07,196 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:10:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:07,199 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:10:07,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 01:10:07,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:10:07,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:10:07,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:10:07,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:07,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:10:07,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:07,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:10:07,358 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:10:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:07,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080567807] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:07,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:10:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-14 01:10:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118241860] [2025-04-14 01:10:07,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:07,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:10:07,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:07,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:10:07,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:10:07,445 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:07,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 1112 transitions, 29137 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:10:07,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:07,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:07,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:10,604 INFO L116 PetriNetUnfolderBase]: 7396/11223 cut-off events. [2025-04-14 01:10:10,604 INFO L117 PetriNetUnfolderBase]: For 354175/354175 co-relation queries the response was YES. [2025-04-14 01:10:10,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114799 conditions, 11223 events. 7396/11223 cut-off events. For 354175/354175 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 71416 event pairs, 1196 based on Foata normal form. 1/9549 useless extension candidates. Maximal degree in co-relation 114564. Up to 10274 conditions per place. [2025-04-14 01:10:10,765 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 922 selfloop transitions, 227 changer transitions 1/1150 dead transitions. [2025-04-14 01:10:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1150 transitions, 31827 flow [2025-04-14 01:10:10,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:10:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:10:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2025-04-14 01:10:10,766 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.396875 [2025-04-14 01:10:10,766 INFO L175 Difference]: Start difference. First operand has 473 places, 1112 transitions, 29137 flow. Second operand 10 states and 127 transitions. [2025-04-14 01:10:10,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1150 transitions, 31827 flow [2025-04-14 01:10:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 1150 transitions, 31599 flow, removed 27 selfloop flow, removed 6 redundant places. [2025-04-14 01:10:13,088 INFO L231 Difference]: Finished difference. Result has 478 places, 1116 transitions, 29507 flow [2025-04-14 01:10:13,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28909, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=885, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=29507, PETRI_PLACES=478, PETRI_TRANSITIONS=1116} [2025-04-14 01:10:13,089 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 447 predicate places. [2025-04-14 01:10:13,089 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 1116 transitions, 29507 flow [2025-04-14 01:10:13,089 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:10:13,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:13,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:13,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:10:13,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:13,290 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:13,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:13,291 INFO L85 PathProgramCache]: Analyzing trace with hash -469594894, now seen corresponding path program 44 times [2025-04-14 01:10:13,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:13,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846195309] [2025-04-14 01:10:13,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:10:13,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:13,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:13,299 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:10:13,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:10:13,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:13,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846195309] [2025-04-14 01:10:13,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846195309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:10:13,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:10:13,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:10:13,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354107802] [2025-04-14 01:10:13,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:13,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:10:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:13,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:10:13,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:10:13,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:13,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1116 transitions, 29507 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:13,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:13,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:13,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:16,567 INFO L116 PetriNetUnfolderBase]: 7396/11222 cut-off events. [2025-04-14 01:10:16,568 INFO L117 PetriNetUnfolderBase]: For 365950/365950 co-relation queries the response was YES. [2025-04-14 01:10:16,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115538 conditions, 11222 events. 7396/11222 cut-off events. For 365950/365950 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 71431 event pairs, 1247 based on Foata normal form. 1/9548 useless extension candidates. Maximal degree in co-relation 115301. Up to 10972 conditions per place. [2025-04-14 01:10:16,731 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1046 selfloop transitions, 91 changer transitions 1/1138 dead transitions. [2025-04-14 01:10:16,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1138 transitions, 31990 flow [2025-04-14 01:10:16,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:10:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:10:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-14 01:10:16,732 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.321875 [2025-04-14 01:10:16,732 INFO L175 Difference]: Start difference. First operand has 478 places, 1116 transitions, 29507 flow. Second operand 10 states and 103 transitions. [2025-04-14 01:10:16,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1138 transitions, 31990 flow [2025-04-14 01:10:18,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 1138 transitions, 31673 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-04-14 01:10:19,007 INFO L231 Difference]: Finished difference. Result has 482 places, 1118 transitions, 29474 flow [2025-04-14 01:10:19,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29206, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1025, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=29474, PETRI_PLACES=482, PETRI_TRANSITIONS=1118} [2025-04-14 01:10:19,008 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 451 predicate places. [2025-04-14 01:10:19,008 INFO L485 AbstractCegarLoop]: Abstraction has has 482 places, 1118 transitions, 29474 flow [2025-04-14 01:10:19,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:19,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:19,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:19,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-14 01:10:19,009 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:19,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:19,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1342588184, now seen corresponding path program 45 times [2025-04-14 01:10:19,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:19,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138389656] [2025-04-14 01:10:19,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:10:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:19,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:19,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:10:19,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:10:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:19,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:19,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138389656] [2025-04-14 01:10:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138389656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:10:19,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:10:19,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 01:10:19,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600016276] [2025-04-14 01:10:19,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:19,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:10:19,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:19,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:10:19,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:10:19,294 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:19,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 1118 transitions, 29474 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:10:19,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:19,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:19,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:22,387 INFO L116 PetriNetUnfolderBase]: 7414/11259 cut-off events. [2025-04-14 01:10:22,387 INFO L117 PetriNetUnfolderBase]: For 361267/361267 co-relation queries the response was YES. [2025-04-14 01:10:22,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115470 conditions, 11259 events. 7414/11259 cut-off events. For 361267/361267 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 71743 event pairs, 1253 based on Foata normal form. 1/9579 useless extension candidates. Maximal degree in co-relation 115230. Up to 11038 conditions per place. [2025-04-14 01:10:22,554 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1056 selfloop transitions, 84 changer transitions 1/1141 dead transitions. [2025-04-14 01:10:22,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 1141 transitions, 31973 flow [2025-04-14 01:10:22,554 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:10:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:10:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2025-04-14 01:10:22,555 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3298611111111111 [2025-04-14 01:10:22,555 INFO L175 Difference]: Start difference. First operand has 482 places, 1118 transitions, 29474 flow. Second operand 9 states and 95 transitions. [2025-04-14 01:10:22,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 1141 transitions, 31973 flow [2025-04-14 01:10:24,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 1141 transitions, 31769 flow, removed 27 selfloop flow, removed 6 redundant places. [2025-04-14 01:10:24,589 INFO L231 Difference]: Finished difference. Result has 486 places, 1122 transitions, 29557 flow [2025-04-14 01:10:24,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29270, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29557, PETRI_PLACES=486, PETRI_TRANSITIONS=1122} [2025-04-14 01:10:24,590 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 455 predicate places. [2025-04-14 01:10:24,590 INFO L485 AbstractCegarLoop]: Abstraction has has 486 places, 1122 transitions, 29557 flow [2025-04-14 01:10:24,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:10:24,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:24,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:24,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-14 01:10:24,590 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:24,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash 921558246, now seen corresponding path program 46 times [2025-04-14 01:10:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:24,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401579384] [2025-04-14 01:10:24,591 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:10:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:24,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:24,597 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:10:24,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:10:24,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:24,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401579384] [2025-04-14 01:10:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401579384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:10:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:10:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:10:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093457229] [2025-04-14 01:10:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:24,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:10:24,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:24,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:10:24,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:10:24,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:24,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 1122 transitions, 29557 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:24,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:24,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:24,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:28,392 INFO L116 PetriNetUnfolderBase]: 7432/11296 cut-off events. [2025-04-14 01:10:28,392 INFO L117 PetriNetUnfolderBase]: For 362057/362057 co-relation queries the response was YES. [2025-04-14 01:10:28,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115664 conditions, 11296 events. 7432/11296 cut-off events. For 362057/362057 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 72144 event pairs, 1253 based on Foata normal form. 1/9610 useless extension candidates. Maximal degree in co-relation 115423. Up to 11012 conditions per place. [2025-04-14 01:10:28,576 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1028 selfloop transitions, 117 changer transitions 1/1146 dead transitions. [2025-04-14 01:10:28,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 1146 transitions, 32036 flow [2025-04-14 01:10:28,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:10:28,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:10:28,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2025-04-14 01:10:28,578 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.340625 [2025-04-14 01:10:28,578 INFO L175 Difference]: Start difference. First operand has 486 places, 1122 transitions, 29557 flow. Second operand 10 states and 109 transitions. [2025-04-14 01:10:28,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 1146 transitions, 32036 flow [2025-04-14 01:10:30,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 488 places, 1146 transitions, 31819 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-04-14 01:10:30,929 INFO L231 Difference]: Finished difference. Result has 489 places, 1124 transitions, 29650 flow [2025-04-14 01:10:30,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29340, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1005, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=29650, PETRI_PLACES=489, PETRI_TRANSITIONS=1124} [2025-04-14 01:10:30,930 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 458 predicate places. [2025-04-14 01:10:30,930 INFO L485 AbstractCegarLoop]: Abstraction has has 489 places, 1124 transitions, 29650 flow [2025-04-14 01:10:30,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:30,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:30,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:30,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-14 01:10:30,930 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:30,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 926910060, now seen corresponding path program 47 times [2025-04-14 01:10:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:30,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533957854] [2025-04-14 01:10:30,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:10:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:30,934 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:30,937 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:10:30,937 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:30,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:31,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:31,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533957854] [2025-04-14 01:10:31,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533957854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:31,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646459393] [2025-04-14 01:10:31,083 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:10:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:31,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:10:31,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 01:10:31,130 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:31,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:10:31,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:10:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:31,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:10:31,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:31,157 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:10:31,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-14 01:10:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:31,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:31,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646459393] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:31,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:10:31,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-14 01:10:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483870822] [2025-04-14 01:10:31,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:31,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:10:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:31,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:10:31,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-04-14 01:10:31,354 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:31,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 1124 transitions, 29650 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:10:31,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:31,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:31,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:34,960 INFO L116 PetriNetUnfolderBase]: 8060/12195 cut-off events. [2025-04-14 01:10:34,960 INFO L117 PetriNetUnfolderBase]: For 381299/381299 co-relation queries the response was YES. [2025-04-14 01:10:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126818 conditions, 12195 events. 8060/12195 cut-off events. For 381299/381299 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 78375 event pairs, 1185 based on Foata normal form. 1/10398 useless extension candidates. Maximal degree in co-relation 126576. Up to 10252 conditions per place. [2025-04-14 01:10:35,157 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 836 selfloop transitions, 516 changer transitions 1/1353 dead transitions. [2025-04-14 01:10:35,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 1353 transitions, 37497 flow [2025-04-14 01:10:35,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:10:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:10:35,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2025-04-14 01:10:35,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40865384615384615 [2025-04-14 01:10:35,158 INFO L175 Difference]: Start difference. First operand has 489 places, 1124 transitions, 29650 flow. Second operand 13 states and 170 transitions. [2025-04-14 01:10:35,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 1353 transitions, 37497 flow [2025-04-14 01:10:38,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 1353 transitions, 37209 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-04-14 01:10:38,126 INFO L231 Difference]: Finished difference. Result has 498 places, 1284 transitions, 35457 flow [2025-04-14 01:10:38,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=29380, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=35457, PETRI_PLACES=498, PETRI_TRANSITIONS=1284} [2025-04-14 01:10:38,131 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 467 predicate places. [2025-04-14 01:10:38,131 INFO L485 AbstractCegarLoop]: Abstraction has has 498 places, 1284 transitions, 35457 flow [2025-04-14 01:10:38,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 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-14 01:10:38,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:38,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:38,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 01:10:38,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:38,332 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:38,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:38,333 INFO L85 PathProgramCache]: Analyzing trace with hash 376350168, now seen corresponding path program 48 times [2025-04-14 01:10:38,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:38,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262156105] [2025-04-14 01:10:38,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:10:38,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:38,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:10:38,340 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:10:38,340 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:10:38,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:10:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:38,464 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262156105] [2025-04-14 01:10:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262156105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:10:38,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:10:38,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:10:38,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366190165] [2025-04-14 01:10:38,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:10:38,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:10:38,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:38,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:10:38,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:10:38,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:38,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 1284 transitions, 35457 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:38,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:38,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:38,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:42,218 INFO L116 PetriNetUnfolderBase]: 8060/12194 cut-off events. [2025-04-14 01:10:42,218 INFO L117 PetriNetUnfolderBase]: For 409420/409420 co-relation queries the response was YES. [2025-04-14 01:10:42,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131028 conditions, 12194 events. 8060/12194 cut-off events. For 409420/409420 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 78089 event pairs, 1297 based on Foata normal form. 1/10397 useless extension candidates. Maximal degree in co-relation 130781. Up to 11933 conditions per place. [2025-04-14 01:10:42,428 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1216 selfloop transitions, 91 changer transitions 1/1308 dead transitions. [2025-04-14 01:10:42,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 1308 transitions, 38264 flow [2025-04-14 01:10:42,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:10:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:10:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-14 01:10:42,429 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.321875 [2025-04-14 01:10:42,429 INFO L175 Difference]: Start difference. First operand has 498 places, 1284 transitions, 35457 flow. Second operand 10 states and 103 transitions. [2025-04-14 01:10:42,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 1308 transitions, 38264 flow [2025-04-14 01:10:45,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1308 transitions, 37942 flow, removed 39 selfloop flow, removed 5 redundant places. [2025-04-14 01:10:45,359 INFO L231 Difference]: Finished difference. Result has 503 places, 1286 transitions, 35397 flow [2025-04-14 01:10:45,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35147, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=35397, PETRI_PLACES=503, PETRI_TRANSITIONS=1286} [2025-04-14 01:10:45,360 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 472 predicate places. [2025-04-14 01:10:45,360 INFO L485 AbstractCegarLoop]: Abstraction has has 503 places, 1286 transitions, 35397 flow [2025-04-14 01:10:45,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-14 01:10:45,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:10:45,360 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:10:45,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-14 01:10:45,360 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:10:45,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:10:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1834323357, now seen corresponding path program 1 times [2025-04-14 01:10:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:10:45,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922869689] [2025-04-14 01:10:45,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:10:45,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:10:45,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:10:45,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:10:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:10:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:45,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:10:45,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922869689] [2025-04-14 01:10:45,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922869689] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:10:45,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788841579] [2025-04-14 01:10:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:10:45,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:10:45,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:10:45,496 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:10:45,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-14 01:10:45,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:10:45,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:10:45,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:10:45,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:10:45,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:10:45,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:10:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:45,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:10:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:10:45,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788841579] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:10:45,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:10:45,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:10:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033451292] [2025-04-14 01:10:45,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:10:45,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:10:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:10:45,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:10:45,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:10:45,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:10:45,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1286 transitions, 35397 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:10:45,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:10:45,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:10:45,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:10:53,001 INFO L116 PetriNetUnfolderBase]: 15287/23305 cut-off events. [2025-04-14 01:10:53,001 INFO L117 PetriNetUnfolderBase]: For 809238/809238 co-relation queries the response was YES. [2025-04-14 01:10:53,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254549 conditions, 23305 events. 15287/23305 cut-off events. For 809238/809238 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 166428 event pairs, 4062 based on Foata normal form. 0/20020 useless extension candidates. Maximal degree in co-relation 253436. Up to 8590 conditions per place. [2025-04-14 01:10:54,084 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2518 selfloop transitions, 83 changer transitions 0/2601 dead transitions. [2025-04-14 01:10:54,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 2601 transitions, 76606 flow [2025-04-14 01:10:54,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:10:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:10:54,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-04-14 01:10:54,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2025-04-14 01:10:54,085 INFO L175 Difference]: Start difference. First operand has 503 places, 1286 transitions, 35397 flow. Second operand 7 states and 103 transitions. [2025-04-14 01:10:54,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 509 places, 2601 transitions, 76606 flow [2025-04-14 01:11:01,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 2601 transitions, 76288 flow, removed 43 selfloop flow, removed 7 redundant places. [2025-04-14 01:11:01,913 INFO L231 Difference]: Finished difference. Result has 506 places, 1367 transitions, 38374 flow [2025-04-14 01:11:01,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35238, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38374, PETRI_PLACES=506, PETRI_TRANSITIONS=1367} [2025-04-14 01:11:01,914 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 475 predicate places. [2025-04-14 01:11:01,915 INFO L485 AbstractCegarLoop]: Abstraction has has 506 places, 1367 transitions, 38374 flow [2025-04-14 01:11:01,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:01,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:11:01,915 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] [2025-04-14 01:11:01,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-14 01:11:02,115 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2025-04-14 01:11:02,115 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:11:02,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:11:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 475241015, now seen corresponding path program 1 times [2025-04-14 01:11:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:11:02,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373117256] [2025-04-14 01:11:02,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:11:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:11:02,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:11:02,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:11:02,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:11:02,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:11:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:11:02,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:11:02,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373117256] [2025-04-14 01:11:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373117256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:11:02,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:11:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:11:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135111972] [2025-04-14 01:11:02,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:11:02,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:11:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:11:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:11:02,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:11:02,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:11:02,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 1367 transitions, 38374 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:02,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:11:02,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:11:02,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:11:10,569 INFO L116 PetriNetUnfolderBase]: 16615/25303 cut-off events. [2025-04-14 01:11:10,569 INFO L117 PetriNetUnfolderBase]: For 955086/955086 co-relation queries the response was YES. [2025-04-14 01:11:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280684 conditions, 25303 events. 16615/25303 cut-off events. For 955086/955086 co-relation queries the response was YES. Maximal size of possible extension queue 1873. Compared 182263 event pairs, 2371 based on Foata normal form. 39/21692 useless extension candidates. Maximal degree in co-relation 279569. Up to 9585 conditions per place. [2025-04-14 01:11:11,069 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1888 selfloop transitions, 239 changer transitions 6/2133 dead transitions. [2025-04-14 01:11:11,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 2133 transitions, 62118 flow [2025-04-14 01:11:11,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:11:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:11:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-04-14 01:11:11,070 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-04-14 01:11:11,070 INFO L175 Difference]: Start difference. First operand has 506 places, 1367 transitions, 38374 flow. Second operand 7 states and 122 transitions. [2025-04-14 01:11:11,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 2133 transitions, 62118 flow [2025-04-14 01:11:19,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 511 places, 2133 transitions, 62110 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:11:19,810 INFO L231 Difference]: Finished difference. Result has 515 places, 1448 transitions, 42060 flow [2025-04-14 01:11:19,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38366, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42060, PETRI_PLACES=515, PETRI_TRANSITIONS=1448} [2025-04-14 01:11:19,811 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 484 predicate places. [2025-04-14 01:11:19,811 INFO L485 AbstractCegarLoop]: Abstraction has has 515 places, 1448 transitions, 42060 flow [2025-04-14 01:11:19,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:19,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:11:19,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:11:19,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-14 01:11:19,811 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:11:19,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:11:19,812 INFO L85 PathProgramCache]: Analyzing trace with hash -739937761, now seen corresponding path program 1 times [2025-04-14 01:11:19,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:11:19,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462496340] [2025-04-14 01:11:19,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:11:19,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:11:19,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:11:19,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:11:19,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:11:19,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:11:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:11:19,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:11:19,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462496340] [2025-04-14 01:11:19,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462496340] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:11:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:11:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:11:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569018270] [2025-04-14 01:11:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:11:19,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:11:19,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:11:19,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:11:19,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:11:19,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:11:19,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1448 transitions, 42060 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:19,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:11:19,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:11:19,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:11:28,987 INFO L116 PetriNetUnfolderBase]: 17276/26430 cut-off events. [2025-04-14 01:11:28,987 INFO L117 PetriNetUnfolderBase]: For 1094339/1094339 co-relation queries the response was YES. [2025-04-14 01:11:29,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301044 conditions, 26430 events. 17276/26430 cut-off events. For 1094339/1094339 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 193323 event pairs, 2296 based on Foata normal form. 0/24253 useless extension candidates. Maximal degree in co-relation 299876. Up to 9580 conditions per place. [2025-04-14 01:11:29,472 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1944 selfloop transitions, 215 changer transitions 19/2178 dead transitions. [2025-04-14 01:11:29,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 2178 transitions, 64689 flow [2025-04-14 01:11:29,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:11:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:11:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2025-04-14 01:11:29,472 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-04-14 01:11:29,472 INFO L175 Difference]: Start difference. First operand has 515 places, 1448 transitions, 42060 flow. Second operand 7 states and 108 transitions. [2025-04-14 01:11:29,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 2178 transitions, 64689 flow [2025-04-14 01:11:39,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 2178 transitions, 64621 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-14 01:11:39,980 INFO L231 Difference]: Finished difference. Result has 522 places, 1465 transitions, 42945 flow [2025-04-14 01:11:39,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41996, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=42945, PETRI_PLACES=522, PETRI_TRANSITIONS=1465} [2025-04-14 01:11:39,981 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 491 predicate places. [2025-04-14 01:11:39,981 INFO L485 AbstractCegarLoop]: Abstraction has has 522 places, 1465 transitions, 42945 flow [2025-04-14 01:11:39,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:39,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:11:39,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:11:39,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-14 01:11:39,981 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:11:39,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:11:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash 26912539, now seen corresponding path program 2 times [2025-04-14 01:11:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:11:39,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693519698] [2025-04-14 01:11:39,982 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:11:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:11:39,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:11:39,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-14 01:11:39,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:11:39,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:11:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:11:40,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:11:40,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693519698] [2025-04-14 01:11:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693519698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:11:40,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:11:40,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:11:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433439861] [2025-04-14 01:11:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:11:40,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:11:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:11:40,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:11:40,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:11:40,008 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:11:40,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 1465 transitions, 42945 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:11:40,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:11:40,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:11:40,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:11:49,716 INFO L116 PetriNetUnfolderBase]: 17099/26132 cut-off events. [2025-04-14 01:11:49,717 INFO L117 PetriNetUnfolderBase]: For 1167557/1167557 co-relation queries the response was YES. [2025-04-14 01:11:50,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305627 conditions, 26132 events. 17099/26132 cut-off events. For 1167557/1167557 co-relation queries the response was YES. Maximal size of possible extension queue 1954. Compared 188857 event pairs, 2143 based on Foata normal form. 18/24223 useless extension candidates. Maximal degree in co-relation 304400. Up to 8356 conditions per place. [2025-04-14 01:11:50,643 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1730 selfloop transitions, 312 changer transitions 14/2056 dead transitions. [2025-04-14 01:11:50,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 2056 transitions, 61214 flow [2025-04-14 01:11:50,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:11:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:11:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-04-14 01:11:50,645 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5580357142857143 [2025-04-14 01:11:50,645 INFO L175 Difference]: Start difference. First operand has 522 places, 1465 transitions, 42945 flow. Second operand 7 states and 125 transitions. [2025-04-14 01:11:50,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 2056 transitions, 61214 flow [2025-04-14 01:12:02,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 2056 transitions, 60890 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-04-14 01:12:02,080 INFO L231 Difference]: Finished difference. Result has 526 places, 1516 transitions, 44304 flow [2025-04-14 01:12:02,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42600, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44304, PETRI_PLACES=526, PETRI_TRANSITIONS=1516} [2025-04-14 01:12:02,081 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 495 predicate places. [2025-04-14 01:12:02,081 INFO L485 AbstractCegarLoop]: Abstraction has has 526 places, 1516 transitions, 44304 flow [2025-04-14 01:12:02,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:02,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:02,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-14 01:12:02,082 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:02,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1366610089, now seen corresponding path program 1 times [2025-04-14 01:12:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:02,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729446727] [2025-04-14 01:12:02,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:02,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:02,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:02,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:02,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:02,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:02,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729446727] [2025-04-14 01:12:02,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729446727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:12:02,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528239933] [2025-04-14 01:12:02,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:12:02,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:12:02,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:12:02,116 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:12:02,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-14 01:12:02,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:12:02,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:02,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:12:02,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:02,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:12:02,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:12:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:02,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:12:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:12:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528239933] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:12:02,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:12:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-14 01:12:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491131605] [2025-04-14 01:12:02,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:12:02,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:12:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:02,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:12:02,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:12:02,221 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:02,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 1516 transitions, 44304 flow. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:02,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:02,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:02,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:10,184 INFO L116 PetriNetUnfolderBase]: 13524/21106 cut-off events. [2025-04-14 01:12:10,185 INFO L117 PetriNetUnfolderBase]: For 943230/943230 co-relation queries the response was YES. [2025-04-14 01:12:10,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244985 conditions, 21106 events. 13524/21106 cut-off events. For 943230/943230 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 153702 event pairs, 4176 based on Foata normal form. 732/20151 useless extension candidates. Maximal degree in co-relation 243974. Up to 13804 conditions per place. [2025-04-14 01:12:10,548 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2337 selfloop transitions, 103 changer transitions 49/2489 dead transitions. [2025-04-14 01:12:10,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 2489 transitions, 76711 flow [2025-04-14 01:12:10,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:12:10,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:12:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-04-14 01:12:10,549 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2025-04-14 01:12:10,549 INFO L175 Difference]: Start difference. First operand has 526 places, 1516 transitions, 44304 flow. Second operand 6 states and 85 transitions. [2025-04-14 01:12:10,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 2489 transitions, 76711 flow [2025-04-14 01:12:19,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 2489 transitions, 76325 flow, removed 44 selfloop flow, removed 5 redundant places. [2025-04-14 01:12:19,620 INFO L231 Difference]: Finished difference. Result has 528 places, 1588 transitions, 46750 flow [2025-04-14 01:12:19,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43403, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=46750, PETRI_PLACES=528, PETRI_TRANSITIONS=1588} [2025-04-14 01:12:19,621 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 497 predicate places. [2025-04-14 01:12:19,621 INFO L485 AbstractCegarLoop]: Abstraction has has 528 places, 1588 transitions, 46750 flow [2025-04-14 01:12:19,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:19,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:19,621 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] [2025-04-14 01:12:19,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-14 01:12:19,821 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-14 01:12:19,822 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:19,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:19,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1505519593, now seen corresponding path program 3 times [2025-04-14 01:12:19,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:19,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992843275] [2025-04-14 01:12:19,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:12:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:19,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:19,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-14 01:12:19,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:12:19,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:19,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992843275] [2025-04-14 01:12:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992843275] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:12:19,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:12:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:12:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683664958] [2025-04-14 01:12:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:19,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:12:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:19,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:12:19,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:12:19,850 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:19,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 1588 transitions, 46750 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:19,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:19,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:19,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:28,417 INFO L116 PetriNetUnfolderBase]: 14321/22301 cut-off events. [2025-04-14 01:12:28,418 INFO L117 PetriNetUnfolderBase]: For 1008984/1008984 co-relation queries the response was YES. [2025-04-14 01:12:28,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262012 conditions, 22301 events. 14321/22301 cut-off events. For 1008984/1008984 co-relation queries the response was YES. Maximal size of possible extension queue 1877. Compared 165061 event pairs, 2364 based on Foata normal form. 91/20544 useless extension candidates. Maximal degree in co-relation 260997. Up to 11870 conditions per place. [2025-04-14 01:12:28,886 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1728 selfloop transitions, 405 changer transitions 13/2146 dead transitions. [2025-04-14 01:12:28,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 2146 transitions, 65444 flow [2025-04-14 01:12:28,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:12:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:12:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-04-14 01:12:28,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49609375 [2025-04-14 01:12:28,887 INFO L175 Difference]: Start difference. First operand has 528 places, 1588 transitions, 46750 flow. Second operand 8 states and 127 transitions. [2025-04-14 01:12:28,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 2146 transitions, 65444 flow [2025-04-14 01:12:38,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 2146 transitions, 65432 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:12:38,803 INFO L231 Difference]: Finished difference. Result has 536 places, 1629 transitions, 49619 flow [2025-04-14 01:12:38,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=46697, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=49619, PETRI_PLACES=536, PETRI_TRANSITIONS=1629} [2025-04-14 01:12:38,806 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 505 predicate places. [2025-04-14 01:12:38,806 INFO L485 AbstractCegarLoop]: Abstraction has has 536 places, 1629 transitions, 49619 flow [2025-04-14 01:12:38,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:38,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:38,806 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] [2025-04-14 01:12:38,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-14 01:12:38,807 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:38,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1431815205, now seen corresponding path program 4 times [2025-04-14 01:12:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:38,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156859178] [2025-04-14 01:12:38,807 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:12:38,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:38,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:38,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-14 01:12:38,813 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:12:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:38,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:38,828 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156859178] [2025-04-14 01:12:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156859178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:12:38,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:12:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:12:38,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882845767] [2025-04-14 01:12:38,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:38,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:12:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:38,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:12:38,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:12:38,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:38,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 1629 transitions, 49619 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:38,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:38,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:38,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:12:47,853 INFO L116 PetriNetUnfolderBase]: 14368/22388 cut-off events. [2025-04-14 01:12:47,853 INFO L117 PetriNetUnfolderBase]: For 1109558/1109558 co-relation queries the response was YES. [2025-04-14 01:12:48,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268287 conditions, 22388 events. 14368/22388 cut-off events. For 1109558/1109558 co-relation queries the response was YES. Maximal size of possible extension queue 1896. Compared 166491 event pairs, 2848 based on Foata normal form. 162/20674 useless extension candidates. Maximal degree in co-relation 267234. Up to 15254 conditions per place. [2025-04-14 01:12:48,311 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1468 selfloop transitions, 375 changer transitions 5/1848 dead transitions. [2025-04-14 01:12:48,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 1848 transitions, 57978 flow [2025-04-14 01:12:48,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:12:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:12:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-14 01:12:48,312 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-14 01:12:48,312 INFO L175 Difference]: Start difference. First operand has 536 places, 1629 transitions, 49619 flow. Second operand 5 states and 84 transitions. [2025-04-14 01:12:48,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 1848 transitions, 57978 flow [2025-04-14 01:12:57,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 1848 transitions, 57363 flow, removed 34 selfloop flow, removed 4 redundant places. [2025-04-14 01:12:57,873 INFO L231 Difference]: Finished difference. Result has 537 places, 1623 transitions, 49421 flow [2025-04-14 01:12:57,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=48284, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=49421, PETRI_PLACES=537, PETRI_TRANSITIONS=1623} [2025-04-14 01:12:57,874 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 506 predicate places. [2025-04-14 01:12:57,874 INFO L485 AbstractCegarLoop]: Abstraction has has 537 places, 1623 transitions, 49421 flow [2025-04-14 01:12:57,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:57,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:12:57,874 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:12:57,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-14 01:12:57,874 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:12:57,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:12:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1369729557, now seen corresponding path program 2 times [2025-04-14 01:12:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:12:57,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925415504] [2025-04-14 01:12:57,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:12:57,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:12:57,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:12:57,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:12:57,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:12:57,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:12:57,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:12:57,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:12:57,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925415504] [2025-04-14 01:12:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925415504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:12:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:12:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:12:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034568768] [2025-04-14 01:12:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:12:57,910 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:12:57,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:12:57,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:12:57,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:12:57,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:12:57,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 1623 transitions, 49421 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:12:57,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:12:57,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:12:57,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:07,266 INFO L116 PetriNetUnfolderBase]: 15102/23469 cut-off events. [2025-04-14 01:13:07,266 INFO L117 PetriNetUnfolderBase]: For 1177070/1177070 co-relation queries the response was YES. [2025-04-14 01:13:07,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283094 conditions, 23469 events. 15102/23469 cut-off events. For 1177070/1177070 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 174863 event pairs, 2688 based on Foata normal form. 0/21700 useless extension candidates. Maximal degree in co-relation 282153. Up to 13478 conditions per place. [2025-04-14 01:13:07,854 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1648 selfloop transitions, 438 changer transitions 45/2131 dead transitions. [2025-04-14 01:13:07,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 2131 transitions, 66198 flow [2025-04-14 01:13:07,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:13:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:13:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-14 01:13:07,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-04-14 01:13:07,855 INFO L175 Difference]: Start difference. First operand has 537 places, 1623 transitions, 49421 flow. Second operand 6 states and 86 transitions. [2025-04-14 01:13:07,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 2131 transitions, 66198 flow [2025-04-14 01:13:18,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 2131 transitions, 65688 flow, removed 54 selfloop flow, removed 1 redundant places. [2025-04-14 01:13:18,613 INFO L231 Difference]: Finished difference. Result has 544 places, 1703 transitions, 52716 flow [2025-04-14 01:13:18,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49001, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=52716, PETRI_PLACES=544, PETRI_TRANSITIONS=1703} [2025-04-14 01:13:18,614 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 513 predicate places. [2025-04-14 01:13:18,614 INFO L485 AbstractCegarLoop]: Abstraction has has 544 places, 1703 transitions, 52716 flow [2025-04-14 01:13:18,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:18,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:18,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:13:18,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-14 01:13:18,614 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:18,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash 420055245, now seen corresponding path program 3 times [2025-04-14 01:13:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:18,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345958733] [2025-04-14 01:13:18,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:18,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:18,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:18,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:18,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:18,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:18,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:18,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345958733] [2025-04-14 01:13:18,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345958733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:18,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767320237] [2025-04-14 01:13:18,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:13:18,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:18,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:13:18,659 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:13:18,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-14 01:13:18,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:18,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:18,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:13:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:18,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:13:18,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:13:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:18,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:13:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:18,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767320237] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:13:18,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:13:18,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:13:18,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305825643] [2025-04-14 01:13:18,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:13:18,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:13:18,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:18,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:13:18,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:13:18,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:18,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 1703 transitions, 52716 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:18,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:18,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:18,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:28,737 INFO L116 PetriNetUnfolderBase]: 14714/22790 cut-off events. [2025-04-14 01:13:28,738 INFO L117 PetriNetUnfolderBase]: For 1241981/1241981 co-relation queries the response was YES. [2025-04-14 01:13:29,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283562 conditions, 22790 events. 14714/22790 cut-off events. For 1241981/1241981 co-relation queries the response was YES. Maximal size of possible extension queue 1900. Compared 167333 event pairs, 2015 based on Foata normal form. 304/22195 useless extension candidates. Maximal degree in co-relation 282704. Up to 12374 conditions per place. [2025-04-14 01:13:29,555 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1850 selfloop transitions, 308 changer transitions 47/2205 dead transitions. [2025-04-14 01:13:29,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 2205 transitions, 69816 flow [2025-04-14 01:13:29,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:13:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:13:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2025-04-14 01:13:29,556 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2025-04-14 01:13:29,556 INFO L175 Difference]: Start difference. First operand has 544 places, 1703 transitions, 52716 flow. Second operand 6 states and 94 transitions. [2025-04-14 01:13:29,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 2205 transitions, 69816 flow [2025-04-14 01:13:40,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 2205 transitions, 69448 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 01:13:40,565 INFO L231 Difference]: Finished difference. Result has 548 places, 1687 transitions, 52692 flow [2025-04-14 01:13:40,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51545, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=52692, PETRI_PLACES=548, PETRI_TRANSITIONS=1687} [2025-04-14 01:13:40,566 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 517 predicate places. [2025-04-14 01:13:40,567 INFO L485 AbstractCegarLoop]: Abstraction has has 548 places, 1687 transitions, 52692 flow [2025-04-14 01:13:40,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:40,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:13:40,567 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] [2025-04-14 01:13:40,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:13:40,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:13:40,767 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:13:40,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:13:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1665893301, now seen corresponding path program 5 times [2025-04-14 01:13:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:13:40,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731991030] [2025-04-14 01:13:40,768 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:13:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:13:40,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:13:40,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:13:40,776 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:13:40,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:13:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:13:40,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:13:40,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731991030] [2025-04-14 01:13:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731991030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:13:40,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:13:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:13:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064678753] [2025-04-14 01:13:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:13:40,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:13:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:13:40,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:13:40,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:13:40,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:13:40,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 1687 transitions, 52692 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:13:40,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:13:40,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:13:40,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:13:50,060 INFO L116 PetriNetUnfolderBase]: 14453/22270 cut-off events. [2025-04-14 01:13:50,061 INFO L117 PetriNetUnfolderBase]: For 1249860/1249860 co-relation queries the response was YES. [2025-04-14 01:13:50,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280741 conditions, 22270 events. 14453/22270 cut-off events. For 1249860/1249860 co-relation queries the response was YES. Maximal size of possible extension queue 1701. Compared 160325 event pairs, 1971 based on Foata normal form. 54/21420 useless extension candidates. Maximal degree in co-relation 280136. Up to 9726 conditions per place. [2025-04-14 01:13:50,456 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1568 selfloop transitions, 491 changer transitions 9/2068 dead transitions. [2025-04-14 01:13:50,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 2068 transitions, 64331 flow [2025-04-14 01:13:50,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:13:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:13:50,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-04-14 01:13:50,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2025-04-14 01:13:50,457 INFO L175 Difference]: Start difference. First operand has 548 places, 1687 transitions, 52692 flow. Second operand 8 states and 130 transitions. [2025-04-14 01:13:50,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 2068 transitions, 64331 flow [2025-04-14 01:14:01,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 2068 transitions, 64019 flow, removed 35 selfloop flow, removed 2 redundant places. [2025-04-14 01:14:01,473 INFO L231 Difference]: Finished difference. Result has 555 places, 1702 transitions, 53657 flow [2025-04-14 01:14:01,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51565, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=53657, PETRI_PLACES=555, PETRI_TRANSITIONS=1702} [2025-04-14 01:14:01,474 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 524 predicate places. [2025-04-14 01:14:01,474 INFO L485 AbstractCegarLoop]: Abstraction has has 555 places, 1702 transitions, 53657 flow [2025-04-14 01:14:01,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:01,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:01,475 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] [2025-04-14 01:14:01,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-14 01:14:01,475 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:01,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:01,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1837839167, now seen corresponding path program 6 times [2025-04-14 01:14:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:01,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344877094] [2025-04-14 01:14:01,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:14:01,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:01,482 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:01,484 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-14 01:14:01,484 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:14:01,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:01,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:01,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344877094] [2025-04-14 01:14:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344877094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:14:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:14:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:14:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836804614] [2025-04-14 01:14:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:14:01,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:14:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:01,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:14:01,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:14:01,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:01,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 1702 transitions, 53657 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:01,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:01,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:01,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:10,611 INFO L116 PetriNetUnfolderBase]: 13990/21534 cut-off events. [2025-04-14 01:14:10,611 INFO L117 PetriNetUnfolderBase]: For 1248368/1248368 co-relation queries the response was YES. [2025-04-14 01:14:10,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273998 conditions, 21534 events. 13990/21534 cut-off events. For 1248368/1248368 co-relation queries the response was YES. Maximal size of possible extension queue 1775. Compared 155423 event pairs, 2705 based on Foata normal form. 132/20780 useless extension candidates. Maximal degree in co-relation 273391. Up to 13689 conditions per place. [2025-04-14 01:14:11,045 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1494 selfloop transitions, 394 changer transitions 15/1903 dead transitions. [2025-04-14 01:14:11,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 1903 transitions, 60664 flow [2025-04-14 01:14:11,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:14:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:14:11,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-14 01:14:11,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-14 01:14:11,046 INFO L175 Difference]: Start difference. First operand has 555 places, 1702 transitions, 53657 flow. Second operand 5 states and 82 transitions. [2025-04-14 01:14:11,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 1903 transitions, 60664 flow [2025-04-14 01:14:21,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 1903 transitions, 60142 flow, removed 43 selfloop flow, removed 2 redundant places. [2025-04-14 01:14:21,402 INFO L231 Difference]: Finished difference. Result has 558 places, 1655 transitions, 51983 flow [2025-04-14 01:14:21,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51597, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=392, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=51983, PETRI_PLACES=558, PETRI_TRANSITIONS=1655} [2025-04-14 01:14:21,403 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 527 predicate places. [2025-04-14 01:14:21,403 INFO L485 AbstractCegarLoop]: Abstraction has has 558 places, 1655 transitions, 51983 flow [2025-04-14 01:14:21,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:21,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:21,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:14:21,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-14 01:14:21,404 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:21,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:21,404 INFO L85 PathProgramCache]: Analyzing trace with hash -211756611, now seen corresponding path program 4 times [2025-04-14 01:14:21,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:21,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062064930] [2025-04-14 01:14:21,404 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:14:21,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:21,408 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:21,409 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-14 01:14:21,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:14:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:21,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062064930] [2025-04-14 01:14:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062064930] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:21,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714635817] [2025-04-14 01:14:21,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:14:21,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:21,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:21,428 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:21,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-14 01:14:21,477 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:21,484 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-14 01:14:21,484 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:14:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:21,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:14:21,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:21,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:14:21,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714635817] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:21,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:14:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:14:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307651775] [2025-04-14 01:14:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:14:21,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:14:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:21,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:14:21,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:14:21,568 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:21,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 1655 transitions, 51983 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:21,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:21,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:30,949 INFO L116 PetriNetUnfolderBase]: 14364/22092 cut-off events. [2025-04-14 01:14:30,950 INFO L117 PetriNetUnfolderBase]: For 1273992/1273992 co-relation queries the response was YES. [2025-04-14 01:14:31,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281950 conditions, 22092 events. 14364/22092 cut-off events. For 1273992/1273992 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 158985 event pairs, 2167 based on Foata normal form. 368/21523 useless extension candidates. Maximal degree in co-relation 281369. Up to 8841 conditions per place. [2025-04-14 01:14:31,398 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2155 selfloop transitions, 289 changer transitions 39/2483 dead transitions. [2025-04-14 01:14:31,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 2483 transitions, 80354 flow [2025-04-14 01:14:31,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:14:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:14:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2025-04-14 01:14:31,399 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2025-04-14 01:14:31,399 INFO L175 Difference]: Start difference. First operand has 558 places, 1655 transitions, 51983 flow. Second operand 7 states and 101 transitions. [2025-04-14 01:14:31,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 2483 transitions, 80354 flow [2025-04-14 01:14:42,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 2483 transitions, 79676 flow, removed 86 selfloop flow, removed 7 redundant places. [2025-04-14 01:14:42,384 INFO L231 Difference]: Finished difference. Result has 561 places, 1740 transitions, 55022 flow [2025-04-14 01:14:42,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51455, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=55022, PETRI_PLACES=561, PETRI_TRANSITIONS=1740} [2025-04-14 01:14:42,385 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 530 predicate places. [2025-04-14 01:14:42,385 INFO L485 AbstractCegarLoop]: Abstraction has has 561 places, 1740 transitions, 55022 flow [2025-04-14 01:14:42,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:42,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:14:42,386 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:14:42,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-14 01:14:42,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:42,586 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:14:42,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:14:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash 685142083, now seen corresponding path program 5 times [2025-04-14 01:14:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:14:42,587 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835851671] [2025-04-14 01:14:42,587 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:14:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:14:42,592 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:42,596 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:42,596 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:14:42,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:14:42,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835851671] [2025-04-14 01:14:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835851671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:14:42,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212080132] [2025-04-14 01:14:42,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:14:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:14:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:14:42,629 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:14:42,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-14 01:14:42,678 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:14:42,692 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:14:42,692 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:14:42,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:14:42,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:14:42,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:14:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:14:42,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:14:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:14:42,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212080132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:14:42,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:14:42,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:14:42,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861449302] [2025-04-14 01:14:42,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:14:42,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:14:42,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:14:42,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:14:42,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:14:42,769 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:14:42,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1740 transitions, 55022 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:14:42,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:14:42,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:14:42,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:14:51,472 INFO L116 PetriNetUnfolderBase]: 12391/19108 cut-off events. [2025-04-14 01:14:51,472 INFO L117 PetriNetUnfolderBase]: For 1091887/1091887 co-relation queries the response was YES. [2025-04-14 01:14:51,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245010 conditions, 19108 events. 12391/19108 cut-off events. For 1091887/1091887 co-relation queries the response was YES. Maximal size of possible extension queue 1550. Compared 134390 event pairs, 3514 based on Foata normal form. 326/18846 useless extension candidates. Maximal degree in co-relation 244427. Up to 14249 conditions per place. [2025-04-14 01:14:51,814 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2070 selfloop transitions, 88 changer transitions 87/2245 dead transitions. [2025-04-14 01:14:51,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 2245 transitions, 74521 flow [2025-04-14 01:14:51,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:14:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:14:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2025-04-14 01:14:51,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-14 01:14:51,815 INFO L175 Difference]: Start difference. First operand has 561 places, 1740 transitions, 55022 flow. Second operand 7 states and 96 transitions. [2025-04-14 01:14:51,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 2245 transitions, 74521 flow [2025-04-14 01:15:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 2245 transitions, 74170 flow, removed 162 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:01,417 INFO L231 Difference]: Finished difference. Result has 567 places, 1754 transitions, 55365 flow [2025-04-14 01:15:01,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=53991, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=55365, PETRI_PLACES=567, PETRI_TRANSITIONS=1754} [2025-04-14 01:15:01,419 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 536 predicate places. [2025-04-14 01:15:01,419 INFO L485 AbstractCegarLoop]: Abstraction has has 567 places, 1754 transitions, 55365 flow [2025-04-14 01:15:01,419 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:01,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:01,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:15:01,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-14 01:15:01,619 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-14 01:15:01,620 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:01,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash -940045975, now seen corresponding path program 7 times [2025-04-14 01:15:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:01,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250511356] [2025-04-14 01:15:01,621 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:15:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:15:01,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:15:01,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:15:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:01,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250511356] [2025-04-14 01:15:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250511356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369333423] [2025-04-14 01:15:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:01,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:01,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:01,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:01,654 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:01,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 1754 transitions, 55365 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:01,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:01,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:09,812 INFO L116 PetriNetUnfolderBase]: 11886/18061 cut-off events. [2025-04-14 01:15:09,813 INFO L117 PetriNetUnfolderBase]: For 1027853/1027853 co-relation queries the response was YES. [2025-04-14 01:15:10,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234580 conditions, 18061 events. 11886/18061 cut-off events. For 1027853/1027853 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 122771 event pairs, 1472 based on Foata normal form. 90/17569 useless extension candidates. Maximal degree in co-relation 233989. Up to 7754 conditions per place. [2025-04-14 01:15:10,159 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1851 selfloop transitions, 297 changer transitions 5/2153 dead transitions. [2025-04-14 01:15:10,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 2153 transitions, 70575 flow [2025-04-14 01:15:10,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:15:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:15:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-04-14 01:15:10,160 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-04-14 01:15:10,160 INFO L175 Difference]: Start difference. First operand has 567 places, 1754 transitions, 55365 flow. Second operand 8 states and 121 transitions. [2025-04-14 01:15:10,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 2153 transitions, 70575 flow [2025-04-14 01:15:18,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 2153 transitions, 70224 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-04-14 01:15:18,918 INFO L231 Difference]: Finished difference. Result has 570 places, 1766 transitions, 56422 flow [2025-04-14 01:15:18,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54704, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1742, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=56422, PETRI_PLACES=570, PETRI_TRANSITIONS=1766} [2025-04-14 01:15:18,919 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 539 predicate places. [2025-04-14 01:15:18,919 INFO L485 AbstractCegarLoop]: Abstraction has has 570 places, 1766 transitions, 56422 flow [2025-04-14 01:15:18,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:18,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:18,919 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] [2025-04-14 01:15:18,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-14 01:15:18,920 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:18,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1066916169, now seen corresponding path program 8 times [2025-04-14 01:15:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:18,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376421532] [2025-04-14 01:15:18,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:15:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:18,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:18,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-14 01:15:18,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:15:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:18,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:18,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:18,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376421532] [2025-04-14 01:15:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376421532] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:18,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:18,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:18,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941532302] [2025-04-14 01:15:18,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:18,953 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:18,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:18,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:18,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:18,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 1766 transitions, 56422 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:18,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:18,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:18,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:27,097 INFO L116 PetriNetUnfolderBase]: 11468/17393 cut-off events. [2025-04-14 01:15:27,097 INFO L117 PetriNetUnfolderBase]: For 1032150/1032150 co-relation queries the response was YES. [2025-04-14 01:15:27,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227805 conditions, 17393 events. 11468/17393 cut-off events. For 1032150/1032150 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 116940 event pairs, 1589 based on Foata normal form. 118/16947 useless extension candidates. Maximal degree in co-relation 227228. Up to 10624 conditions per place. [2025-04-14 01:15:27,425 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1619 selfloop transitions, 232 changer transitions 20/1871 dead transitions. [2025-04-14 01:15:27,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 1871 transitions, 61719 flow [2025-04-14 01:15:27,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:15:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:15:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-14 01:15:27,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-14 01:15:27,426 INFO L175 Difference]: Start difference. First operand has 570 places, 1766 transitions, 56422 flow. Second operand 5 states and 82 transitions. [2025-04-14 01:15:27,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 1871 transitions, 61719 flow [2025-04-14 01:15:35,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 1871 transitions, 61109 flow, removed 51 selfloop flow, removed 5 redundant places. [2025-04-14 01:15:35,360 INFO L231 Difference]: Finished difference. Result has 568 places, 1710 transitions, 54008 flow [2025-04-14 01:15:35,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54139, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54008, PETRI_PLACES=568, PETRI_TRANSITIONS=1710} [2025-04-14 01:15:35,362 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 537 predicate places. [2025-04-14 01:15:35,362 INFO L485 AbstractCegarLoop]: Abstraction has has 568 places, 1710 transitions, 54008 flow [2025-04-14 01:15:35,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:35,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:35,362 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] [2025-04-14 01:15:35,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-14 01:15:35,363 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:35,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash -870908069, now seen corresponding path program 9 times [2025-04-14 01:15:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:35,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314030671] [2025-04-14 01:15:35,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:15:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:35,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:35,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-14 01:15:35,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:15:35,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:35,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:35,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314030671] [2025-04-14 01:15:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314030671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:35,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604460697] [2025-04-14 01:15:35,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:35,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:35,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:35,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:35,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 1710 transitions, 54008 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:35,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:35,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:35,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:42,922 INFO L116 PetriNetUnfolderBase]: 11904/17939 cut-off events. [2025-04-14 01:15:42,923 INFO L117 PetriNetUnfolderBase]: For 1046181/1046181 co-relation queries the response was YES. [2025-04-14 01:15:43,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231278 conditions, 17939 events. 11904/17939 cut-off events. For 1046181/1046181 co-relation queries the response was YES. Maximal size of possible extension queue 1423. Compared 120043 event pairs, 1570 based on Foata normal form. 116/17416 useless extension candidates. Maximal degree in co-relation 230718. Up to 10176 conditions per place. [2025-04-14 01:15:43,239 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1776 selfloop transitions, 136 changer transitions 29/1941 dead transitions. [2025-04-14 01:15:43,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 1941 transitions, 62186 flow [2025-04-14 01:15:43,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:15:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:15:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-14 01:15:43,240 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51875 [2025-04-14 01:15:43,240 INFO L175 Difference]: Start difference. First operand has 568 places, 1710 transitions, 54008 flow. Second operand 5 states and 83 transitions. [2025-04-14 01:15:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 1941 transitions, 62186 flow [2025-04-14 01:15:50,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 1941 transitions, 61727 flow, removed 78 selfloop flow, removed 2 redundant places. [2025-04-14 01:15:50,754 INFO L231 Difference]: Finished difference. Result has 572 places, 1675 transitions, 52746 flow [2025-04-14 01:15:50,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52701, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=52746, PETRI_PLACES=572, PETRI_TRANSITIONS=1675} [2025-04-14 01:15:50,755 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 541 predicate places. [2025-04-14 01:15:50,755 INFO L485 AbstractCegarLoop]: Abstraction has has 572 places, 1675 transitions, 52746 flow [2025-04-14 01:15:50,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:50,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:15:50,755 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] [2025-04-14 01:15:50,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-14 01:15:50,755 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:15:50,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:15:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1345952063, now seen corresponding path program 10 times [2025-04-14 01:15:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:15:50,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431417542] [2025-04-14 01:15:50,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:15:50,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:15:50,760 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:15:50,761 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-14 01:15:50,761 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:15:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:15:50,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:15:50,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:15:50,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431417542] [2025-04-14 01:15:50,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431417542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:15:50,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:15:50,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:15:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816346275] [2025-04-14 01:15:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:15:50,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:15:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:15:50,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:15:50,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:15:50,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:15:50,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1675 transitions, 52746 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:15:50,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:15:50,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:15:50,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:15:57,774 INFO L116 PetriNetUnfolderBase]: 11238/16884 cut-off events. [2025-04-14 01:15:57,775 INFO L117 PetriNetUnfolderBase]: For 1007857/1007857 co-relation queries the response was YES. [2025-04-14 01:15:58,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218104 conditions, 16884 events. 11238/16884 cut-off events. For 1007857/1007857 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 111481 event pairs, 1466 based on Foata normal form. 122/16394 useless extension candidates. Maximal degree in co-relation 217546. Up to 7159 conditions per place. [2025-04-14 01:15:58,080 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1838 selfloop transitions, 136 changer transitions 25/1999 dead transitions. [2025-04-14 01:15:58,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 1999 transitions, 63848 flow [2025-04-14 01:15:58,080 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:15:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:15:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-14 01:15:58,081 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.50625 [2025-04-14 01:15:58,081 INFO L175 Difference]: Start difference. First operand has 572 places, 1675 transitions, 52746 flow. Second operand 5 states and 81 transitions. [2025-04-14 01:15:58,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 1999 transitions, 63848 flow [2025-04-14 01:16:04,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 1999 transitions, 63588 flow, removed 62 selfloop flow, removed 3 redundant places. [2025-04-14 01:16:04,564 INFO L231 Difference]: Finished difference. Result has 575 places, 1639 transitions, 51572 flow [2025-04-14 01:16:04,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51716, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=51572, PETRI_PLACES=575, PETRI_TRANSITIONS=1639} [2025-04-14 01:16:04,565 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 544 predicate places. [2025-04-14 01:16:04,565 INFO L485 AbstractCegarLoop]: Abstraction has has 575 places, 1639 transitions, 51572 flow [2025-04-14 01:16:04,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:04,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:04,565 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] [2025-04-14 01:16:04,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-14 01:16:04,566 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:04,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash 843489139, now seen corresponding path program 11 times [2025-04-14 01:16:04,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:04,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141188643] [2025-04-14 01:16:04,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:04,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:04,571 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:16:04,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:16:04,574 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:16:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:04,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141188643] [2025-04-14 01:16:04,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141188643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:04,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025250911] [2025-04-14 01:16:04,599 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:16:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:04,601 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:16:04,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-14 01:16:04,651 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-14 01:16:04,664 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:16:04,664 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:16:04,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:04,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:16:04,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:04,686 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:04,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025250911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:16:04,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:16:04,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 01:16:04,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138889066] [2025-04-14 01:16:04,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:16:04,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:16:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:04,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:16:04,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:16:04,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:04,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 1639 transitions, 51572 flow. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:04,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:04,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:04,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:10,856 INFO L116 PetriNetUnfolderBase]: 10735/16052 cut-off events. [2025-04-14 01:16:10,856 INFO L117 PetriNetUnfolderBase]: For 961030/961030 co-relation queries the response was YES. [2025-04-14 01:16:11,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206575 conditions, 16052 events. 10735/16052 cut-off events. For 961030/961030 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 103919 event pairs, 2846 based on Foata normal form. 55/15495 useless extension candidates. Maximal degree in co-relation 206016. Up to 12721 conditions per place. [2025-04-14 01:16:11,185 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1558 selfloop transitions, 50 changer transitions 28/1636 dead transitions. [2025-04-14 01:16:11,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 1636 transitions, 53578 flow [2025-04-14 01:16:11,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:16:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:16:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-04-14 01:16:11,188 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2025-04-14 01:16:11,188 INFO L175 Difference]: Start difference. First operand has 575 places, 1639 transitions, 51572 flow. Second operand 7 states and 81 transitions. [2025-04-14 01:16:11,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 1636 transitions, 53578 flow [2025-04-14 01:16:17,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 1636 transitions, 53243 flow, removed 145 selfloop flow, removed 2 redundant places. [2025-04-14 01:16:17,997 INFO L231 Difference]: Finished difference. Result has 578 places, 1583 transitions, 48925 flow [2025-04-14 01:16:17,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=48925, PETRI_PLACES=578, PETRI_TRANSITIONS=1583} [2025-04-14 01:16:17,999 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 547 predicate places. [2025-04-14 01:16:17,999 INFO L485 AbstractCegarLoop]: Abstraction has has 578 places, 1583 transitions, 48925 flow [2025-04-14 01:16:17,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:17,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:17,999 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:18,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-14 01:16:18,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:18,200 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:18,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:18,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1890997377, now seen corresponding path program 2 times [2025-04-14 01:16:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:18,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512842151] [2025-04-14 01:16:18,201 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:16:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:18,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:18,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:16:18,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:16:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:16:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:18,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512842151] [2025-04-14 01:16:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512842151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:16:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:16:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:16:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408321120] [2025-04-14 01:16:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:18,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:16:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:18,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:16:18,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:16:18,234 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:18,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 1583 transitions, 48925 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:18,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:18,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:18,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:24,716 INFO L116 PetriNetUnfolderBase]: 11288/16766 cut-off events. [2025-04-14 01:16:24,717 INFO L117 PetriNetUnfolderBase]: For 928043/928043 co-relation queries the response was YES. [2025-04-14 01:16:24,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212551 conditions, 16766 events. 11288/16766 cut-off events. For 928043/928043 co-relation queries the response was YES. Maximal size of possible extension queue 1333. Compared 108102 event pairs, 1048 based on Foata normal form. 0/16073 useless extension candidates. Maximal degree in co-relation 212275. Up to 5861 conditions per place. [2025-04-14 01:16:25,154 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1619 selfloop transitions, 389 changer transitions 2/2010 dead transitions. [2025-04-14 01:16:25,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 2010 transitions, 63626 flow [2025-04-14 01:16:25,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:16:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:16:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-04-14 01:16:25,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:16:25,155 INFO L175 Difference]: Start difference. First operand has 578 places, 1583 transitions, 48925 flow. Second operand 9 states and 144 transitions. [2025-04-14 01:16:25,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 2010 transitions, 63626 flow [2025-04-14 01:16:30,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 2010 transitions, 63324 flow, removed 79 selfloop flow, removed 10 redundant places. [2025-04-14 01:16:31,010 INFO L231 Difference]: Finished difference. Result has 574 places, 1608 transitions, 50606 flow [2025-04-14 01:16:31,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=48667, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=50606, PETRI_PLACES=574, PETRI_TRANSITIONS=1608} [2025-04-14 01:16:31,011 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 543 predicate places. [2025-04-14 01:16:31,011 INFO L485 AbstractCegarLoop]: Abstraction has has 574 places, 1608 transitions, 50606 flow [2025-04-14 01:16:31,011 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:31,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:31,012 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:31,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-14 01:16:31,012 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:31,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 720174327, now seen corresponding path program 3 times [2025-04-14 01:16:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:31,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918104212] [2025-04-14 01:16:31,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:16:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:31,018 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:31,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:31,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:16:31,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:16:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:31,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918104212] [2025-04-14 01:16:31,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918104212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:31,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586572016] [2025-04-14 01:16:31,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:16:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:31,045 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:16:31,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-14 01:16:31,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:16:31,109 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:31,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:16:31,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:31,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:16:31,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:31,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:31,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:16:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586572016] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:31,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:16:31,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:16:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767278252] [2025-04-14 01:16:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:31,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:16:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:31,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:16:31,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:16:31,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:31,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 1608 transitions, 50606 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:31,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:31,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:31,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:38,136 INFO L116 PetriNetUnfolderBase]: 12061/17857 cut-off events. [2025-04-14 01:16:38,136 INFO L117 PetriNetUnfolderBase]: For 1047590/1047590 co-relation queries the response was YES. [2025-04-14 01:16:38,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230887 conditions, 17857 events. 12061/17857 cut-off events. For 1047590/1047590 co-relation queries the response was YES. Maximal size of possible extension queue 1387. Compared 115209 event pairs, 816 based on Foata normal form. 78/17138 useless extension candidates. Maximal degree in co-relation 230618. Up to 7658 conditions per place. [2025-04-14 01:16:38,711 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1711 selfloop transitions, 147 changer transitions 9/1867 dead transitions. [2025-04-14 01:16:38,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 1867 transitions, 60034 flow [2025-04-14 01:16:38,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:16:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:16:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-04-14 01:16:38,711 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:16:38,711 INFO L175 Difference]: Start difference. First operand has 574 places, 1608 transitions, 50606 flow. Second operand 8 states and 96 transitions. [2025-04-14 01:16:38,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 1867 transitions, 60034 flow [2025-04-14 01:16:45,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 1867 transitions, 59060 flow, removed 63 selfloop flow, removed 5 redundant places. [2025-04-14 01:16:45,776 INFO L231 Difference]: Finished difference. Result has 579 places, 1638 transitions, 50846 flow [2025-04-14 01:16:45,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49812, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=50846, PETRI_PLACES=579, PETRI_TRANSITIONS=1638} [2025-04-14 01:16:45,777 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 548 predicate places. [2025-04-14 01:16:45,777 INFO L485 AbstractCegarLoop]: Abstraction has has 579 places, 1638 transitions, 50846 flow [2025-04-14 01:16:45,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:45,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:16:45,777 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:16:45,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-14 01:16:45,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:45,978 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:16:45,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:16:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1498812807, now seen corresponding path program 1 times [2025-04-14 01:16:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:16:45,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798399672] [2025-04-14 01:16:45,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:16:45,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:16:45,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:45,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:45,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:16:46,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798399672] [2025-04-14 01:16:46,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798399672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:46,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843514485] [2025-04-14 01:16:46,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:16:46,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:16:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:16:46,023 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:16:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-14 01:16:46,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:16:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:16:46,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:16:46,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:16:46,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:16:46,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:16:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:46,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:16:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:16:46,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843514485] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:16:46,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:16:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:16:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728686423] [2025-04-14 01:16:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:16:46,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:16:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:16:46,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:16:46,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:16:46,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:16:46,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 1638 transitions, 50846 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:16:46,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:16:46,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:16:46,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:16:53,155 INFO L116 PetriNetUnfolderBase]: 11993/17718 cut-off events. [2025-04-14 01:16:53,155 INFO L117 PetriNetUnfolderBase]: For 1076332/1076332 co-relation queries the response was YES. [2025-04-14 01:16:53,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231566 conditions, 17718 events. 11993/17718 cut-off events. For 1076332/1076332 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 113548 event pairs, 3159 based on Foata normal form. 78/17796 useless extension candidates. Maximal degree in co-relation 231294. Up to 14633 conditions per place. [2025-04-14 01:16:53,462 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1614 selfloop transitions, 69 changer transitions 0/1683 dead transitions. [2025-04-14 01:16:53,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1683 transitions, 54976 flow [2025-04-14 01:16:53,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:16:53,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:16:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-14 01:16:53,463 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2025-04-14 01:16:53,463 INFO L175 Difference]: Start difference. First operand has 579 places, 1638 transitions, 50846 flow. Second operand 7 states and 75 transitions. [2025-04-14 01:16:53,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 1683 transitions, 54976 flow [2025-04-14 01:17:00,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 1683 transitions, 54940 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-14 01:17:00,395 INFO L231 Difference]: Finished difference. Result has 582 places, 1634 transitions, 50846 flow [2025-04-14 01:17:00,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50638, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=50846, PETRI_PLACES=582, PETRI_TRANSITIONS=1634} [2025-04-14 01:17:00,396 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 551 predicate places. [2025-04-14 01:17:00,396 INFO L485 AbstractCegarLoop]: Abstraction has has 582 places, 1634 transitions, 50846 flow [2025-04-14 01:17:00,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:00,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:00,396 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:00,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:17:00,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:00,597 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:00,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2096767821, now seen corresponding path program 4 times [2025-04-14 01:17:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:00,598 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337475437] [2025-04-14 01:17:00,598 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:17:00,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:00,603 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:00,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-14 01:17:00,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:17:00,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:17:00,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:00,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337475437] [2025-04-14 01:17:00,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337475437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:00,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:00,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:17:00,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140931507] [2025-04-14 01:17:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:00,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:17:00,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:00,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:17:00,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:17:00,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:00,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 1634 transitions, 50846 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:00,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:00,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:00,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:07,664 INFO L116 PetriNetUnfolderBase]: 12099/17912 cut-off events. [2025-04-14 01:17:07,664 INFO L117 PetriNetUnfolderBase]: For 1090959/1090959 co-relation queries the response was YES. [2025-04-14 01:17:07,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235586 conditions, 17912 events. 12099/17912 cut-off events. For 1090959/1090959 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 115277 event pairs, 1136 based on Foata normal form. 16/17928 useless extension candidates. Maximal degree in co-relation 235313. Up to 6360 conditions per place. [2025-04-14 01:17:07,985 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1685 selfloop transitions, 377 changer transitions 3/2065 dead transitions. [2025-04-14 01:17:07,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 2065 transitions, 65806 flow [2025-04-14 01:17:07,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:17:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:17:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 135 transitions. [2025-04-14 01:17:07,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46875 [2025-04-14 01:17:07,986 INFO L175 Difference]: Start difference. First operand has 582 places, 1634 transitions, 50846 flow. Second operand 9 states and 135 transitions. [2025-04-14 01:17:07,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 2065 transitions, 65806 flow [2025-04-14 01:17:15,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 585 places, 2065 transitions, 65620 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-14 01:17:15,493 INFO L231 Difference]: Finished difference. Result has 589 places, 1650 transitions, 52016 flow [2025-04-14 01:17:15,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50686, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=362, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=52016, PETRI_PLACES=589, PETRI_TRANSITIONS=1650} [2025-04-14 01:17:15,493 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 558 predicate places. [2025-04-14 01:17:15,494 INFO L485 AbstractCegarLoop]: Abstraction has has 589 places, 1650 transitions, 52016 flow [2025-04-14 01:17:15,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:15,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:15,494 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:15,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-14 01:17:15,494 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:15,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2115297393, now seen corresponding path program 2 times [2025-04-14 01:17:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:15,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154634319] [2025-04-14 01:17:15,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:15,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:15,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:15,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:15,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:17:15,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:15,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154634319] [2025-04-14 01:17:15,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154634319] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:15,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448092054] [2025-04-14 01:17:15,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:15,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:15,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:15,525 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-14 01:17:15,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:15,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:15,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:15,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:15,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:17:15,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:17:15,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:15,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:17:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448092054] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:15,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:17:15,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:17:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63190314] [2025-04-14 01:17:15,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:15,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:17:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:15,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:17:15,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:17:15,665 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:15,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 1650 transitions, 52016 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:15,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:15,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:15,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:23,873 INFO L116 PetriNetUnfolderBase]: 14087/20592 cut-off events. [2025-04-14 01:17:23,873 INFO L117 PetriNetUnfolderBase]: For 1324655/1324655 co-relation queries the response was YES. [2025-04-14 01:17:24,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272349 conditions, 20592 events. 14087/20592 cut-off events. For 1324655/1324655 co-relation queries the response was YES. Maximal size of possible extension queue 1427. Compared 131222 event pairs, 1797 based on Foata normal form. 198/20790 useless extension candidates. Maximal degree in co-relation 272076. Up to 12150 conditions per place. [2025-04-14 01:17:24,255 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1842 selfloop transitions, 230 changer transitions 1/2073 dead transitions. [2025-04-14 01:17:24,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 2073 transitions, 67937 flow [2025-04-14 01:17:24,256 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:17:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:17:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-04-14 01:17:24,256 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-14 01:17:24,256 INFO L175 Difference]: Start difference. First operand has 589 places, 1650 transitions, 52016 flow. Second operand 7 states and 83 transitions. [2025-04-14 01:17:24,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 2073 transitions, 67937 flow [2025-04-14 01:17:33,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 2073 transitions, 67524 flow, removed 23 selfloop flow, removed 1 redundant places. [2025-04-14 01:17:33,446 INFO L231 Difference]: Finished difference. Result has 597 places, 1727 transitions, 55989 flow [2025-04-14 01:17:33,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=51507, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=55989, PETRI_PLACES=597, PETRI_TRANSITIONS=1727} [2025-04-14 01:17:33,447 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 566 predicate places. [2025-04-14 01:17:33,448 INFO L485 AbstractCegarLoop]: Abstraction has has 597 places, 1727 transitions, 55989 flow [2025-04-14 01:17:33,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:33,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:33,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:33,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-14 01:17:33,648 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:33,648 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:33,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:33,649 INFO L85 PathProgramCache]: Analyzing trace with hash 371337235, now seen corresponding path program 2 times [2025-04-14 01:17:33,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:33,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110482308] [2025-04-14 01:17:33,649 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:17:33,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:33,654 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:33,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:33,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:17:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:17:33,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:33,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110482308] [2025-04-14 01:17:33,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110482308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:17:33,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:17:33,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:17:33,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193601048] [2025-04-14 01:17:33,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:33,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:17:33,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:33,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:17:33,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:17:33,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:33,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 1727 transitions, 55989 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:33,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:33,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:33,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:17:42,149 INFO L116 PetriNetUnfolderBase]: 13963/20416 cut-off events. [2025-04-14 01:17:42,149 INFO L117 PetriNetUnfolderBase]: For 1350824/1350824 co-relation queries the response was YES. [2025-04-14 01:17:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275535 conditions, 20416 events. 13963/20416 cut-off events. For 1350824/1350824 co-relation queries the response was YES. Maximal size of possible extension queue 1418. Compared 130057 event pairs, 2044 based on Foata normal form. 41/20457 useless extension candidates. Maximal degree in co-relation 275255. Up to 9024 conditions per place. [2025-04-14 01:17:42,590 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1591 selfloop transitions, 373 changer transitions 20/1984 dead transitions. [2025-04-14 01:17:42,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 1984 transitions, 65936 flow [2025-04-14 01:17:42,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:17:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:17:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-04-14 01:17:42,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-04-14 01:17:42,591 INFO L175 Difference]: Start difference. First operand has 597 places, 1727 transitions, 55989 flow. Second operand 7 states and 110 transitions. [2025-04-14 01:17:42,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 1984 transitions, 65936 flow [2025-04-14 01:17:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 1984 transitions, 65858 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-04-14 01:17:51,693 INFO L231 Difference]: Finished difference. Result has 600 places, 1718 transitions, 56292 flow [2025-04-14 01:17:51,694 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55929, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=56292, PETRI_PLACES=600, PETRI_TRANSITIONS=1718} [2025-04-14 01:17:51,694 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 569 predicate places. [2025-04-14 01:17:51,694 INFO L485 AbstractCegarLoop]: Abstraction has has 600 places, 1718 transitions, 56292 flow [2025-04-14 01:17:51,694 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:51,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:17:51,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:17:51,695 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-14 01:17:51,695 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:17:51,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:17:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash -939606517, now seen corresponding path program 3 times [2025-04-14 01:17:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:17:51,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162937662] [2025-04-14 01:17:51,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:17:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:17:51,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:51,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:51,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:17:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:17:51,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:17:51,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162937662] [2025-04-14 01:17:51,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162937662] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:51,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113659984] [2025-04-14 01:17:51,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:17:51,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:17:51,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:17:51,728 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:17:51,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-14 01:17:51,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:17:51,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:17:51,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:17:51,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:17:51,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:17:51,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:17:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:51,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:17:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:17:51,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113659984] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:17:51,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:17:51,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:17:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804308009] [2025-04-14 01:17:51,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:17:51,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:17:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:17:51,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:17:51,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:17:51,872 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:17:51,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 1718 transitions, 56292 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:17:51,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:17:51,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:17:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:00,411 INFO L116 PetriNetUnfolderBase]: 13799/20070 cut-off events. [2025-04-14 01:18:00,412 INFO L117 PetriNetUnfolderBase]: For 1357781/1357781 co-relation queries the response was YES. [2025-04-14 01:18:00,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273999 conditions, 20070 events. 13799/20070 cut-off events. For 1357781/1357781 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 125356 event pairs, 1680 based on Foata normal form. 60/20130 useless extension candidates. Maximal degree in co-relation 273719. Up to 16944 conditions per place. [2025-04-14 01:18:00,931 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1695 selfloop transitions, 127 changer transitions 0/1822 dead transitions. [2025-04-14 01:18:00,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 1822 transitions, 62888 flow [2025-04-14 01:18:00,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:18:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:18:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-14 01:18:00,932 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-14 01:18:00,932 INFO L175 Difference]: Start difference. First operand has 600 places, 1718 transitions, 56292 flow. Second operand 7 states and 80 transitions. [2025-04-14 01:18:00,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 1822 transitions, 62888 flow [2025-04-14 01:18:10,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 1822 transitions, 61714 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-04-14 01:18:10,248 INFO L231 Difference]: Finished difference. Result has 597 places, 1731 transitions, 56748 flow [2025-04-14 01:18:10,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54900, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=56748, PETRI_PLACES=597, PETRI_TRANSITIONS=1731} [2025-04-14 01:18:10,250 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 566 predicate places. [2025-04-14 01:18:10,250 INFO L485 AbstractCegarLoop]: Abstraction has has 597 places, 1731 transitions, 56748 flow [2025-04-14 01:18:10,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:10,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:10,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:10,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-14 01:18:10,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-14 01:18:10,451 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:10,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash -882351127, now seen corresponding path program 3 times [2025-04-14 01:18:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:10,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961750323] [2025-04-14 01:18:10,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:10,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:10,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:10,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:10,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:18:10,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:18:10,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:10,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961750323] [2025-04-14 01:18:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961750323] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:10,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:10,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:18:10,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322601597] [2025-04-14 01:18:10,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:10,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:18:10,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:10,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:18:10,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:18:10,487 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:10,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 1731 transitions, 56748 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:10,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:10,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:10,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:19,508 INFO L116 PetriNetUnfolderBase]: 13735/20012 cut-off events. [2025-04-14 01:18:19,508 INFO L117 PetriNetUnfolderBase]: For 1320592/1320592 co-relation queries the response was YES. [2025-04-14 01:18:19,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271420 conditions, 20012 events. 13735/20012 cut-off events. For 1320592/1320592 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 126101 event pairs, 2434 based on Foata normal form. 71/20083 useless extension candidates. Maximal degree in co-relation 271144. Up to 12064 conditions per place. [2025-04-14 01:18:19,947 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1625 selfloop transitions, 396 changer transitions 26/2047 dead transitions. [2025-04-14 01:18:19,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 2047 transitions, 68768 flow [2025-04-14 01:18:19,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:18:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:18:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-14 01:18:19,948 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-04-14 01:18:19,948 INFO L175 Difference]: Start difference. First operand has 597 places, 1731 transitions, 56748 flow. Second operand 6 states and 88 transitions. [2025-04-14 01:18:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 2047 transitions, 68768 flow [2025-04-14 01:18:30,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 2047 transitions, 68685 flow, removed 39 selfloop flow, removed 3 redundant places. [2025-04-14 01:18:30,057 INFO L231 Difference]: Finished difference. Result has 601 places, 1753 transitions, 58090 flow [2025-04-14 01:18:30,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56693, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=360, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=58090, PETRI_PLACES=601, PETRI_TRANSITIONS=1753} [2025-04-14 01:18:30,058 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 570 predicate places. [2025-04-14 01:18:30,058 INFO L485 AbstractCegarLoop]: Abstraction has has 601 places, 1753 transitions, 58090 flow [2025-04-14 01:18:30,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:30,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:30,059 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:30,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-14 01:18:30,059 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:30,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:30,059 INFO L85 PathProgramCache]: Analyzing trace with hash -2139483497, now seen corresponding path program 5 times [2025-04-14 01:18:30,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:30,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685022276] [2025-04-14 01:18:30,060 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:30,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:30,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:30,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:30,067 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:30,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:18:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:30,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685022276] [2025-04-14 01:18:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685022276] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:30,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957577046] [2025-04-14 01:18:30,092 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:30,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:30,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:30,094 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:18:30,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:18:30,148 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:30,162 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:30,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:30,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:18:30,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:18:30,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:18:30,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957577046] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:30,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:18:30,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 9 [2025-04-14 01:18:30,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008910592] [2025-04-14 01:18:30,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:30,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:18:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:30,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:18:30,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:18:30,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:30,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 1753 transitions, 58090 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:30,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:30,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:38,779 INFO L116 PetriNetUnfolderBase]: 13828/20208 cut-off events. [2025-04-14 01:18:38,779 INFO L117 PetriNetUnfolderBase]: For 1316011/1316011 co-relation queries the response was YES. [2025-04-14 01:18:39,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275117 conditions, 20208 events. 13828/20208 cut-off events. For 1316011/1316011 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 128162 event pairs, 1576 based on Foata normal form. 9/20217 useless extension candidates. Maximal degree in co-relation 274840. Up to 13595 conditions per place. [2025-04-14 01:18:39,405 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1939 selfloop transitions, 175 changer transitions 1/2115 dead transitions. [2025-04-14 01:18:39,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 2115 transitions, 71797 flow [2025-04-14 01:18:39,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2025-04-14 01:18:39,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2025-04-14 01:18:39,406 INFO L175 Difference]: Start difference. First operand has 601 places, 1753 transitions, 58090 flow. Second operand 8 states and 103 transitions. [2025-04-14 01:18:39,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 2115 transitions, 71797 flow [2025-04-14 01:18:48,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 2115 transitions, 71140 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:48,245 INFO L231 Difference]: Finished difference. Result has 606 places, 1763 transitions, 58156 flow [2025-04-14 01:18:48,246 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=57469, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=58156, PETRI_PLACES=606, PETRI_TRANSITIONS=1763} [2025-04-14 01:18:48,246 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 575 predicate places. [2025-04-14 01:18:48,246 INFO L485 AbstractCegarLoop]: Abstraction has has 606 places, 1763 transitions, 58156 flow [2025-04-14 01:18:48,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:48,247 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:48,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:18:48,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:48,447 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:18:48,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1754803301, now seen corresponding path program 6 times [2025-04-14 01:18:48,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:48,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280788883] [2025-04-14 01:18:48,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:48,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:48,453 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:48,455 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:18:48,455 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:48,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:48,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:18:48,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:48,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280788883] [2025-04-14 01:18:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280788883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:48,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:18:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492222322] [2025-04-14 01:18:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:48,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:18:48,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:48,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:18:48,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:18:48,477 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:48,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 1763 transitions, 58156 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:48,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:48,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:58,397 INFO L116 PetriNetUnfolderBase]: 15630/22640 cut-off events. [2025-04-14 01:18:58,397 INFO L117 PetriNetUnfolderBase]: For 1444118/1444118 co-relation queries the response was YES. [2025-04-14 01:18:58,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303462 conditions, 22640 events. 15630/22640 cut-off events. For 1444118/1444118 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 143263 event pairs, 1524 based on Foata normal form. 20/22660 useless extension candidates. Maximal degree in co-relation 303186. Up to 11564 conditions per place. [2025-04-14 01:18:58,969 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1790 selfloop transitions, 404 changer transitions 5/2199 dead transitions. [2025-04-14 01:18:58,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 2199 transitions, 73949 flow [2025-04-14 01:18:58,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:58,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2025-04-14 01:18:58,970 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4609375 [2025-04-14 01:18:58,970 INFO L175 Difference]: Start difference. First operand has 606 places, 1763 transitions, 58156 flow. Second operand 8 states and 118 transitions. [2025-04-14 01:18:58,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 2199 transitions, 73949 flow [2025-04-14 01:19:09,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 2199 transitions, 73787 flow, removed 19 selfloop flow, removed 1 redundant places. [2025-04-14 01:19:09,533 INFO L231 Difference]: Finished difference. Result has 617 places, 1840 transitions, 61351 flow [2025-04-14 01:19:09,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58016, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=332, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=61351, PETRI_PLACES=617, PETRI_TRANSITIONS=1840} [2025-04-14 01:19:09,534 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 586 predicate places. [2025-04-14 01:19:09,534 INFO L485 AbstractCegarLoop]: Abstraction has has 617 places, 1840 transitions, 61351 flow [2025-04-14 01:19:09,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:09,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:09,534 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:09,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-14 01:19:09,534 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:09,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash -265058849, now seen corresponding path program 7 times [2025-04-14 01:19:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:09,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687829878] [2025-04-14 01:19:09,535 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:09,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:19:09,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:19:09,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:09,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:09,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687829878] [2025-04-14 01:19:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687829878] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:09,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875373112] [2025-04-14 01:19:09,582 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:09,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:09,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:09,584 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:09,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:19:09,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:19:09,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:19:09,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:09,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:09,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:19:09,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:09,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875373112] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:09,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:09,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:19:09,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864711548] [2025-04-14 01:19:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:09,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:19:09,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:09,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:19:09,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:19:09,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:09,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 1840 transitions, 61351 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-14 01:19:09,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:09,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:09,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:21,443 INFO L116 PetriNetUnfolderBase]: 16758/24172 cut-off events. [2025-04-14 01:19:21,443 INFO L117 PetriNetUnfolderBase]: For 1651289/1651289 co-relation queries the response was YES. [2025-04-14 01:19:22,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330053 conditions, 24172 events. 16758/24172 cut-off events. For 1651289/1651289 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 152476 event pairs, 3098 based on Foata normal form. 98/24270 useless extension candidates. Maximal degree in co-relation 329772. Up to 13346 conditions per place. [2025-04-14 01:19:22,287 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1729 selfloop transitions, 254 changer transitions 2/1985 dead transitions. [2025-04-14 01:19:22,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 1985 transitions, 69465 flow [2025-04-14 01:19:22,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:19:22,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:19:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-14 01:19:22,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2025-04-14 01:19:22,288 INFO L175 Difference]: Start difference. First operand has 617 places, 1840 transitions, 61351 flow. Second operand 7 states and 75 transitions. [2025-04-14 01:19:22,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 1985 transitions, 69465 flow [2025-04-14 01:19:34,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 1985 transitions, 69217 flow, removed 124 selfloop flow, removed 0 redundant places. [2025-04-14 01:19:35,002 INFO L231 Difference]: Finished difference. Result has 624 places, 1868 transitions, 62586 flow [2025-04-14 01:19:35,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61137, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=62586, PETRI_PLACES=624, PETRI_TRANSITIONS=1868} [2025-04-14 01:19:35,004 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 593 predicate places. [2025-04-14 01:19:35,004 INFO L485 AbstractCegarLoop]: Abstraction has has 624 places, 1868 transitions, 62586 flow [2025-04-14 01:19:35,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-14 01:19:35,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:35,004 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:35,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 01:19:35,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:35,204 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:35,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:35,205 INFO L85 PathProgramCache]: Analyzing trace with hash 891118153, now seen corresponding path program 4 times [2025-04-14 01:19:35,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:35,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186629708] [2025-04-14 01:19:35,205 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:35,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:19:35,211 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-14 01:19:35,211 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:19:35,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:19:35,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:35,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186629708] [2025-04-14 01:19:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186629708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:35,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309617240] [2025-04-14 01:19:35,230 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:35,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:35,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:35,232 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:19:35,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:19:35,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:19:35,294 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-14 01:19:35,294 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:19:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:35,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:19:35,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:19:35,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:35,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:19:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309617240] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:19:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618513021] [2025-04-14 01:19:35,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:35,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:19:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:35,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:19:35,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:19:35,388 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:35,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 1868 transitions, 62586 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:35,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:35,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:35,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:46,270 INFO L116 PetriNetUnfolderBase]: 16670/24089 cut-off events. [2025-04-14 01:19:46,271 INFO L117 PetriNetUnfolderBase]: For 1684188/1684188 co-relation queries the response was YES. [2025-04-14 01:19:46,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331572 conditions, 24089 events. 16670/24089 cut-off events. For 1684188/1684188 co-relation queries the response was YES. Maximal size of possible extension queue 1495. Compared 152691 event pairs, 2970 based on Foata normal form. 84/24173 useless extension candidates. Maximal degree in co-relation 331286. Up to 13184 conditions per place. [2025-04-14 01:19:46,812 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1735 selfloop transitions, 423 changer transitions 3/2161 dead transitions. [2025-04-14 01:19:46,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 2161 transitions, 73970 flow [2025-04-14 01:19:46,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:19:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:19:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-14 01:19:46,813 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2025-04-14 01:19:46,814 INFO L175 Difference]: Start difference. First operand has 624 places, 1868 transitions, 62586 flow. Second operand 6 states and 97 transitions. [2025-04-14 01:19:46,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 2161 transitions, 73970 flow [2025-04-14 01:19:59,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 2161 transitions, 73238 flow, removed 69 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:59,269 INFO L231 Difference]: Finished difference. Result has 623 places, 1867 transitions, 62749 flow [2025-04-14 01:19:59,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61533, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1855, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=409, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=62749, PETRI_PLACES=623, PETRI_TRANSITIONS=1867} [2025-04-14 01:19:59,271 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 592 predicate places. [2025-04-14 01:19:59,271 INFO L485 AbstractCegarLoop]: Abstraction has has 623 places, 1867 transitions, 62749 flow [2025-04-14 01:19:59,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:59,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:59,271 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:59,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 01:19:59,471 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:59,471 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:59,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:59,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1898375455, now seen corresponding path program 8 times [2025-04-14 01:19:59,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:59,472 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812628858] [2025-04-14 01:19:59,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:59,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:59,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:19:59,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:19:59,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:59,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:19:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:59,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812628858] [2025-04-14 01:19:59,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812628858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:59,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:59,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:19:59,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733055533] [2025-04-14 01:19:59,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:59,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:19:59,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:59,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:19:59,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:19:59,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:59,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 1867 transitions, 62749 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:59,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:59,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:59,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:10,840 INFO L116 PetriNetUnfolderBase]: 16659/24073 cut-off events. [2025-04-14 01:20:10,840 INFO L117 PetriNetUnfolderBase]: For 1628890/1628890 co-relation queries the response was YES. [2025-04-14 01:20:11,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328928 conditions, 24073 events. 16659/24073 cut-off events. For 1628890/1628890 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 152486 event pairs, 2076 based on Foata normal form. 8/24081 useless extension candidates. Maximal degree in co-relation 328645. Up to 16493 conditions per place. [2025-04-14 01:20:11,450 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1974 selfloop transitions, 178 changer transitions 5/2157 dead transitions. [2025-04-14 01:20:11,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 2157 transitions, 74743 flow [2025-04-14 01:20:11,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-04-14 01:20:11,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2025-04-14 01:20:11,451 INFO L175 Difference]: Start difference. First operand has 623 places, 1867 transitions, 62749 flow. Second operand 6 states and 79 transitions. [2025-04-14 01:20:11,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 2157 transitions, 74743 flow [2025-04-14 01:20:23,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 2157 transitions, 74277 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:23,626 INFO L231 Difference]: Finished difference. Result has 626 places, 1871 transitions, 62771 flow [2025-04-14 01:20:23,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62211, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=62771, PETRI_PLACES=626, PETRI_TRANSITIONS=1871} [2025-04-14 01:20:23,627 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 595 predicate places. [2025-04-14 01:20:23,627 INFO L485 AbstractCegarLoop]: Abstraction has has 626 places, 1871 transitions, 62771 flow [2025-04-14 01:20:23,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:23,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:23,627 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:23,627 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-14 01:20:23,627 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:23,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 47315227, now seen corresponding path program 9 times [2025-04-14 01:20:23,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:23,628 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324502541] [2025-04-14 01:20:23,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:23,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:23,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:23,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:23,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324502541] [2025-04-14 01:20:23,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324502541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:23,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254821325] [2025-04-14 01:20:23,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:23,663 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:20:23,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:20:23,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:23,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:23,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:23,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:23,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:23,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:23,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:20:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254821325] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-14 01:20:23,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291186503] [2025-04-14 01:20:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:23,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:20:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:20:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:20:23,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:23,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 1871 transitions, 62771 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-14 01:20:23,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:23,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:23,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:34,661 INFO L116 PetriNetUnfolderBase]: 16539/23861 cut-off events. [2025-04-14 01:20:34,661 INFO L117 PetriNetUnfolderBase]: For 1647043/1647043 co-relation queries the response was YES. [2025-04-14 01:20:35,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327039 conditions, 23861 events. 16539/23861 cut-off events. For 1647043/1647043 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 149733 event pairs, 4566 based on Foata normal form. 84/23945 useless extension candidates. Maximal degree in co-relation 326757. Up to 21123 conditions per place. [2025-04-14 01:20:35,375 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1900 selfloop transitions, 108 changer transitions 0/2008 dead transitions. [2025-04-14 01:20:35,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 2008 transitions, 70606 flow [2025-04-14 01:20:35,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:20:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:20:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-14 01:20:35,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-04-14 01:20:35,376 INFO L175 Difference]: Start difference. First operand has 626 places, 1871 transitions, 62771 flow. Second operand 7 states and 72 transitions. [2025-04-14 01:20:35,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 2008 transitions, 70606 flow [2025-04-14 01:20:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 2008 transitions, 70438 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-14 01:20:47,780 INFO L231 Difference]: Finished difference. Result has 629 places, 1882 transitions, 63084 flow [2025-04-14 01:20:47,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62486, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=63084, PETRI_PLACES=629, PETRI_TRANSITIONS=1882} [2025-04-14 01:20:47,782 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 598 predicate places. [2025-04-14 01:20:47,782 INFO L485 AbstractCegarLoop]: Abstraction has has 629 places, 1882 transitions, 63084 flow [2025-04-14 01:20:47,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-14 01:20:47,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:47,782 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:47,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:20:47,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:47,983 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:20:47,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1614236897, now seen corresponding path program 5 times [2025-04-14 01:20:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:47,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522571526] [2025-04-14 01:20:47,984 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:47,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:47,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:47,994 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:47,995 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:47,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:48,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:48,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522571526] [2025-04-14 01:20:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522571526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:20:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27000420] [2025-04-14 01:20:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:48,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:48,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:48,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:48,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:48,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 1882 transitions, 63084 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:48,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:48,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:48,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:59,528 INFO L116 PetriNetUnfolderBase]: 16486/23808 cut-off events. [2025-04-14 01:20:59,529 INFO L117 PetriNetUnfolderBase]: For 1647395/1647395 co-relation queries the response was YES. [2025-04-14 01:21:00,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326001 conditions, 23808 events. 16486/23808 cut-off events. For 1647395/1647395 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 149839 event pairs, 2332 based on Foata normal form. 53/23861 useless extension candidates. Maximal degree in co-relation 325717. Up to 13519 conditions per place. [2025-04-14 01:21:00,478 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1810 selfloop transitions, 253 changer transitions 17/2080 dead transitions. [2025-04-14 01:21:00,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 2080 transitions, 72471 flow [2025-04-14 01:21:00,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:00,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-14 01:21:00,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-14 01:21:00,479 INFO L175 Difference]: Start difference. First operand has 629 places, 1882 transitions, 63084 flow. Second operand 6 states and 80 transitions. [2025-04-14 01:21:00,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 2080 transitions, 72471 flow Received shutdown request... [2025-04-14 01:21:10,315 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:21:10,315 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-14 01:21:10,316 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-14 01:21:10,322 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:21:10,322 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:21:10,322 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:21:10,322 INFO L422 BasicCegarLoop]: Path program histogram: [48, 11, 9, 7, 5, 5, 4, 3, 2, 2, 1, 1] [2025-04-14 01:21:10,327 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:21:10,327 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:21:10,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:21:10 BasicIcfg [2025-04-14 01:21:10,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:21:10,340 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-14 01:21:10,340 INFO L158 Benchmark]: Toolchain (without parser) took 784143.22ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 108.4MB in the beginning and 650.1MB in the end (delta: -541.7MB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2025-04-14 01:21:10,340 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:21:10,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.61ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 01:21:10,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.40ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:21:10,343 INFO L158 Benchmark]: Boogie Preprocessor took 30.99ms. Allocated memory is still 155.2MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:21:10,343 INFO L158 Benchmark]: IcfgBuilder took 542.60ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 24.9MB in the end (delta: 63.7MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2025-04-14 01:21:10,343 INFO L158 Benchmark]: TraceAbstraction took 783263.14ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 24.9MB in the beginning and 650.1MB in the end (delta: -625.2MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2025-04-14 01:21:10,348 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.14ms. Allocated memory is still 163.6MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.61ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.7MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.40ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.99ms. Allocated memory is still 155.2MB. Free memory was 90.3MB in the beginning and 88.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 542.60ms. Allocated memory is still 155.2MB. Free memory was 88.7MB in the beginning and 24.9MB in the end (delta: 63.7MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * TraceAbstraction took 783263.14ms. Allocated memory was 155.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 24.9MB in the beginning and 650.1MB in the end (delta: -625.2MB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 783.2s, OverallIterations: 98, TraceHistogramMax: 2, PathProgramHistogramMax: 48, EmptinessCheckTime: 0.0s, AutomataDifference: 759.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4471 SdHoareTripleChecker+Valid, 12.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 281 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26724 IncrementalHoareTripleChecker+Invalid, 27005 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 281 mSolverCounterUnsat, 0 mSDtfsCounter, 26724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2053 GetRequests, 963 SyntacticMatches, 32 SemanticMatches, 1058 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63084occurred in iteration=97, InterpolantAutomatonStates: 837, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 2627 NumberOfCodeBlocks, 2546 NumberOfCodeBlocksAsserted, 175 NumberOfCheckSat, 3028 ConstructedInterpolants, 0 QuantifiedInterpolants, 22448 SizeOfPredicates, 229 NumberOfNonLiveVariables, 5411 ConjunctsInSsa, 507 ConjunctsInUnsatCore, 153 InterpolantComputations, 94 PerfectInterpolantSequences, 193/264 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 [2025-04-14 01:21:10,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0