/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-multiply-verify.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:18:42,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:18:42,861 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:18:42,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:18:42,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:18:42,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:18:42,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:18:42,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:18:42,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:18:42,888 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:18:42,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:18:42,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:18:42,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:18:42,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:18:42,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:18:42,890 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:18:42,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:42,891 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:42,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:18:42,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:18:42,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:18:42,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:18:42,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:18:42,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:18:42,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:18:42,892 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:18:43,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:18:43,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:18:43,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:18:43,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:18:43,118 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:18:43,119 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2025-04-14 01:18:44,424 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaac8a7/93581fb49f444be2acff9afb73f9beb9/FLAG678e4d138 [2025-04-14 01:18:44,618 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:18:44,618 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-multiply-verify.wvr.c [2025-04-14 01:18:44,624 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaac8a7/93581fb49f444be2acff9afb73f9beb9/FLAG678e4d138 [2025-04-14 01:18:45,424 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dcaac8a7/93581fb49f444be2acff9afb73f9beb9 [2025-04-14 01:18:45,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:18:45,427 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:18:45,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:45,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:18:45,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:18:45,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f5fee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45, skipping insertion in model container [2025-04-14 01:18:45,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:18:45,601 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-multiply-verify.wvr.c[3081,3094] [2025-04-14 01:18:45,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:45,614 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:18:45,634 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-multiply-verify.wvr.c[3081,3094] [2025-04-14 01:18:45,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:45,646 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:18:45,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45 WrapperNode [2025-04-14 01:18:45,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:45,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:45,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:18:45,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:18:45,651 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:18:45" (1/1) ... [2025-04-14 01:18:45,656 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:18:45" (1/1) ... [2025-04-14 01:18:45,675 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 162 [2025-04-14 01:18:45,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:45,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:18:45,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:18:45,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:18:45,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,700 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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:18:45,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:18:45,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:18:45,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:18:45,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:18:45,710 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (1/1) ... [2025-04-14 01:18:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:45,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:45,736 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:18:45,738 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:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:18:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:18:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:18:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:18:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:18:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:18:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:18:45,759 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:18:45,832 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:18:45,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:18:46,014 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:18:46,015 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:18:46,015 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:18:46,216 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:18:46,219 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:18:46,226 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:18:46,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:46 BoogieIcfgContainer [2025-04-14 01:18:46,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:18:46,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:18:46,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:18:46,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:18:46,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:18:45" (1/3) ... [2025-04-14 01:18:46,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b262779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:46, skipping insertion in model container [2025-04-14 01:18:46,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:45" (2/3) ... [2025-04-14 01:18:46,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b262779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:46, skipping insertion in model container [2025-04-14 01:18:46,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:46" (3/3) ... [2025-04-14 01:18:46,234 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-multiply-verify.wvr.c [2025-04-14 01:18:46,245 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:18:46,246 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-multiply-verify.wvr.c that has 4 procedures, 30 locations, 31 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:18:46,246 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:18:46,285 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:18:46,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 34 transitions, 89 flow [2025-04-14 01:18:46,334 INFO L116 PetriNetUnfolderBase]: 5/31 cut-off events. [2025-04-14 01:18:46,335 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 5/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2025-04-14 01:18:46,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 34 transitions, 89 flow [2025-04-14 01:18:46,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 30 transitions, 78 flow [2025-04-14 01:18:46,343 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:18:46,352 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;@4215366e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:18:46,352 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:18:46,364 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:18:46,364 INFO L116 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-04-14 01:18:46,364 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:46,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:46,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:46,365 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:18:46,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:46,369 INFO L85 PathProgramCache]: Analyzing trace with hash 748416036, now seen corresponding path program 1 times [2025-04-14 01:18:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:46,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836255294] [2025-04-14 01:18:46,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:46,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:18:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:18:46,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:46,631 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:18:46,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:46,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836255294] [2025-04-14 01:18:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836255294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:46,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:18:46,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599169441] [2025-04-14 01:18:46,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:46,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:46,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:46,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:46,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:46,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:46,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:46,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:46,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:46,851 INFO L116 PetriNetUnfolderBase]: 535/812 cut-off events. [2025-04-14 01:18:46,851 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-14 01:18:46,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 812 events. 535/812 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2968 event pairs, 171 based on Foata normal form. 32/704 useless extension candidates. Maximal degree in co-relation 1568. Up to 567 conditions per place. [2025-04-14 01:18:46,860 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 43 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-04-14 01:18:46,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 210 flow [2025-04-14 01:18:46,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-14 01:18:46,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-04-14 01:18:46,871 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 78 flow. Second operand 3 states and 59 transitions. [2025-04-14 01:18:46,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 210 flow [2025-04-14 01:18:46,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:46,878 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 85 flow [2025-04-14 01:18:46,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-04-14 01:18:46,883 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-04-14 01:18:46,883 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 85 flow [2025-04-14 01:18:46,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:46,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:46,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:46,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:18:46,883 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:18:46,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash -490516840, now seen corresponding path program 2 times [2025-04-14 01:18:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:46,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876905560] [2025-04-14 01:18:46,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:46,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:46,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:18:46,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:18:46,922 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:46,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:47,088 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:18:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:47,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876905560] [2025-04-14 01:18:47,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876905560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:47,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:47,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:18:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391250128] [2025-04-14 01:18:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:47,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:18:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:47,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:18:47,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:18:47,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:47,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:47,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:47,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:47,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:47,264 INFO L116 PetriNetUnfolderBase]: 690/1069 cut-off events. [2025-04-14 01:18:47,264 INFO L117 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-04-14 01:18:47,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 1069 events. 690/1069 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4214 event pairs, 467 based on Foata normal form. 34/895 useless extension candidates. Maximal degree in co-relation 990. Up to 797 conditions per place. [2025-04-14 01:18:47,271 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 30 selfloop transitions, 2 changer transitions 17/50 dead transitions. [2025-04-14 01:18:47,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 222 flow [2025-04-14 01:18:47,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:18:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:18:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-14 01:18:47,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47794117647058826 [2025-04-14 01:18:47,274 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 85 flow. Second operand 4 states and 65 transitions. [2025-04-14 01:18:47,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 222 flow [2025-04-14 01:18:47,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:47,278 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 98 flow [2025-04-14 01:18:47,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2025-04-14 01:18:47,278 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2025-04-14 01:18:47,278 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 98 flow [2025-04-14 01:18:47,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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:47,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:47,279 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:18:47,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:18:47,279 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:18:47,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:47,279 INFO L85 PathProgramCache]: Analyzing trace with hash -553866800, now seen corresponding path program 1 times [2025-04-14 01:18:47,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:47,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989153429] [2025-04-14 01:18:47,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:47,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:47,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:18:47,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:18:47,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:47,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:47,426 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:18:47,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:47,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989153429] [2025-04-14 01:18:47,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989153429] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:47,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153034836] [2025-04-14 01:18:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:47,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:47,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:47,430 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:18:47,430 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:18:47,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:18:47,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:18:47,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:47,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:47,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:18:47,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:47,569 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:18:47,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:47,619 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:18:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153034836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:47,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:47,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-14 01:18:47,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876668315] [2025-04-14 01:18:47,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:47,620 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:18:47,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:47,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:18:47,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:18:47,621 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:47,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 98 flow. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:47,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:47,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:47,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:47,789 INFO L116 PetriNetUnfolderBase]: 857/1340 cut-off events. [2025-04-14 01:18:47,789 INFO L117 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-04-14 01:18:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2959 conditions, 1340 events. 857/1340 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5700 event pairs, 592 based on Foata normal form. 43/1141 useless extension candidates. Maximal degree in co-relation 2945. Up to 797 conditions per place. [2025-04-14 01:18:47,794 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 30 selfloop transitions, 3 changer transitions 25/59 dead transitions. [2025-04-14 01:18:47,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 287 flow [2025-04-14 01:18:47,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:18:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:18:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 01:18:47,795 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-04-14 01:18:47,795 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 98 flow. Second operand 5 states and 75 transitions. [2025-04-14 01:18:47,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 59 transitions, 287 flow [2025-04-14 01:18:47,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 59 transitions, 275 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:47,797 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 108 flow [2025-04-14 01:18:47,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-04-14 01:18:47,797 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-04-14 01:18:47,797 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 108 flow [2025-04-14 01:18:47,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:47,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:47,798 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, 1] [2025-04-14 01:18:47,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:18:48,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:48,001 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:18:48,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1355233688, now seen corresponding path program 2 times [2025-04-14 01:18:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:48,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304027587] [2025-04-14 01:18:48,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:48,010 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:48,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:18:48,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:48,095 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,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:48,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304027587] [2025-04-14 01:18:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304027587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:48,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:48,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105959923] [2025-04-14 01:18:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:48,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:18:48,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:48,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:18:48,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:18:48,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:48,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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:18:48,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:48,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:48,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:48,185 INFO L116 PetriNetUnfolderBase]: 355/562 cut-off events. [2025-04-14 01:18:48,185 INFO L117 PetriNetUnfolderBase]: For 160/170 co-relation queries the response was YES. [2025-04-14 01:18:48,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 562 events. 355/562 cut-off events. For 160/170 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1978 event pairs, 99 based on Foata normal form. 42/501 useless extension candidates. Maximal degree in co-relation 1222. Up to 232 conditions per place. [2025-04-14 01:18:48,188 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 49 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2025-04-14 01:18:48,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 262 flow [2025-04-14 01:18:48,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:18:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:18:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-14 01:18:48,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5073529411764706 [2025-04-14 01:18:48,190 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 108 flow. Second operand 4 states and 69 transitions. [2025-04-14 01:18:48,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 262 flow [2025-04-14 01:18:48,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 252 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-04-14 01:18:48,192 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 114 flow [2025-04-14 01:18:48,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-04-14 01:18:48,193 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-04-14 01:18:48,193 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 114 flow [2025-04-14 01:18:48,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 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:18:48,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:48,193 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, 1] [2025-04-14 01:18:48,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:18:48,193 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:18:48,194 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash 739070004, now seen corresponding path program 3 times [2025-04-14 01:18:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:48,194 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208568962] [2025-04-14 01:18:48,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:48,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:48,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:48,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:18:48,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:48,605 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,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:48,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208568962] [2025-04-14 01:18:48,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208568962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:48,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:48,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:18:48,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014566874] [2025-04-14 01:18:48,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:48,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:18:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:48,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:18:48,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:18:48,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:48,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 114 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:48,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:48,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:48,992 INFO L116 PetriNetUnfolderBase]: 564/907 cut-off events. [2025-04-14 01:18:48,992 INFO L117 PetriNetUnfolderBase]: For 459/465 co-relation queries the response was YES. [2025-04-14 01:18:48,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2182 conditions, 907 events. 564/907 cut-off events. For 459/465 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3839 event pairs, 131 based on Foata normal form. 6/786 useless extension candidates. Maximal degree in co-relation 2157. Up to 358 conditions per place. [2025-04-14 01:18:48,998 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 16 changer transitions 16/96 dead transitions. [2025-04-14 01:18:48,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 96 transitions, 475 flow [2025-04-14 01:18:48,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2025-04-14 01:18:48,999 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4632352941176471 [2025-04-14 01:18:48,999 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 114 flow. Second operand 8 states and 126 transitions. [2025-04-14 01:18:48,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 96 transitions, 475 flow [2025-04-14 01:18:49,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 96 transitions, 455 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:49,003 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 229 flow [2025-04-14 01:18:49,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2025-04-14 01:18:49,004 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2025-04-14 01:18:49,005 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 229 flow [2025-04-14 01:18:49,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:49,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:49,005 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, 1] [2025-04-14 01:18:49,005 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:18:49,005 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:18:49,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:49,005 INFO L85 PathProgramCache]: Analyzing trace with hash 879804516, now seen corresponding path program 4 times [2025-04-14 01:18:49,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:49,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65696748] [2025-04-14 01:18:49,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:49,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:49,018 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:49,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:49,056 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:49,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:50,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:50,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65696748] [2025-04-14 01:18:50,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65696748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:50,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722968896] [2025-04-14 01:18:50,233 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:50,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:50,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:50,234 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:18:50,236 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:18:50,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:50,298 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:50,298 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:50,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:18:50,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:50,505 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:18:50,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:50,678 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:18:50,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-14 01:18:50,908 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:50,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722968896] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:50,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:18:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 22 [2025-04-14 01:18:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049058449] [2025-04-14 01:18:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:50,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:18:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:50,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:18:50,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:18:50,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:50,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 229 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:50,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:50,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:50,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:51,255 INFO L116 PetriNetUnfolderBase]: 677/1082 cut-off events. [2025-04-14 01:18:51,256 INFO L117 PetriNetUnfolderBase]: For 980/988 co-relation queries the response was YES. [2025-04-14 01:18:51,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1082 events. 677/1082 cut-off events. For 980/988 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4694 event pairs, 185 based on Foata normal form. 6/945 useless extension candidates. Maximal degree in co-relation 3371. Up to 302 conditions per place. [2025-04-14 01:18:51,262 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 60 selfloop transitions, 24 changer transitions 16/101 dead transitions. [2025-04-14 01:18:51,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 627 flow [2025-04-14 01:18:51,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2025-04-14 01:18:51,263 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-04-14 01:18:51,263 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 229 flow. Second operand 8 states and 120 transitions. [2025-04-14 01:18:51,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 627 flow [2025-04-14 01:18:51,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 101 transitions, 599 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:51,268 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 397 flow [2025-04-14 01:18:51,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2025-04-14 01:18:51,269 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2025-04-14 01:18:51,269 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 397 flow [2025-04-14 01:18:51,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:51,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:51,269 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, 1] [2025-04-14 01:18:51,275 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:18:51,469 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,SelfDestructingSolverStorable5 [2025-04-14 01:18:51,469 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:18:51,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1075124368, now seen corresponding path program 5 times [2025-04-14 01:18:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:51,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607656035] [2025-04-14 01:18:51,470 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:51,477 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:51,497 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:51,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:51,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:52,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:52,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607656035] [2025-04-14 01:18:52,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607656035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:52,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336322888] [2025-04-14 01:18:52,434 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:52,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:52,436 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:18:52,439 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:18:52,478 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:52,497 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:52,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:52,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:52,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-14 01:18:52,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:52,557 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 23 treesize of output 1 [2025-04-14 01:18:52,905 INFO L325 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2025-04-14 01:18:52,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 41 [2025-04-14 01:18:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:52,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:53,636 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 81 treesize of output 73 [2025-04-14 01:18:53,679 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-14 01:18:53,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 138 [2025-04-14 01:18:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336322888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:54,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2025-04-14 01:18:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671775612] [2025-04-14 01:18:54,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:54,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:18:54,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:54,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:18:54,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:18:54,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:54,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 397 flow. Second operand has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:54,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:54,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:54,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:56,725 INFO L116 PetriNetUnfolderBase]: 1592/2622 cut-off events. [2025-04-14 01:18:56,726 INFO L117 PetriNetUnfolderBase]: For 3759/3775 co-relation queries the response was YES. [2025-04-14 01:18:56,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8996 conditions, 2622 events. 1592/2622 cut-off events. For 3759/3775 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14274 event pairs, 496 based on Foata normal form. 14/2324 useless extension candidates. Maximal degree in co-relation 8967. Up to 973 conditions per place. [2025-04-14 01:18:56,738 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 175 selfloop transitions, 39 changer transitions 22/237 dead transitions. [2025-04-14 01:18:56,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 237 transitions, 1628 flow [2025-04-14 01:18:56,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:18:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:18:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 276 transitions. [2025-04-14 01:18:56,740 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3865546218487395 [2025-04-14 01:18:56,740 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 397 flow. Second operand 21 states and 276 transitions. [2025-04-14 01:18:56,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 237 transitions, 1628 flow [2025-04-14 01:18:56,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 237 transitions, 1584 flow, removed 22 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:56,760 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 884 flow [2025-04-14 01:18:56,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=884, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2025-04-14 01:18:56,761 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 47 predicate places. [2025-04-14 01:18:56,761 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 884 flow [2025-04-14 01:18:56,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 6.0625) internal successors, (194), 32 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have 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:56,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:56,761 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, 1] [2025-04-14 01:18:56,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:18:56,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:56,963 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:18:56,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1367333846, now seen corresponding path program 6 times [2025-04-14 01:18:56,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:56,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106847688] [2025-04-14 01:18:56,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:56,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:56,969 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:18:56,982 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:56,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:56,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:57,197 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:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:57,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106847688] [2025-04-14 01:18:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106847688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:18:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526513624] [2025-04-14 01:18:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:57,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:18:57,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:57,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:18:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:18:57,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:57,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 884 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:57,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:57,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:57,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:57,575 INFO L116 PetriNetUnfolderBase]: 1701/2802 cut-off events. [2025-04-14 01:18:57,576 INFO L117 PetriNetUnfolderBase]: For 5669/5697 co-relation queries the response was YES. [2025-04-14 01:18:57,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 2802 events. 1701/2802 cut-off events. For 5669/5697 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15573 event pairs, 436 based on Foata normal form. 24/2506 useless extension candidates. Maximal degree in co-relation 10583. Up to 1227 conditions per place. [2025-04-14 01:18:57,595 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 90 selfloop transitions, 42 changer transitions 18/151 dead transitions. [2025-04-14 01:18:57,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 151 transitions, 1382 flow [2025-04-14 01:18:57,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:18:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:18:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2025-04-14 01:18:57,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47794117647058826 [2025-04-14 01:18:57,596 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 884 flow. Second operand 8 states and 130 transitions. [2025-04-14 01:18:57,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 151 transitions, 1382 flow [2025-04-14 01:18:57,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 151 transitions, 1314 flow, removed 32 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:57,636 INFO L231 Difference]: Finished difference. Result has 85 places, 99 transitions, 947 flow [2025-04-14 01:18:57,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=947, PETRI_PLACES=85, PETRI_TRANSITIONS=99} [2025-04-14 01:18:57,636 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2025-04-14 01:18:57,636 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 99 transitions, 947 flow [2025-04-14 01:18:57,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:57,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:57,637 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, 1] [2025-04-14 01:18:57,637 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:18:57,637 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:18:57,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 939499642, now seen corresponding path program 7 times [2025-04-14 01:18:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:57,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923110890] [2025-04-14 01:18:57,637 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:57,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:18:57,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:57,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:57,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:58,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923110890] [2025-04-14 01:18:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923110890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:58,221 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732708237] [2025-04-14 01:18:58,221 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:58,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:58,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:58,223 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:18:58,224 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:18:58,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:18:58,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:18:58,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:58,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:58,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:18:58,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:58,307 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:18:58,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:58,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:58,959 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 82 treesize of output 74 [2025-04-14 01:18:58,985 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:18:58,986 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 125 [2025-04-14 01:18:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:18:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732708237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:59,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:59,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-04-14 01:18:59,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016009963] [2025-04-14 01:18:59,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:59,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 01:18:59,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:59,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 01:18:59,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2025-04-14 01:18:59,180 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:18:59,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 99 transitions, 947 flow. Second operand has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:59,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:59,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:18:59,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:00,861 INFO L116 PetriNetUnfolderBase]: 3051/4962 cut-off events. [2025-04-14 01:19:00,861 INFO L117 PetriNetUnfolderBase]: For 14604/14624 co-relation queries the response was YES. [2025-04-14 01:19:00,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19876 conditions, 4962 events. 3051/4962 cut-off events. For 14604/14624 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 29756 event pairs, 813 based on Foata normal form. 17/4381 useless extension candidates. Maximal degree in co-relation 19825. Up to 1681 conditions per place. [2025-04-14 01:19:00,894 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 210 selfloop transitions, 86 changer transitions 44/341 dead transitions. [2025-04-14 01:19:00,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 341 transitions, 3074 flow [2025-04-14 01:19:00,894 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 01:19:00,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-14 01:19:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 347 transitions. [2025-04-14 01:19:00,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3925339366515837 [2025-04-14 01:19:00,896 INFO L175 Difference]: Start difference. First operand has 85 places, 99 transitions, 947 flow. Second operand 26 states and 347 transitions. [2025-04-14 01:19:00,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 341 transitions, 3074 flow [2025-04-14 01:19:00,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 341 transitions, 2902 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:00,989 INFO L231 Difference]: Finished difference. Result has 116 places, 163 transitions, 1833 flow [2025-04-14 01:19:00,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1833, PETRI_PLACES=116, PETRI_TRANSITIONS=163} [2025-04-14 01:19:00,989 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2025-04-14 01:19:00,989 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 163 transitions, 1833 flow [2025-04-14 01:19:00,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:00,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:00,990 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, 1] [2025-04-14 01:19:00,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:19:01,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:01,190 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:19:01,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1348692800, now seen corresponding path program 8 times [2025-04-14 01:19:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:01,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90079433] [2025-04-14 01:19:01,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:01,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:01,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:19:01,207 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:01,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:01,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:01,380 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:01,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:01,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90079433] [2025-04-14 01:19:01,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90079433] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:01,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:01,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:19:01,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664789873] [2025-04-14 01:19:01,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:01,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:19:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:01,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:19:01,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:19:01,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:01,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 163 transitions, 1833 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:01,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:01,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:01,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:01,919 INFO L116 PetriNetUnfolderBase]: 3094/5018 cut-off events. [2025-04-14 01:19:01,919 INFO L117 PetriNetUnfolderBase]: For 17133/17157 co-relation queries the response was YES. [2025-04-14 01:19:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21214 conditions, 5018 events. 3094/5018 cut-off events. For 17133/17157 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29999 event pairs, 948 based on Foata normal form. 17/4438 useless extension candidates. Maximal degree in co-relation 21147. Up to 2666 conditions per place. [2025-04-14 01:19:01,945 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 114 selfloop transitions, 79 changer transitions 19/213 dead transitions. [2025-04-14 01:19:01,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 213 transitions, 2487 flow [2025-04-14 01:19:01,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:19:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:19:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-04-14 01:19:01,946 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2025-04-14 01:19:01,946 INFO L175 Difference]: Start difference. First operand has 116 places, 163 transitions, 1833 flow. Second operand 8 states and 124 transitions. [2025-04-14 01:19:01,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 213 transitions, 2487 flow [2025-04-14 01:19:02,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 213 transitions, 2392 flow, removed 44 selfloop flow, removed 9 redundant places. [2025-04-14 01:19:02,090 INFO L231 Difference]: Finished difference. Result has 111 places, 166 transitions, 1972 flow [2025-04-14 01:19:02,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1972, PETRI_PLACES=111, PETRI_TRANSITIONS=166} [2025-04-14 01:19:02,091 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 76 predicate places. [2025-04-14 01:19:02,091 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 166 transitions, 1972 flow [2025-04-14 01:19:02,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:02,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:02,091 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 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:19:02,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:19:02,091 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:19:02,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -65673930, now seen corresponding path program 9 times [2025-04-14 01:19:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:02,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570898242] [2025-04-14 01:19:02,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:02,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 3 equivalence classes. [2025-04-14 01:19:02,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 24 statements. [2025-04-14 01:19:02,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:02,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:19:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:02,292 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570898242] [2025-04-14 01:19:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570898242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:19:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054019869] [2025-04-14 01:19:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:02,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:19:02,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:02,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:19:02,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:19:02,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:02,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 166 transitions, 1972 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:02,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:02,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:02,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:02,858 INFO L116 PetriNetUnfolderBase]: 3047/4947 cut-off events. [2025-04-14 01:19:02,858 INFO L117 PetriNetUnfolderBase]: For 19525/19553 co-relation queries the response was YES. [2025-04-14 01:19:02,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21756 conditions, 4947 events. 3047/4947 cut-off events. For 19525/19553 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 29565 event pairs, 868 based on Foata normal form. 25/4376 useless extension candidates. Maximal degree in co-relation 21698. Up to 2311 conditions per place. [2025-04-14 01:19:02,884 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 137 selfloop transitions, 65 changer transitions 17/220 dead transitions. [2025-04-14 01:19:02,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 220 transitions, 2620 flow [2025-04-14 01:19:02,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:19:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:19:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-04-14 01:19:02,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46691176470588236 [2025-04-14 01:19:02,886 INFO L175 Difference]: Start difference. First operand has 111 places, 166 transitions, 1972 flow. Second operand 8 states and 127 transitions. [2025-04-14 01:19:02,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 220 transitions, 2620 flow [2025-04-14 01:19:03,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 220 transitions, 2460 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:03,046 INFO L231 Difference]: Finished difference. Result has 114 places, 168 transitions, 1999 flow [2025-04-14 01:19:03,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1999, PETRI_PLACES=114, PETRI_TRANSITIONS=168} [2025-04-14 01:19:03,047 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 79 predicate places. [2025-04-14 01:19:03,047 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 168 transitions, 1999 flow [2025-04-14 01:19:03,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:03,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:03,047 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, 1, 1, 1] [2025-04-14 01:19:03,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:19:03,047 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:19:03,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:03,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1573227622, now seen corresponding path program 1 times [2025-04-14 01:19:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:03,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484572559] [2025-04-14 01:19:03,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:19:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:03,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:19:03,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:19:03,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:03,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:03,071 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:03,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:03,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484572559] [2025-04-14 01:19:03,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484572559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:03,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:03,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:19:03,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376177710] [2025-04-14 01:19:03,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:03,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:19:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:03,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:19:03,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:19:03,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:03,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 168 transitions, 1999 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:03,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:03,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:03,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:03,460 INFO L116 PetriNetUnfolderBase]: 2578/4267 cut-off events. [2025-04-14 01:19:03,460 INFO L117 PetriNetUnfolderBase]: For 20617/20621 co-relation queries the response was YES. [2025-04-14 01:19:03,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18561 conditions, 4267 events. 2578/4267 cut-off events. For 20617/20621 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25284 event pairs, 638 based on Foata normal form. 2/3887 useless extension candidates. Maximal degree in co-relation 18498. Up to 3684 conditions per place. [2025-04-14 01:19:03,484 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 159 selfloop transitions, 18 changer transitions 22/200 dead transitions. [2025-04-14 01:19:03,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 200 transitions, 2786 flow [2025-04-14 01:19:03,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:19:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:19:03,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-14 01:19:03,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-14 01:19:03,485 INFO L175 Difference]: Start difference. First operand has 114 places, 168 transitions, 1999 flow. Second operand 3 states and 60 transitions. [2025-04-14 01:19:03,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 200 transitions, 2786 flow [2025-04-14 01:19:03,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 200 transitions, 2596 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:03,606 INFO L231 Difference]: Finished difference. Result has 110 places, 155 transitions, 1727 flow [2025-04-14 01:19:03,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1727, PETRI_PLACES=110, PETRI_TRANSITIONS=155} [2025-04-14 01:19:03,607 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2025-04-14 01:19:03,607 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 155 transitions, 1727 flow [2025-04-14 01:19:03,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:03,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:03,607 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, 1, 1, 1] [2025-04-14 01:19:03,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:19:03,607 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:19:03,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 360013320, now seen corresponding path program 1 times [2025-04-14 01:19:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:03,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314280924] [2025-04-14 01:19:03,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:19:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:19:03,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:19:03,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:03,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:03,632 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:03,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:03,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314280924] [2025-04-14 01:19:03,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314280924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:03,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:03,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:19:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056181389] [2025-04-14 01:19:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:03,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:19:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:03,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:19:03,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:19:03,634 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:03,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 155 transitions, 1727 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:03,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:03,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:03,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:03,846 INFO L116 PetriNetUnfolderBase]: 1583/2608 cut-off events. [2025-04-14 01:19:03,846 INFO L117 PetriNetUnfolderBase]: For 12247/12252 co-relation queries the response was YES. [2025-04-14 01:19:03,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10681 conditions, 2608 events. 1583/2608 cut-off events. For 12247/12252 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13494 event pairs, 932 based on Foata normal form. 85/2474 useless extension candidates. Maximal degree in co-relation 10541. Up to 2279 conditions per place. [2025-04-14 01:19:03,857 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 116 selfloop transitions, 1 changer transitions 15/133 dead transitions. [2025-04-14 01:19:03,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 133 transitions, 1543 flow [2025-04-14 01:19:03,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:19:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:19:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-14 01:19:03,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-04-14 01:19:03,858 INFO L175 Difference]: Start difference. First operand has 110 places, 155 transitions, 1727 flow. Second operand 3 states and 59 transitions. [2025-04-14 01:19:03,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 133 transitions, 1543 flow [2025-04-14 01:19:03,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 1477 flow, removed 20 selfloop flow, removed 9 redundant places. [2025-04-14 01:19:03,895 INFO L231 Difference]: Finished difference. Result has 93 places, 106 transitions, 985 flow [2025-04-14 01:19:03,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=985, PETRI_PLACES=93, PETRI_TRANSITIONS=106} [2025-04-14 01:19:03,896 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 58 predicate places. [2025-04-14 01:19:03,896 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 106 transitions, 985 flow [2025-04-14 01:19:03,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:03,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:03,897 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 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:19:03,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:19:03,897 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:19:03,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:03,897 INFO L85 PathProgramCache]: Analyzing trace with hash -711717318, now seen corresponding path program 10 times [2025-04-14 01:19:03,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:03,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553063275] [2025-04-14 01:19:03,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:03,905 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:03,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:03,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:03,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:05,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553063275] [2025-04-14 01:19:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553063275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:05,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959442137] [2025-04-14 01:19:05,232 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:05,233 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:19:05,234 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:19:05,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:05,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:05,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:05,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:05,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:19:05,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:05,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:05,637 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:19:05,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 58 [2025-04-14 01:19:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 01:19:05,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959442137] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:05,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:05,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14, 11] total 29 [2025-04-14 01:19:05,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253116511] [2025-04-14 01:19:05,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:05,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:19:05,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:05,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:19:05,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2025-04-14 01:19:05,724 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:05,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 106 transitions, 985 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:05,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:05,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:05,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:06,075 INFO L116 PetriNetUnfolderBase]: 1504/2440 cut-off events. [2025-04-14 01:19:06,076 INFO L117 PetriNetUnfolderBase]: For 7409/7418 co-relation queries the response was YES. [2025-04-14 01:19:06,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 2440 events. 1504/2440 cut-off events. For 7409/7418 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12178 event pairs, 470 based on Foata normal form. 8/2229 useless extension candidates. Maximal degree in co-relation 9353. Up to 993 conditions per place. [2025-04-14 01:19:06,087 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 79 selfloop transitions, 44 changer transitions 27/151 dead transitions. [2025-04-14 01:19:06,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 151 transitions, 1418 flow [2025-04-14 01:19:06,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:19:06,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:19:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-04-14 01:19:06,088 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-04-14 01:19:06,088 INFO L175 Difference]: Start difference. First operand has 93 places, 106 transitions, 985 flow. Second operand 9 states and 120 transitions. [2025-04-14 01:19:06,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 151 transitions, 1418 flow [2025-04-14 01:19:06,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1384 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:06,106 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 1014 flow [2025-04-14 01:19:06,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1014, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2025-04-14 01:19:06,106 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 61 predicate places. [2025-04-14 01:19:06,106 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 1014 flow [2025-04-14 01:19:06,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:06,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:06,106 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:06,113 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:19:06,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-14 01:19:06,307 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:19:06,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:06,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1825914482, now seen corresponding path program 1 times [2025-04-14 01:19:06,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:06,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971630224] [2025-04-14 01:19:06,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:19:06,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:06,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:19:06,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:06,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:06,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:06,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:06,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971630224] [2025-04-14 01:19:06,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971630224] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:06,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874601476] [2025-04-14 01:19:06,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:19:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:06,986 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:19:06,987 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:19:07,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:19:07,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:07,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:07,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:07,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:19:07,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:07,082 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:19:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:07,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:07,925 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 78 treesize of output 70 [2025-04-14 01:19:07,957 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:19:07,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 134 [2025-04-14 01:19:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874601476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:08,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:19:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775488833] [2025-04-14 01:19:08,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:08,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:19:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:08,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:19:08,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:19:08,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:08,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 1014 flow. Second operand has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:08,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:08,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:08,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:10,525 INFO L116 PetriNetUnfolderBase]: 2422/3880 cut-off events. [2025-04-14 01:19:10,525 INFO L117 PetriNetUnfolderBase]: For 12665/12670 co-relation queries the response was YES. [2025-04-14 01:19:10,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14882 conditions, 3880 events. 2422/3880 cut-off events. For 12665/12670 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20599 event pairs, 511 based on Foata normal form. 7/3474 useless extension candidates. Maximal degree in co-relation 14841. Up to 662 conditions per place. [2025-04-14 01:19:10,544 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 250 selfloop transitions, 96 changer transitions 47/394 dead transitions. [2025-04-14 01:19:10,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 394 transitions, 3080 flow [2025-04-14 01:19:10,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 01:19:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-14 01:19:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 492 transitions. [2025-04-14 01:19:10,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39109697933227344 [2025-04-14 01:19:10,547 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 1014 flow. Second operand 37 states and 492 transitions. [2025-04-14 01:19:10,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 394 transitions, 3080 flow [2025-04-14 01:19:10,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 394 transitions, 2898 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:10,574 INFO L231 Difference]: Finished difference. Result has 134 places, 165 transitions, 1792 flow [2025-04-14 01:19:10,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1792, PETRI_PLACES=134, PETRI_TRANSITIONS=165} [2025-04-14 01:19:10,574 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2025-04-14 01:19:10,575 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 165 transitions, 1792 flow [2025-04-14 01:19:10,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:10,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:10,575 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:10,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:19:10,775 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 01:19:10,776 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:19:10,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1029130656, now seen corresponding path program 2 times [2025-04-14 01:19:10,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:10,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916669934] [2025-04-14 01:19:10,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:10,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:10,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:10,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:10,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:10,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:11,038 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:11,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:11,038 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916669934] [2025-04-14 01:19:11,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916669934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:11,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878710352] [2025-04-14 01:19:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:11,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:11,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:11,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:11,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:11,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:11,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 165 transitions, 1792 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:11,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:11,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:11,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:11,683 INFO L116 PetriNetUnfolderBase]: 3504/5442 cut-off events. [2025-04-14 01:19:11,684 INFO L117 PetriNetUnfolderBase]: For 29893/29893 co-relation queries the response was YES. [2025-04-14 01:19:11,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23648 conditions, 5442 events. 3504/5442 cut-off events. For 29893/29893 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30394 event pairs, 652 based on Foata normal form. 2/4756 useless extension candidates. Maximal degree in co-relation 23592. Up to 1419 conditions per place. [2025-04-14 01:19:11,706 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 148 selfloop transitions, 115 changer transitions 20/284 dead transitions. [2025-04-14 01:19:11,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 284 transitions, 3261 flow [2025-04-14 01:19:11,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:19:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:19:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2025-04-14 01:19:11,707 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4304812834224599 [2025-04-14 01:19:11,707 INFO L175 Difference]: Start difference. First operand has 134 places, 165 transitions, 1792 flow. Second operand 11 states and 161 transitions. [2025-04-14 01:19:11,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 284 transitions, 3261 flow [2025-04-14 01:19:11,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 284 transitions, 2996 flow, removed 110 selfloop flow, removed 13 redundant places. [2025-04-14 01:19:11,819 INFO L231 Difference]: Finished difference. Result has 131 places, 208 transitions, 2539 flow [2025-04-14 01:19:11,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2539, PETRI_PLACES=131, PETRI_TRANSITIONS=208} [2025-04-14 01:19:11,819 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2025-04-14 01:19:11,819 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 208 transitions, 2539 flow [2025-04-14 01:19:11,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:11,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:11,819 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:11,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:19:11,819 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:19:11,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1133306092, now seen corresponding path program 3 times [2025-04-14 01:19:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:11,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-14 01:19:11,820 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:11,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:11,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:11,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:11,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:12,126 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:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:12,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-14 01:19:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421890097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339820466] [2025-04-14 01:19:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:12,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:12,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:12,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:12,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:12,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 208 transitions, 2539 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:12,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:12,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:12,836 INFO L116 PetriNetUnfolderBase]: 3843/6040 cut-off events. [2025-04-14 01:19:12,837 INFO L117 PetriNetUnfolderBase]: For 36554/36554 co-relation queries the response was YES. [2025-04-14 01:19:12,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26692 conditions, 6040 events. 3843/6040 cut-off events. For 36554/36554 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 35141 event pairs, 763 based on Foata normal form. 2/5291 useless extension candidates. Maximal degree in co-relation 26639. Up to 1572 conditions per place. [2025-04-14 01:19:12,868 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 179 selfloop transitions, 106 changer transitions 19/305 dead transitions. [2025-04-14 01:19:12,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 305 transitions, 3630 flow [2025-04-14 01:19:12,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:19:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:19:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2025-04-14 01:19:12,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42245989304812837 [2025-04-14 01:19:12,869 INFO L175 Difference]: Start difference. First operand has 131 places, 208 transitions, 2539 flow. Second operand 11 states and 158 transitions. [2025-04-14 01:19:12,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 305 transitions, 3630 flow [2025-04-14 01:19:13,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 305 transitions, 3357 flow, removed 58 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:13,092 INFO L231 Difference]: Finished difference. Result has 138 places, 221 transitions, 2679 flow [2025-04-14 01:19:13,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2679, PETRI_PLACES=138, PETRI_TRANSITIONS=221} [2025-04-14 01:19:13,093 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2025-04-14 01:19:13,093 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 221 transitions, 2679 flow [2025-04-14 01:19:13,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:13,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:13,093 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:13,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:19:13,093 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:19:13,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 176188588, now seen corresponding path program 4 times [2025-04-14 01:19:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:13,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784557467] [2025-04-14 01:19:13,094 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:13,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:13,098 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:13,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:13,110 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:13,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:13,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784557467] [2025-04-14 01:19:13,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784557467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:13,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775972844] [2025-04-14 01:19:13,800 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:13,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:13,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:13,802 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:19:13,804 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:19:13,842 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:13,866 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:13,866 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:13,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:13,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:19:13,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:13,897 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 23 treesize of output 1 [2025-04-14 01:19:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:14,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:14,500 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:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775972844] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:19:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 33 [2025-04-14 01:19:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696241919] [2025-04-14 01:19:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:14,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:14,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:14,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:19:14,501 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:14,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 221 transitions, 2679 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:14,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:14,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:16,250 INFO L116 PetriNetUnfolderBase]: 4508/7225 cut-off events. [2025-04-14 01:19:16,251 INFO L117 PetriNetUnfolderBase]: For 31073/31073 co-relation queries the response was YES. [2025-04-14 01:19:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29440 conditions, 7225 events. 4508/7225 cut-off events. For 31073/31073 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 44271 event pairs, 1101 based on Foata normal form. 2/6410 useless extension candidates. Maximal degree in co-relation 29366. Up to 2901 conditions per place. [2025-04-14 01:19:16,285 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 220 selfloop transitions, 107 changer transitions 24/352 dead transitions. [2025-04-14 01:19:16,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 352 transitions, 4110 flow [2025-04-14 01:19:16,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:19:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:19:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2025-04-14 01:19:16,287 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4534313725490196 [2025-04-14 01:19:16,287 INFO L175 Difference]: Start difference. First operand has 138 places, 221 transitions, 2679 flow. Second operand 12 states and 185 transitions. [2025-04-14 01:19:16,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 352 transitions, 4110 flow [2025-04-14 01:19:16,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 352 transitions, 3888 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:16,513 INFO L231 Difference]: Finished difference. Result has 146 places, 242 transitions, 3046 flow [2025-04-14 01:19:16,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3046, PETRI_PLACES=146, PETRI_TRANSITIONS=242} [2025-04-14 01:19:16,513 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 111 predicate places. [2025-04-14 01:19:16,513 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 242 transitions, 3046 flow [2025-04-14 01:19:16,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:16,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:16,514 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:16,519 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:19:16,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:16,714 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:19:16,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:16,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1984897350, now seen corresponding path program 5 times [2025-04-14 01:19:16,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:16,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569242198] [2025-04-14 01:19:16,715 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:16,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:16,719 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:16,728 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:16,728 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:16,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:17,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569242198] [2025-04-14 01:19:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569242198] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:17,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489314938] [2025-04-14 01:19:17,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:17,978 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:19:17,978 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:19:18,016 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:18,030 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:18,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:18,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:18,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:19:18,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:18,067 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:19:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:18,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:19,009 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 78 treesize of output 70 [2025-04-14 01:19:19,036 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:19:19,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-04-14 01:19:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489314938] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:19,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:19:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162387165] [2025-04-14 01:19:19,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:19,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:19:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:19,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:19:19,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:19:19,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:19,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 242 transitions, 3046 flow. Second operand has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:19,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:19,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:19,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:23,173 INFO L116 PetriNetUnfolderBase]: 5352/8583 cut-off events. [2025-04-14 01:19:23,173 INFO L117 PetriNetUnfolderBase]: For 39586/39586 co-relation queries the response was YES. [2025-04-14 01:19:23,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35250 conditions, 8583 events. 5352/8583 cut-off events. For 39586/39586 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 54185 event pairs, 1285 based on Foata normal form. 3/7581 useless extension candidates. Maximal degree in co-relation 35172. Up to 1917 conditions per place. [2025-04-14 01:19:23,209 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 337 selfloop transitions, 157 changer transitions 66/561 dead transitions. [2025-04-14 01:19:23,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 561 transitions, 5588 flow [2025-04-14 01:19:23,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:19:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:19:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 564 transitions. [2025-04-14 01:19:23,210 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3949579831932773 [2025-04-14 01:19:23,210 INFO L175 Difference]: Start difference. First operand has 146 places, 242 transitions, 3046 flow. Second operand 42 states and 564 transitions. [2025-04-14 01:19:23,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 561 transitions, 5588 flow [2025-04-14 01:19:23,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 561 transitions, 5384 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:23,509 INFO L231 Difference]: Finished difference. Result has 195 places, 288 transitions, 3855 flow [2025-04-14 01:19:23,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2894, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3855, PETRI_PLACES=195, PETRI_TRANSITIONS=288} [2025-04-14 01:19:23,509 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 160 predicate places. [2025-04-14 01:19:23,509 INFO L485 AbstractCegarLoop]: Abstraction has has 195 places, 288 transitions, 3855 flow [2025-04-14 01:19:23,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:23,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:23,510 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:23,516 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:19:23,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:23,711 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:19:23,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:23,711 INFO L85 PathProgramCache]: Analyzing trace with hash -210084704, now seen corresponding path program 6 times [2025-04-14 01:19:23,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:23,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646675463] [2025-04-14 01:19:23,711 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:23,715 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:23,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:23,723 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:19:23,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:23,917 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:23,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:23,918 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646675463] [2025-04-14 01:19:23,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646675463] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:23,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:23,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:23,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182145526] [2025-04-14 01:19:23,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:23,918 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:23,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:23,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:23,919 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:23,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 288 transitions, 3855 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:23,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:23,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:23,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:24,959 INFO L116 PetriNetUnfolderBase]: 5509/8823 cut-off events. [2025-04-14 01:19:24,959 INFO L117 PetriNetUnfolderBase]: For 51346/51353 co-relation queries the response was YES. [2025-04-14 01:19:24,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37670 conditions, 8823 events. 5509/8823 cut-off events. For 51346/51353 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 55776 event pairs, 1823 based on Foata normal form. 6/7772 useless extension candidates. Maximal degree in co-relation 37559. Up to 3035 conditions per place. [2025-04-14 01:19:25,005 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 203 selfloop transitions, 133 changer transitions 20/357 dead transitions. [2025-04-14 01:19:25,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 357 transitions, 4917 flow [2025-04-14 01:19:25,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:19:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:19:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-04-14 01:19:25,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2025-04-14 01:19:25,007 INFO L175 Difference]: Start difference. First operand has 195 places, 288 transitions, 3855 flow. Second operand 10 states and 143 transitions. [2025-04-14 01:19:25,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 357 transitions, 4917 flow [2025-04-14 01:19:25,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 357 transitions, 4742 flow, removed 68 selfloop flow, removed 18 redundant places. [2025-04-14 01:19:25,423 INFO L231 Difference]: Finished difference. Result has 182 places, 298 transitions, 4211 flow [2025-04-14 01:19:25,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3706, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4211, PETRI_PLACES=182, PETRI_TRANSITIONS=298} [2025-04-14 01:19:25,423 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 147 predicate places. [2025-04-14 01:19:25,424 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 298 transitions, 4211 flow [2025-04-14 01:19:25,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:25,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:25,424 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:25,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 01:19:25,424 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:19:25,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:25,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1990908954, now seen corresponding path program 7 times [2025-04-14 01:19:25,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:25,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923320706] [2025-04-14 01:19:25,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:25,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:25,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:19:25,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:25,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:25,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:26,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:26,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:26,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923320706] [2025-04-14 01:19:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923320706] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:26,090 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943188086] [2025-04-14 01:19:26,090 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:26,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:26,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:26,094 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:19:26,095 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:19:26,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:19:26,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:26,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:26,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:26,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:19:26,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:26,223 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:19:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:26,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:27,296 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 78 treesize of output 70 [2025-04-14 01:19:27,344 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:19:27,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-04-14 01:19:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943188086] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:27,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2025-04-14 01:19:27,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360474823] [2025-04-14 01:19:27,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:27,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:19:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:19:27,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:19:27,559 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:27,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 298 transitions, 4211 flow. Second operand has 36 states, 36 states have (on average 6.166666666666667) internal successors, (222), 36 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:27,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:27,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:27,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:32,809 INFO L116 PetriNetUnfolderBase]: 5969/9607 cut-off events. [2025-04-14 01:19:32,809 INFO L117 PetriNetUnfolderBase]: For 67982/67989 co-relation queries the response was YES. [2025-04-14 01:19:32,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41257 conditions, 9607 events. 5969/9607 cut-off events. For 67982/67989 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 62047 event pairs, 1956 based on Foata normal form. 7/8455 useless extension candidates. Maximal degree in co-relation 41169. Up to 2341 conditions per place. [2025-04-14 01:19:32,857 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 350 selfloop transitions, 157 changer transitions 50/558 dead transitions. [2025-04-14 01:19:32,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 558 transitions, 6325 flow [2025-04-14 01:19:32,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-14 01:19:32,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-04-14 01:19:32,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 520 transitions. [2025-04-14 01:19:32,859 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37302725968436157 [2025-04-14 01:19:32,859 INFO L175 Difference]: Start difference. First operand has 182 places, 298 transitions, 4211 flow. Second operand 41 states and 520 transitions. [2025-04-14 01:19:32,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 558 transitions, 6325 flow [2025-04-14 01:19:33,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 558 transitions, 6193 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-14 01:19:33,399 INFO L231 Difference]: Finished difference. Result has 224 places, 316 transitions, 4746 flow [2025-04-14 01:19:33,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4094, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=4746, PETRI_PLACES=224, PETRI_TRANSITIONS=316} [2025-04-14 01:19:33,400 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 189 predicate places. [2025-04-14 01:19:33,400 INFO L485 AbstractCegarLoop]: Abstraction has has 224 places, 316 transitions, 4746 flow [2025-04-14 01:19:33,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.166666666666667) internal successors, (222), 36 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:33,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:33,400 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:33,406 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:19:33,600 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:33,601 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:19:33,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash 683846530, now seen corresponding path program 8 times [2025-04-14 01:19:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:33,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330866300] [2025-04-14 01:19:33,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:33,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:33,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:33,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:33,926 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:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:33,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330866300] [2025-04-14 01:19:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330866300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694384888] [2025-04-14 01:19:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:33,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:33,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:33,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:33,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:33,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 316 transitions, 4746 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:33,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:33,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:33,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:35,256 INFO L116 PetriNetUnfolderBase]: 6041/9706 cut-off events. [2025-04-14 01:19:35,257 INFO L117 PetriNetUnfolderBase]: For 78603/78610 co-relation queries the response was YES. [2025-04-14 01:19:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42962 conditions, 9706 events. 6041/9706 cut-off events. For 78603/78610 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 62894 event pairs, 2160 based on Foata normal form. 6/8529 useless extension candidates. Maximal degree in co-relation 42857. Up to 3581 conditions per place. [2025-04-14 01:19:35,327 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 223 selfloop transitions, 133 changer transitions 20/377 dead transitions. [2025-04-14 01:19:35,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 377 transitions, 5765 flow [2025-04-14 01:19:35,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:19:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:19:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2025-04-14 01:19:35,328 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40294117647058825 [2025-04-14 01:19:35,328 INFO L175 Difference]: Start difference. First operand has 224 places, 316 transitions, 4746 flow. Second operand 10 states and 137 transitions. [2025-04-14 01:19:35,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 377 transitions, 5765 flow [2025-04-14 01:19:36,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 377 transitions, 5621 flow, removed 35 selfloop flow, removed 18 redundant places. [2025-04-14 01:19:36,047 INFO L231 Difference]: Finished difference. Result has 213 places, 321 transitions, 5015 flow [2025-04-14 01:19:36,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4612, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5015, PETRI_PLACES=213, PETRI_TRANSITIONS=321} [2025-04-14 01:19:36,048 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 178 predicate places. [2025-04-14 01:19:36,048 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 321 transitions, 5015 flow [2025-04-14 01:19:36,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:36,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:36,048 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:36,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 01:19:36,048 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:19:36,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash -606433940, now seen corresponding path program 9 times [2025-04-14 01:19:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:36,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649464514] [2025-04-14 01:19:36,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:36,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:36,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:36,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:36,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:36,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:36,255 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:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:36,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649464514] [2025-04-14 01:19:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649464514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398717072] [2025-04-14 01:19:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:36,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:36,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:36,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:36,256 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:36,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 321 transitions, 5015 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:36,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:36,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:36,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:37,580 INFO L116 PetriNetUnfolderBase]: 6591/10516 cut-off events. [2025-04-14 01:19:37,580 INFO L117 PetriNetUnfolderBase]: For 103328/103331 co-relation queries the response was YES. [2025-04-14 01:19:37,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47983 conditions, 10516 events. 6591/10516 cut-off events. For 103328/103331 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 68320 event pairs, 2164 based on Foata normal form. 5/9199 useless extension candidates. Maximal degree in co-relation 47889. Up to 3901 conditions per place. [2025-04-14 01:19:37,640 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 232 selfloop transitions, 160 changer transitions 20/413 dead transitions. [2025-04-14 01:19:37,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 413 transitions, 6667 flow [2025-04-14 01:19:37,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:19:37,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:19:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-04-14 01:19:37,641 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4147058823529412 [2025-04-14 01:19:37,641 INFO L175 Difference]: Start difference. First operand has 213 places, 321 transitions, 5015 flow. Second operand 10 states and 141 transitions. [2025-04-14 01:19:37,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 413 transitions, 6667 flow [2025-04-14 01:19:38,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 413 transitions, 6429 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:38,530 INFO L231 Difference]: Finished difference. Result has 218 places, 352 transitions, 5791 flow [2025-04-14 01:19:38,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4810, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5791, PETRI_PLACES=218, PETRI_TRANSITIONS=352} [2025-04-14 01:19:38,531 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 183 predicate places. [2025-04-14 01:19:38,531 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 352 transitions, 5791 flow [2025-04-14 01:19:38,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:38,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:38,531 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:38,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:19:38,531 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:19:38,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash -865417440, now seen corresponding path program 10 times [2025-04-14 01:19:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:38,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215199054] [2025-04-14 01:19:38,532 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:38,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:38,583 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:38,583 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:38,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:39,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:39,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215199054] [2025-04-14 01:19:39,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215199054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:39,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925036859] [2025-04-14 01:19:39,522 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:39,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:39,524 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:19:39,525 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:19:39,569 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:39,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:39,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:39,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:39,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:19:39,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:39,630 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:19:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:39,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:40,580 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 78 treesize of output 70 [2025-04-14 01:19:40,605 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:19:40,605 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 142 [2025-04-14 01:19:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:40,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925036859] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:40,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2025-04-14 01:19:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413174059] [2025-04-14 01:19:40,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:40,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 01:19:40,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:40,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 01:19:40,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 01:19:40,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 352 transitions, 5791 flow. Second operand has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:40,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:45,292 INFO L116 PetriNetUnfolderBase]: 8477/13439 cut-off events. [2025-04-14 01:19:45,293 INFO L117 PetriNetUnfolderBase]: For 152986/152989 co-relation queries the response was YES. [2025-04-14 01:19:45,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63568 conditions, 13439 events. 8477/13439 cut-off events. For 152986/152989 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 89919 event pairs, 1870 based on Foata normal form. 6/11704 useless extension candidates. Maximal degree in co-relation 63465. Up to 3954 conditions per place. [2025-04-14 01:19:45,379 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 417 selfloop transitions, 240 changer transitions 61/719 dead transitions. [2025-04-14 01:19:45,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 719 transitions, 9757 flow [2025-04-14 01:19:45,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 01:19:45,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-04-14 01:19:45,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 602 transitions. [2025-04-14 01:19:45,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.376720901126408 [2025-04-14 01:19:45,380 INFO L175 Difference]: Start difference. First operand has 218 places, 352 transitions, 5791 flow. Second operand 47 states and 602 transitions. [2025-04-14 01:19:45,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 719 transitions, 9757 flow [2025-04-14 01:19:47,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 719 transitions, 9565 flow, removed 51 selfloop flow, removed 4 redundant places. [2025-04-14 01:19:47,122 INFO L231 Difference]: Finished difference. Result has 282 places, 424 transitions, 7821 flow [2025-04-14 01:19:47,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5635, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=7821, PETRI_PLACES=282, PETRI_TRANSITIONS=424} [2025-04-14 01:19:47,123 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 247 predicate places. [2025-04-14 01:19:47,123 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 424 transitions, 7821 flow [2025-04-14 01:19:47,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 6.081081081081081) internal successors, (225), 37 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have 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:47,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:47,126 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:47,132 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:19:47,328 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,SelfDestructingSolverStorable23 [2025-04-14 01:19:47,328 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:19:47,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 953884916, now seen corresponding path program 11 times [2025-04-14 01:19:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:47,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324969551] [2025-04-14 01:19:47,329 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:47,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:47,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:47,345 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:48,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324969551] [2025-04-14 01:19:48,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324969551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:48,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765159216] [2025-04-14 01:19:48,172 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:48,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:48,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:48,174 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:19:48,175 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:19:48,216 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:48,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:19:48,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:48,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:19:48,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:48,278 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:19:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:48,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:49,168 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 80 treesize of output 72 [2025-04-14 01:19:49,196 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:19:49,196 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 148 [2025-04-14 01:19:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:19:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765159216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:49,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-04-14 01:19:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300626146] [2025-04-14 01:19:49,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:49,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:19:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:49,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:19:49,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1019, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:19:49,503 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:49,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 424 transitions, 7821 flow. Second operand has 36 states, 36 states have (on average 6.138888888888889) internal successors, (221), 36 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have 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:49,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:49,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:53,649 INFO L116 PetriNetUnfolderBase]: 9002/14282 cut-off events. [2025-04-14 01:19:53,649 INFO L117 PetriNetUnfolderBase]: For 194198/194201 co-relation queries the response was YES. [2025-04-14 01:19:53,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71277 conditions, 14282 events. 9002/14282 cut-off events. For 194198/194201 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 96906 event pairs, 3005 based on Foata normal form. 6/12418 useless extension candidates. Maximal degree in co-relation 71128. Up to 2573 conditions per place. [2025-04-14 01:19:53,746 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 409 selfloop transitions, 235 changer transitions 47/692 dead transitions. [2025-04-14 01:19:53,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 692 transitions, 10708 flow [2025-04-14 01:19:53,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:19:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:19:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 499 transitions. [2025-04-14 01:19:53,748 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3862229102167183 [2025-04-14 01:19:53,748 INFO L175 Difference]: Start difference. First operand has 282 places, 424 transitions, 7821 flow. Second operand 38 states and 499 transitions. [2025-04-14 01:19:53,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 692 transitions, 10708 flow [2025-04-14 01:19:55,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 692 transitions, 10060 flow, removed 130 selfloop flow, removed 23 redundant places. [2025-04-14 01:19:55,745 INFO L231 Difference]: Finished difference. Result has 299 places, 458 transitions, 8465 flow [2025-04-14 01:19:55,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7258, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8465, PETRI_PLACES=299, PETRI_TRANSITIONS=458} [2025-04-14 01:19:55,745 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 264 predicate places. [2025-04-14 01:19:55,745 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 458 transitions, 8465 flow [2025-04-14 01:19:55,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.138888888888889) internal successors, (221), 36 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have 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:55,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:55,746 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, 1, 1, 1, 1, 1] [2025-04-14 01:19:55,751 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:19:55,946 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,SelfDestructingSolverStorable24 [2025-04-14 01:19:55,946 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:19:55,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1768818036, now seen corresponding path program 12 times [2025-04-14 01:19:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:55,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025731613] [2025-04-14 01:19:55,947 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:55,952 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:19:55,960 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:19:55,960 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:19:55,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:56,166 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:56,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:56,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025731613] [2025-04-14 01:19:56,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025731613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:56,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:56,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277560831] [2025-04-14 01:19:56,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:56,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:56,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:56,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:56,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:56,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:19:56,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 458 transitions, 8465 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:56,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:56,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:19:56,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:58,284 INFO L116 PetriNetUnfolderBase]: 9293/14678 cut-off events. [2025-04-14 01:19:58,285 INFO L117 PetriNetUnfolderBase]: For 197890/197897 co-relation queries the response was YES. [2025-04-14 01:19:58,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73542 conditions, 14678 events. 9293/14678 cut-off events. For 197890/197897 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 99019 event pairs, 1983 based on Foata normal form. 9/12721 useless extension candidates. Maximal degree in co-relation 73403. Up to 4062 conditions per place. [2025-04-14 01:19:58,393 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 263 selfloop transitions, 255 changer transitions 20/539 dead transitions. [2025-04-14 01:19:58,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 539 transitions, 10077 flow [2025-04-14 01:19:58,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:19:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:19:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2025-04-14 01:19:58,395 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4197860962566845 [2025-04-14 01:19:58,395 INFO L175 Difference]: Start difference. First operand has 299 places, 458 transitions, 8465 flow. Second operand 11 states and 157 transitions. [2025-04-14 01:19:58,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 539 transitions, 10077 flow [2025-04-14 01:20:00,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 539 transitions, 9716 flow, removed 124 selfloop flow, removed 18 redundant places. [2025-04-14 01:20:00,712 INFO L231 Difference]: Finished difference. Result has 291 places, 472 transitions, 9146 flow [2025-04-14 01:20:00,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8112, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=241, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=9146, PETRI_PLACES=291, PETRI_TRANSITIONS=472} [2025-04-14 01:20:00,713 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 256 predicate places. [2025-04-14 01:20:00,713 INFO L485 AbstractCegarLoop]: Abstraction has has 291 places, 472 transitions, 9146 flow [2025-04-14 01:20:00,713 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:00,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:00,713 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, 1, 1, 1, 1, 1] [2025-04-14 01:20:00,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 01:20:00,713 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:20:00,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -2037993120, now seen corresponding path program 13 times [2025-04-14 01:20:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:00,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444363139] [2025-04-14 01:20:00,714 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:00,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:00,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:00,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:01,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:01,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444363139] [2025-04-14 01:20:01,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444363139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:01,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779204109] [2025-04-14 01:20:01,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:20:01,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:01,668 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:20:01,669 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:20:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:20:01,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:01,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:01,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:01,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:20:01,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:01,774 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:20:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:02,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:02,629 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 78 treesize of output 70 [2025-04-14 01:20:02,667 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:20:02,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-04-14 01:20:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:02,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779204109] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:02,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:02,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 34 [2025-04-14 01:20:02,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191660225] [2025-04-14 01:20:02,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:02,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:20:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:02,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:20:02,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1080, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:20:02,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:02,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 472 transitions, 9146 flow. Second operand has 36 states, 36 states have (on average 6.166666666666667) internal successors, (222), 36 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:02,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:02,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:02,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:08,960 INFO L116 PetriNetUnfolderBase]: 9551/15143 cut-off events. [2025-04-14 01:20:08,960 INFO L117 PetriNetUnfolderBase]: For 233698/233707 co-relation queries the response was YES. [2025-04-14 01:20:09,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77665 conditions, 15143 events. 9551/15143 cut-off events. For 233698/233707 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 103465 event pairs, 2431 based on Foata normal form. 11/13137 useless extension candidates. Maximal degree in co-relation 77538. Up to 2772 conditions per place. [2025-04-14 01:20:09,074 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 415 selfloop transitions, 273 changer transitions 39/728 dead transitions. [2025-04-14 01:20:09,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 728 transitions, 11794 flow [2025-04-14 01:20:09,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 01:20:09,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 01:20:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 506 transitions. [2025-04-14 01:20:09,076 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3720588235294118 [2025-04-14 01:20:09,076 INFO L175 Difference]: Start difference. First operand has 291 places, 472 transitions, 9146 flow. Second operand 40 states and 506 transitions. [2025-04-14 01:20:09,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 728 transitions, 11794 flow [2025-04-14 01:20:11,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 728 transitions, 11588 flow, removed 27 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:11,757 INFO L231 Difference]: Finished difference. Result has 332 places, 488 transitions, 9899 flow [2025-04-14 01:20:11,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8951, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=258, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=9899, PETRI_PLACES=332, PETRI_TRANSITIONS=488} [2025-04-14 01:20:11,757 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 297 predicate places. [2025-04-14 01:20:11,757 INFO L485 AbstractCegarLoop]: Abstraction has has 332 places, 488 transitions, 9899 flow [2025-04-14 01:20:11,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.166666666666667) internal successors, (222), 36 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have 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:11,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:11,758 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, 1, 1, 1, 1, 1] [2025-04-14 01:20:11,764 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:20:11,958 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,SelfDestructingSolverStorable26 [2025-04-14 01:20:11,958 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:20:11,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash -896717142, now seen corresponding path program 14 times [2025-04-14 01:20:11,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:11,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502584258] [2025-04-14 01:20:11,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:11,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:11,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:11,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:20:11,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:11,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:12,192 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:20:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:12,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502584258] [2025-04-14 01:20:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502584258] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:12,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:12,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201514786] [2025-04-14 01:20:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:12,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:12,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:12,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:12,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:12,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:12,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 488 transitions, 9899 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:12,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:12,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:12,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:14,740 INFO L116 PetriNetUnfolderBase]: 9669/15332 cut-off events. [2025-04-14 01:20:14,740 INFO L117 PetriNetUnfolderBase]: For 269723/269725 co-relation queries the response was YES. [2025-04-14 01:20:14,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80558 conditions, 15332 events. 9669/15332 cut-off events. For 269723/269725 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 105601 event pairs, 3490 based on Foata normal form. 4/13295 useless extension candidates. Maximal degree in co-relation 80412. Up to 5772 conditions per place. [2025-04-14 01:20:14,887 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 319 selfloop transitions, 207 changer transitions 20/547 dead transitions. [2025-04-14 01:20:14,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 547 transitions, 11306 flow [2025-04-14 01:20:14,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2025-04-14 01:20:14,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39705882352941174 [2025-04-14 01:20:14,888 INFO L175 Difference]: Start difference. First operand has 332 places, 488 transitions, 9899 flow. Second operand 10 states and 135 transitions. [2025-04-14 01:20:14,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 547 transitions, 11306 flow [2025-04-14 01:20:18,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 547 transitions, 10904 flow, removed 46 selfloop flow, removed 25 redundant places. [2025-04-14 01:20:18,035 INFO L231 Difference]: Finished difference. Result has 315 places, 492 transitions, 10103 flow [2025-04-14 01:20:18,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9512, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10103, PETRI_PLACES=315, PETRI_TRANSITIONS=492} [2025-04-14 01:20:18,036 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 280 predicate places. [2025-04-14 01:20:18,036 INFO L485 AbstractCegarLoop]: Abstraction has has 315 places, 492 transitions, 10103 flow [2025-04-14 01:20:18,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:18,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:18,036 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, 1, 1, 1, 1, 1] [2025-04-14 01:20:18,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 01:20:18,036 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:20:18,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:18,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1271428502, now seen corresponding path program 15 times [2025-04-14 01:20:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:18,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017549158] [2025-04-14 01:20:18,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:18,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:18,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 27 statements. [2025-04-14 01:20:18,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:18,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:18,217 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:20:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:18,217 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017549158] [2025-04-14 01:20:18,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017549158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:18,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909072759] [2025-04-14 01:20:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:18,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:18,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:18,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:18,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:18,218 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:18,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 492 transitions, 10103 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:18,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:18,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:18,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:20,333 INFO L116 PetriNetUnfolderBase]: 9721/15422 cut-off events. [2025-04-14 01:20:20,334 INFO L117 PetriNetUnfolderBase]: For 283107/283107 co-relation queries the response was YES. [2025-04-14 01:20:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81138 conditions, 15422 events. 9721/15422 cut-off events. For 283107/283107 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 106555 event pairs, 3414 based on Foata normal form. 2/13367 useless extension candidates. Maximal degree in co-relation 81007. Up to 5508 conditions per place. [2025-04-14 01:20:20,475 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 323 selfloop transitions, 210 changer transitions 20/554 dead transitions. [2025-04-14 01:20:20,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 554 transitions, 11518 flow [2025-04-14 01:20:20,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-04-14 01:20:20,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4147058823529412 [2025-04-14 01:20:20,477 INFO L175 Difference]: Start difference. First operand has 315 places, 492 transitions, 10103 flow. Second operand 10 states and 141 transitions. [2025-04-14 01:20:20,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 554 transitions, 11518 flow [2025-04-14 01:20:23,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 554 transitions, 11185 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-04-14 01:20:23,376 INFO L231 Difference]: Finished difference. Result has 319 places, 497 transitions, 10390 flow [2025-04-14 01:20:23,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10390, PETRI_PLACES=319, PETRI_TRANSITIONS=497} [2025-04-14 01:20:23,377 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 284 predicate places. [2025-04-14 01:20:23,377 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 497 transitions, 10390 flow [2025-04-14 01:20:23,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:23,378 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, 1, 1, 1, 1, 1] [2025-04-14 01:20:23,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 01:20:23,378 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:20:23,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:23,381 INFO L85 PathProgramCache]: Analyzing trace with hash 138234236, now seen corresponding path program 16 times [2025-04-14 01:20:23,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:23,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899649424] [2025-04-14 01:20:23,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:23,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:23,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:23,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:23,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:24,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:24,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899649424] [2025-04-14 01:20:24,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899649424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:24,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314317875] [2025-04-14 01:20:24,133 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:24,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:24,135 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:20:24,135 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:20:24,178 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:24,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:24,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:24,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:24,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:20:24,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:24,233 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 23 treesize of output 1 [2025-04-14 01:20:24,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:24,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:24,815 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:20:24,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314317875] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:24,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:24,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 12] total 33 [2025-04-14 01:20:24,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792197254] [2025-04-14 01:20:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:24,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:24,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:24,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:20:24,817 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:24,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 497 transitions, 10390 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:24,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:24,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:24,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:27,682 INFO L116 PetriNetUnfolderBase]: 9847/15657 cut-off events. [2025-04-14 01:20:27,682 INFO L117 PetriNetUnfolderBase]: For 305086/305086 co-relation queries the response was YES. [2025-04-14 01:20:27,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83347 conditions, 15657 events. 9847/15657 cut-off events. For 305086/305086 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 109128 event pairs, 4868 based on Foata normal form. 2/13584 useless extension candidates. Maximal degree in co-relation 83214. Up to 10449 conditions per place. [2025-04-14 01:20:27,815 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 352 selfloop transitions, 186 changer transitions 25/564 dead transitions. [2025-04-14 01:20:27,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 564 transitions, 11895 flow [2025-04-14 01:20:27,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:27,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2025-04-14 01:20:27,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2025-04-14 01:20:27,816 INFO L175 Difference]: Start difference. First operand has 319 places, 497 transitions, 10390 flow. Second operand 10 states and 138 transitions. [2025-04-14 01:20:27,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 564 transitions, 11895 flow [2025-04-14 01:20:31,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 564 transitions, 11696 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:31,144 INFO L231 Difference]: Finished difference. Result has 325 places, 504 transitions, 10810 flow [2025-04-14 01:20:31,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10199, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=497, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10810, PETRI_PLACES=325, PETRI_TRANSITIONS=504} [2025-04-14 01:20:31,145 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 290 predicate places. [2025-04-14 01:20:31,145 INFO L485 AbstractCegarLoop]: Abstraction has has 325 places, 504 transitions, 10810 flow [2025-04-14 01:20:31,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:31,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:31,145 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, 1, 1, 1, 1, 1] [2025-04-14 01:20:31,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 01:20:31,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:31,346 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:20:31,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash -238134404, now seen corresponding path program 17 times [2025-04-14 01:20:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:31,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337911876] [2025-04-14 01:20:31,346 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:31,350 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:31,358 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:31,358 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:31,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337911876] [2025-04-14 01:20:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337911876] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:32,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61838195] [2025-04-14 01:20:32,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:32,927 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:20:32,928 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:20:32,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:20:33,054 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:20:33,054 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:33,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:20:33,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:33,100 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:20:33,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:33,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:33,874 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 78 treesize of output 70 [2025-04-14 01:20:33,899 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:20:33,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 138 [2025-04-14 01:20:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61838195] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:34,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2025-04-14 01:20:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415701155] [2025-04-14 01:20:34,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:34,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:20:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:34,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:20:34,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:20:34,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:34,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 504 transitions, 10810 flow. Second operand has 35 states, 35 states have (on average 6.228571428571429) internal successors, (218), 35 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:34,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:34,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:34,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:42,772 INFO L116 PetriNetUnfolderBase]: 10016/15983 cut-off events. [2025-04-14 01:20:42,773 INFO L117 PetriNetUnfolderBase]: For 336685/336685 co-relation queries the response was YES. [2025-04-14 01:20:42,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85316 conditions, 15983 events. 10016/15983 cut-off events. For 336685/336685 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 110933 event pairs, 3000 based on Foata normal form. 2/13878 useless extension candidates. Maximal degree in co-relation 85181. Up to 3042 conditions per place. [2025-04-14 01:20:42,918 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 455 selfloop transitions, 219 changer transitions 34/709 dead transitions. [2025-04-14 01:20:42,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 709 transitions, 13229 flow [2025-04-14 01:20:42,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:20:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:20:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 407 transitions. [2025-04-14 01:20:42,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38614800759013285 [2025-04-14 01:20:42,920 INFO L175 Difference]: Start difference. First operand has 325 places, 504 transitions, 10810 flow. Second operand 31 states and 407 transitions. [2025-04-14 01:20:42,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 709 transitions, 13229 flow [2025-04-14 01:20:46,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 709 transitions, 13103 flow, removed 49 selfloop flow, removed 5 redundant places. [2025-04-14 01:20:46,691 INFO L231 Difference]: Finished difference. Result has 354 places, 509 transitions, 11274 flow [2025-04-14 01:20:46,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10714, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=11274, PETRI_PLACES=354, PETRI_TRANSITIONS=509} [2025-04-14 01:20:46,692 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 319 predicate places. [2025-04-14 01:20:46,692 INFO L485 AbstractCegarLoop]: Abstraction has has 354 places, 509 transitions, 11274 flow [2025-04-14 01:20:46,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.228571428571429) internal successors, (218), 35 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:46,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:46,692 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:46,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 01:20:46,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:46,893 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:20:46,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1485845568, now seen corresponding path program 18 times [2025-04-14 01:20:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:46,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635709818] [2025-04-14 01:20:46,894 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:20:46,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:46,900 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 3 equivalence classes. [2025-04-14 01:20:46,908 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 28 statements. [2025-04-14 01:20:46,908 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:20:46,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:20:47,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:47,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635709818] [2025-04-14 01:20:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635709818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:47,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:47,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:47,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438396170] [2025-04-14 01:20:47,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:47,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:47,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:47,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:47,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:47,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:47,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 509 transitions, 11274 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:47,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:47,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:49,769 INFO L116 PetriNetUnfolderBase]: 10110/16101 cut-off events. [2025-04-14 01:20:49,769 INFO L117 PetriNetUnfolderBase]: For 368453/368453 co-relation queries the response was YES. [2025-04-14 01:20:49,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87723 conditions, 16101 events. 10110/16101 cut-off events. For 368453/368453 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 111558 event pairs, 3470 based on Foata normal form. 1/13955 useless extension candidates. Maximal degree in co-relation 87571. Up to 5507 conditions per place. [2025-04-14 01:20:49,902 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 338 selfloop transitions, 215 changer transitions 18/572 dead transitions. [2025-04-14 01:20:49,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 572 transitions, 12734 flow [2025-04-14 01:20:49,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-04-14 01:20:49,903 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2025-04-14 01:20:49,903 INFO L175 Difference]: Start difference. First operand has 354 places, 509 transitions, 11274 flow. Second operand 10 states and 143 transitions. [2025-04-14 01:20:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 572 transitions, 12734 flow [2025-04-14 01:20:53,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 572 transitions, 12315 flow, removed 21 selfloop flow, removed 24 redundant places. [2025-04-14 01:20:53,938 INFO L231 Difference]: Finished difference. Result has 339 places, 515 transitions, 11521 flow [2025-04-14 01:20:53,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10859, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11521, PETRI_PLACES=339, PETRI_TRANSITIONS=515} [2025-04-14 01:20:53,939 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 304 predicate places. [2025-04-14 01:20:53,939 INFO L485 AbstractCegarLoop]: Abstraction has has 339 places, 515 transitions, 11521 flow [2025-04-14 01:20:53,939 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:53,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:53,939 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:53,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 01:20:53,940 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:20:53,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:53,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1943446400, now seen corresponding path program 1 times [2025-04-14 01:20:53,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:53,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380773909] [2025-04-14 01:20:53,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:53,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:53,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:20:53,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:20:53,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:53,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:54,005 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:20:54,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:54,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380773909] [2025-04-14 01:20:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380773909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:20:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087698997] [2025-04-14 01:20:54,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:54,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:54,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:54,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:54,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:20:54,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 515 transitions, 11521 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:54,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:54,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:20:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:56,945 INFO L116 PetriNetUnfolderBase]: 11223/17685 cut-off events. [2025-04-14 01:20:56,945 INFO L117 PetriNetUnfolderBase]: For 410109/410109 co-relation queries the response was YES. [2025-04-14 01:20:57,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94516 conditions, 17685 events. 11223/17685 cut-off events. For 410109/410109 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 124189 event pairs, 2695 based on Foata normal form. 0/15167 useless extension candidates. Maximal degree in co-relation 94376. Up to 5763 conditions per place. [2025-04-14 01:20:57,139 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 748 selfloop transitions, 45 changer transitions 23/817 dead transitions. [2025-04-14 01:20:57,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 817 transitions, 19521 flow [2025-04-14 01:20:57,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:20:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:20:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2025-04-14 01:20:57,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5168067226890757 [2025-04-14 01:20:57,142 INFO L175 Difference]: Start difference. First operand has 339 places, 515 transitions, 11521 flow. Second operand 7 states and 123 transitions. [2025-04-14 01:20:57,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 817 transitions, 19521 flow [2025-04-14 01:21:02,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 817 transitions, 19185 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-04-14 01:21:02,440 INFO L231 Difference]: Finished difference. Result has 338 places, 532 transitions, 11609 flow [2025-04-14 01:21:02,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11275, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11609, PETRI_PLACES=338, PETRI_TRANSITIONS=532} [2025-04-14 01:21:02,441 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 303 predicate places. [2025-04-14 01:21:02,441 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 532 transitions, 11609 flow [2025-04-14 01:21:02,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:21:02,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:02,441 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:02,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-14 01:21:02,441 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:21:02,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -980575434, now seen corresponding path program 2 times [2025-04-14 01:21:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:02,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396018988] [2025-04-14 01:21:02,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:02,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:02,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:02,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:02,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:02,526 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:21:02,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:02,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396018988] [2025-04-14 01:21:02,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396018988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:02,527 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832659932] [2025-04-14 01:21:02,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:02,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:02,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:02,531 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:21:02,533 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:21:02,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:02,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:02,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:02,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:02,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:02,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:02,623 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:21:02,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:21:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832659932] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:02,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:21:02,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-14 01:21:02,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499631440] [2025-04-14 01:21:02,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:02,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:21:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:02,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:21:02,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:02,624 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:02,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 532 transitions, 11609 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:02,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:02,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:05,263 INFO L116 PetriNetUnfolderBase]: 11067/17546 cut-off events. [2025-04-14 01:21:05,263 INFO L117 PetriNetUnfolderBase]: For 410245/410245 co-relation queries the response was YES. [2025-04-14 01:21:05,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101257 conditions, 17546 events. 11067/17546 cut-off events. For 410245/410245 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 123809 event pairs, 5837 based on Foata normal form. 144/15844 useless extension candidates. Maximal degree in co-relation 100787. Up to 15113 conditions per place. [2025-04-14 01:21:05,410 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 576 selfloop transitions, 36 changer transitions 21/634 dead transitions. [2025-04-14 01:21:05,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 634 transitions, 15001 flow [2025-04-14 01:21:05,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-14 01:21:05,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2025-04-14 01:21:05,411 INFO L175 Difference]: Start difference. First operand has 338 places, 532 transitions, 11609 flow. Second operand 5 states and 78 transitions. [2025-04-14 01:21:05,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 634 transitions, 15001 flow [2025-04-14 01:21:10,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 634 transitions, 14842 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:11,000 INFO L231 Difference]: Finished difference. Result has 342 places, 532 transitions, 11485 flow [2025-04-14 01:21:11,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11428, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11485, PETRI_PLACES=342, PETRI_TRANSITIONS=532} [2025-04-14 01:21:11,001 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 307 predicate places. [2025-04-14 01:21:11,001 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 532 transitions, 11485 flow [2025-04-14 01:21:11,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:11,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:11,001 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:11,007 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:21:11,201 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:11,202 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:21:11,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1543488190, now seen corresponding path program 1 times [2025-04-14 01:21:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:11,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124809974] [2025-04-14 01:21:11,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:11,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:21:11,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:11,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:11,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:11,270 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:21:11,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:11,270 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124809974] [2025-04-14 01:21:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124809974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:11,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079155731] [2025-04-14 01:21:11,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:11,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:11,273 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:21:11,275 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:21:11,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:21:11,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:11,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:11,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:11,354 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:21:11,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:11,380 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:21:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079155731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:11,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:11,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 01:21:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655152193] [2025-04-14 01:21:11,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:11,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:21:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:11,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:21:11,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:21:11,382 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:11,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 532 transitions, 11485 flow. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:21:11,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:11,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:14,217 INFO L116 PetriNetUnfolderBase]: 11619/18332 cut-off events. [2025-04-14 01:21:14,217 INFO L117 PetriNetUnfolderBase]: For 417954/417954 co-relation queries the response was YES. [2025-04-14 01:21:14,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109541 conditions, 18332 events. 11619/18332 cut-off events. For 417954/417954 co-relation queries the response was YES. Maximal size of possible extension queue 914. Compared 129123 event pairs, 5844 based on Foata normal form. 184/16634 useless extension candidates. Maximal degree in co-relation 108994. Up to 15227 conditions per place. [2025-04-14 01:21:14,397 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 651 selfloop transitions, 46 changer transitions 14/712 dead transitions. [2025-04-14 01:21:14,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 712 transitions, 16183 flow [2025-04-14 01:21:14,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:21:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:21:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2025-04-14 01:21:14,398 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43014705882352944 [2025-04-14 01:21:14,398 INFO L175 Difference]: Start difference. First operand has 342 places, 532 transitions, 11485 flow. Second operand 8 states and 117 transitions. [2025-04-14 01:21:14,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 712 transitions, 16183 flow [2025-04-14 01:21:19,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 712 transitions, 16005 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-14 01:21:19,812 INFO L231 Difference]: Finished difference. Result has 346 places, 543 transitions, 11537 flow [2025-04-14 01:21:19,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11321, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11537, PETRI_PLACES=346, PETRI_TRANSITIONS=543} [2025-04-14 01:21:19,813 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 311 predicate places. [2025-04-14 01:21:19,813 INFO L485 AbstractCegarLoop]: Abstraction has has 346 places, 543 transitions, 11537 flow [2025-04-14 01:21:19,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:21:19,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:19,813 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:19,821 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:21:20,013 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,SelfDestructingSolverStorable34 [2025-04-14 01:21:20,014 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:21:20,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -285062518, now seen corresponding path program 2 times [2025-04-14 01:21:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:20,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183617730] [2025-04-14 01:21:20,015 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:20,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:20,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:20,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:20,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:20,079 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:21:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:20,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183617730] [2025-04-14 01:21:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183617730] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:20,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:20,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902468170] [2025-04-14 01:21:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:20,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:21:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:20,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:21:20,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:21:20,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:20,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 543 transitions, 11537 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:20,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:20,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:20,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:23,309 INFO L116 PetriNetUnfolderBase]: 11714/18500 cut-off events. [2025-04-14 01:21:23,310 INFO L117 PetriNetUnfolderBase]: For 427584/427584 co-relation queries the response was YES. [2025-04-14 01:21:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115161 conditions, 18500 events. 11714/18500 cut-off events. For 427584/427584 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 130605 event pairs, 4410 based on Foata normal form. 97/17889 useless extension candidates. Maximal degree in co-relation 114583. Up to 9850 conditions per place. [2025-04-14 01:21:23,486 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 645 selfloop transitions, 33 changer transitions 61/740 dead transitions. [2025-04-14 01:21:23,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 740 transitions, 17428 flow [2025-04-14 01:21:23,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-14 01:21:23,491 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5235294117647059 [2025-04-14 01:21:23,491 INFO L175 Difference]: Start difference. First operand has 346 places, 543 transitions, 11537 flow. Second operand 5 states and 89 transitions. [2025-04-14 01:21:23,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 740 transitions, 17428 flow [2025-04-14 01:21:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 740 transitions, 17384 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-04-14 01:21:29,875 INFO L231 Difference]: Finished difference. Result has 350 places, 533 transitions, 11377 flow [2025-04-14 01:21:29,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11476, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11377, PETRI_PLACES=350, PETRI_TRANSITIONS=533} [2025-04-14 01:21:29,875 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 315 predicate places. [2025-04-14 01:21:29,876 INFO L485 AbstractCegarLoop]: Abstraction has has 350 places, 533 transitions, 11377 flow [2025-04-14 01:21:29,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:29,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:29,876 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:29,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-14 01:21:29,876 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:21:29,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1777293132, now seen corresponding path program 3 times [2025-04-14 01:21:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:29,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337211605] [2025-04-14 01:21:29,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:29,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:29,894 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:29,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:29,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:29,956 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:21:29,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:29,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337211605] [2025-04-14 01:21:29,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337211605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:29,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:29,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103137196] [2025-04-14 01:21:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:29,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:21:29,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:29,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:21:29,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:21:29,958 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:29,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 533 transitions, 11377 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:29,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:29,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:29,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:32,872 INFO L116 PetriNetUnfolderBase]: 10985/17401 cut-off events. [2025-04-14 01:21:32,872 INFO L117 PetriNetUnfolderBase]: For 412795/412795 co-relation queries the response was YES. [2025-04-14 01:21:32,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109729 conditions, 17401 events. 10985/17401 cut-off events. For 412795/412795 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 121799 event pairs, 5330 based on Foata normal form. 156/16849 useless extension candidates. Maximal degree in co-relation 109326. Up to 13785 conditions per place. [2025-04-14 01:21:33,022 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 533 selfloop transitions, 42 changer transitions 54/630 dead transitions. [2025-04-14 01:21:33,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 630 transitions, 15053 flow [2025-04-14 01:21:33,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 01:21:33,023 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4647058823529412 [2025-04-14 01:21:33,023 INFO L175 Difference]: Start difference. First operand has 350 places, 533 transitions, 11377 flow. Second operand 5 states and 79 transitions. [2025-04-14 01:21:33,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 630 transitions, 15053 flow [2025-04-14 01:21:38,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 630 transitions, 14622 flow, removed 34 selfloop flow, removed 12 redundant places. [2025-04-14 01:21:38,359 INFO L231 Difference]: Finished difference. Result has 341 places, 493 transitions, 9958 flow [2025-04-14 01:21:38,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10663, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9958, PETRI_PLACES=341, PETRI_TRANSITIONS=493} [2025-04-14 01:21:38,360 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 306 predicate places. [2025-04-14 01:21:38,360 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 493 transitions, 9958 flow [2025-04-14 01:21:38,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:38,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:38,360 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:38,360 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 01:21:38,360 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:21:38,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 473265196, now seen corresponding path program 3 times [2025-04-14 01:21:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:38,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280081045] [2025-04-14 01:21:38,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:38,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:38,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-04-14 01:21:38,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:21:38,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:38,419 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:21:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:38,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280081045] [2025-04-14 01:21:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280081045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:38,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:38,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:21:38,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110480875] [2025-04-14 01:21:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:38,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:21:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:38,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:21:38,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:21:38,420 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:38,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 493 transitions, 9958 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:38,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:38,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:38,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:40,987 INFO L116 PetriNetUnfolderBase]: 10438/16472 cut-off events. [2025-04-14 01:21:40,987 INFO L117 PetriNetUnfolderBase]: For 360765/360765 co-relation queries the response was YES. [2025-04-14 01:21:41,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101615 conditions, 16472 events. 10438/16472 cut-off events. For 360765/360765 co-relation queries the response was YES. Maximal size of possible extension queue 797. Compared 113592 event pairs, 4988 based on Foata normal form. 72/15372 useless extension candidates. Maximal degree in co-relation 101351. Up to 13062 conditions per place. [2025-04-14 01:21:41,188 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 532 selfloop transitions, 44 changer transitions 26/603 dead transitions. [2025-04-14 01:21:41,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 603 transitions, 13412 flow [2025-04-14 01:21:41,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-04-14 01:21:41,190 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4647058823529412 [2025-04-14 01:21:41,190 INFO L175 Difference]: Start difference. First operand has 341 places, 493 transitions, 9958 flow. Second operand 5 states and 79 transitions. [2025-04-14 01:21:41,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 603 transitions, 13412 flow [2025-04-14 01:21:45,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 603 transitions, 12612 flow, removed 29 selfloop flow, removed 14 redundant places. [2025-04-14 01:21:45,546 INFO L231 Difference]: Finished difference. Result has 327 places, 475 transitions, 8860 flow [2025-04-14 01:21:45,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9137, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=8860, PETRI_PLACES=327, PETRI_TRANSITIONS=475} [2025-04-14 01:21:45,547 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 292 predicate places. [2025-04-14 01:21:45,547 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 475 transitions, 8860 flow [2025-04-14 01:21:45,548 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:21:45,548 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:45,548 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:45,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-14 01:21:45,548 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:21:45,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1699891750, now seen corresponding path program 4 times [2025-04-14 01:21:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:45,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645846696] [2025-04-14 01:21:45,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:45,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:45,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:45,558 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:45,558 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:21:45,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:45,621 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:21:45,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:45,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645846696] [2025-04-14 01:21:45,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645846696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:45,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793927461] [2025-04-14 01:21:45,621 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:45,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:45,626 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:21:45,627 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:21:45,679 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:45,694 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:45,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:21:45,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:45,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:45,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:45,721 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:21:45,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:45,758 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:21:45,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793927461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:45,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:45,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-04-14 01:21:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846259063] [2025-04-14 01:21:45,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:45,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:21:45,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:45,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:21:45,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:21:45,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:45,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 475 transitions, 8860 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:21:45,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:45,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:45,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:48,428 INFO L116 PetriNetUnfolderBase]: 10766/16973 cut-off events. [2025-04-14 01:21:48,429 INFO L117 PetriNetUnfolderBase]: For 330836/330836 co-relation queries the response was YES. [2025-04-14 01:21:48,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102915 conditions, 16973 events. 10766/16973 cut-off events. For 330836/330836 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 117163 event pairs, 3336 based on Foata normal form. 118/15855 useless extension candidates. Maximal degree in co-relation 102337. Up to 7868 conditions per place. [2025-04-14 01:21:48,582 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 646 selfloop transitions, 69 changer transitions 20/736 dead transitions. [2025-04-14 01:21:48,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 736 transitions, 15032 flow [2025-04-14 01:21:48,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:21:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:21:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2025-04-14 01:21:48,583 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42058823529411765 [2025-04-14 01:21:48,583 INFO L175 Difference]: Start difference. First operand has 327 places, 475 transitions, 8860 flow. Second operand 10 states and 143 transitions. [2025-04-14 01:21:48,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 736 transitions, 15032 flow [2025-04-14 01:21:51,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 736 transitions, 14770 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:51,809 INFO L231 Difference]: Finished difference. Result has 334 places, 484 transitions, 8869 flow [2025-04-14 01:21:51,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8522, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8869, PETRI_PLACES=334, PETRI_TRANSITIONS=484} [2025-04-14 01:21:51,810 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 299 predicate places. [2025-04-14 01:21:51,810 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 484 transitions, 8869 flow [2025-04-14 01:21:51,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:21:51,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:51,810 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:51,817 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:21:52,011 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,SelfDestructingSolverStorable38 [2025-04-14 01:21:52,011 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:21:52,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1458882088, now seen corresponding path program 4 times [2025-04-14 01:21:52,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:52,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67047064] [2025-04-14 01:21:52,012 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:21:52,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:52,017 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:52,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:52,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:21:52,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:52,120 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:21:52,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:52,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67047064] [2025-04-14 01:21:52,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67047064] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:52,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:21:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777948679] [2025-04-14 01:21:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:52,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:52,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:52,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:52,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:52,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 484 transitions, 8869 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:21:52,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:52,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:52,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:55,040 INFO L116 PetriNetUnfolderBase]: 11823/18490 cut-off events. [2025-04-14 01:21:55,040 INFO L117 PetriNetUnfolderBase]: For 373581/373581 co-relation queries the response was YES. [2025-04-14 01:21:55,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118603 conditions, 18490 events. 11823/18490 cut-off events. For 373581/373581 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 127170 event pairs, 4205 based on Foata normal form. 36/18458 useless extension candidates. Maximal degree in co-relation 118052. Up to 11444 conditions per place. [2025-04-14 01:21:55,261 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 604 selfloop transitions, 65 changer transitions 13/683 dead transitions. [2025-04-14 01:21:55,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 683 transitions, 14050 flow [2025-04-14 01:21:55,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:21:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:21:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-14 01:21:55,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2025-04-14 01:21:55,262 INFO L175 Difference]: Start difference. First operand has 334 places, 484 transitions, 8869 flow. Second operand 5 states and 82 transitions. [2025-04-14 01:21:55,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 683 transitions, 14050 flow [2025-04-14 01:21:58,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 683 transitions, 13951 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:58,708 INFO L231 Difference]: Finished difference. Result has 338 places, 504 transitions, 9320 flow [2025-04-14 01:21:58,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8788, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9320, PETRI_PLACES=338, PETRI_TRANSITIONS=504} [2025-04-14 01:21:58,709 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 303 predicate places. [2025-04-14 01:21:58,709 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 504 transitions, 9320 flow [2025-04-14 01:21:58,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have 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:21:58,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:58,709 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:58,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-14 01:21:58,709 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:21:58,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1582644218, now seen corresponding path program 5 times [2025-04-14 01:21:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:58,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648776977] [2025-04-14 01:21:58,710 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:58,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:58,714 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:58,717 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:58,717 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:58,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:58,766 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:21:58,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:58,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648776977] [2025-04-14 01:21:58,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648776977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:58,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846586020] [2025-04-14 01:21:58,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:21:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:58,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:58,768 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:21:58,769 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:21:58,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:21:58,840 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:21:58,841 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:58,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:58,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:58,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:58,858 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:21:58,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:58,894 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:21:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846586020] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:58,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:58,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-04-14 01:21:58,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545207881] [2025-04-14 01:21:58,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:58,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 01:21:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:58,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 01:21:58,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 01:21:58,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:21:58,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 504 transitions, 9320 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:21:58,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:58,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:21:58,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:02,096 INFO L116 PetriNetUnfolderBase]: 12616/19887 cut-off events. [2025-04-14 01:22:02,097 INFO L117 PetriNetUnfolderBase]: For 418278/418278 co-relation queries the response was YES. [2025-04-14 01:22:02,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129115 conditions, 19887 events. 12616/19887 cut-off events. For 418278/418278 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 138574 event pairs, 2660 based on Foata normal form. 136/19955 useless extension candidates. Maximal degree in co-relation 128544. Up to 5799 conditions per place. [2025-04-14 01:22:02,298 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 663 selfloop transitions, 84 changer transitions 20/768 dead transitions. [2025-04-14 01:22:02,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 768 transitions, 15726 flow [2025-04-14 01:22:02,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:22:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:22:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2025-04-14 01:22:02,299 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-04-14 01:22:02,299 INFO L175 Difference]: Start difference. First operand has 338 places, 504 transitions, 9320 flow. Second operand 7 states and 112 transitions. [2025-04-14 01:22:02,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 768 transitions, 15726 flow [2025-04-14 01:22:06,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 768 transitions, 15646 flow, removed 40 selfloop flow, removed 0 redundant places. [2025-04-14 01:22:06,585 INFO L231 Difference]: Finished difference. Result has 347 places, 515 transitions, 9656 flow [2025-04-14 01:22:06,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9248, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9656, PETRI_PLACES=347, PETRI_TRANSITIONS=515} [2025-04-14 01:22:06,586 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 312 predicate places. [2025-04-14 01:22:06,586 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 515 transitions, 9656 flow [2025-04-14 01:22:06,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:22:06,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:06,586 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:06,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-14 01:22:06,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:06,787 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:22:06,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:06,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1259078150, now seen corresponding path program 5 times [2025-04-14 01:22:06,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:06,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366434388] [2025-04-14 01:22:06,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:06,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:06,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:22:06,795 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:06,795 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:06,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:06,835 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:22:06,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:06,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366434388] [2025-04-14 01:22:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366434388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:06,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:22:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:22:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644186201] [2025-04-14 01:22:06,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:06,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:22:06,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:06,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:22:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:22:06,836 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:06,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 515 transitions, 9656 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:06,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:06,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:10,432 INFO L116 PetriNetUnfolderBase]: 12652/20023 cut-off events. [2025-04-14 01:22:10,432 INFO L117 PetriNetUnfolderBase]: For 393513/393513 co-relation queries the response was YES. [2025-04-14 01:22:10,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126077 conditions, 20023 events. 12652/20023 cut-off events. For 393513/393513 co-relation queries the response was YES. Maximal size of possible extension queue 900. Compared 140805 event pairs, 5976 based on Foata normal form. 144/20099 useless extension candidates. Maximal degree in co-relation 125505. Up to 15859 conditions per place. [2025-04-14 01:22:10,627 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 535 selfloop transitions, 60 changer transitions 31/627 dead transitions. [2025-04-14 01:22:10,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 627 transitions, 13234 flow [2025-04-14 01:22:10,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:22:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:22:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-14 01:22:10,628 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45294117647058824 [2025-04-14 01:22:10,628 INFO L175 Difference]: Start difference. First operand has 347 places, 515 transitions, 9656 flow. Second operand 5 states and 77 transitions. [2025-04-14 01:22:10,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 627 transitions, 13234 flow [2025-04-14 01:22:14,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 627 transitions, 12891 flow, removed 29 selfloop flow, removed 7 redundant places. [2025-04-14 01:22:14,621 INFO L231 Difference]: Finished difference. Result has 347 places, 513 transitions, 9497 flow [2025-04-14 01:22:14,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9316, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9497, PETRI_PLACES=347, PETRI_TRANSITIONS=513} [2025-04-14 01:22:14,622 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 312 predicate places. [2025-04-14 01:22:14,622 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 513 transitions, 9497 flow [2025-04-14 01:22:14,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:14,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:14,622 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:14,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-14 01:22:14,622 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:22:14,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:14,623 INFO L85 PathProgramCache]: Analyzing trace with hash -695208818, now seen corresponding path program 6 times [2025-04-14 01:22:14,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:14,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286083242] [2025-04-14 01:22:14,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:14,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:14,628 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:22:14,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-04-14 01:22:14,634 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:22:14,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:14,680 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:22:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:14,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286083242] [2025-04-14 01:22:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286083242] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:22:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:22:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421900824] [2025-04-14 01:22:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:14,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:22:14,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:14,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:22:14,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:22:14,681 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:14,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 513 transitions, 9497 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:14,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:14,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:17,907 INFO L116 PetriNetUnfolderBase]: 12662/20121 cut-off events. [2025-04-14 01:22:17,907 INFO L117 PetriNetUnfolderBase]: For 395099/395099 co-relation queries the response was YES. [2025-04-14 01:22:18,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128443 conditions, 20121 events. 12662/20121 cut-off events. For 395099/395099 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 142264 event pairs, 4039 based on Foata normal form. 136/20189 useless extension candidates. Maximal degree in co-relation 127855. Up to 9196 conditions per place. [2025-04-14 01:22:18,366 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 573 selfloop transitions, 83 changer transitions 20/677 dead transitions. [2025-04-14 01:22:18,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 677 transitions, 13775 flow [2025-04-14 01:22:18,366 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:22:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:22:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-14 01:22:18,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2025-04-14 01:22:18,367 INFO L175 Difference]: Start difference. First operand has 347 places, 513 transitions, 9497 flow. Second operand 6 states and 87 transitions. [2025-04-14 01:22:18,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 677 transitions, 13775 flow [2025-04-14 01:22:22,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 677 transitions, 13583 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-04-14 01:22:22,169 INFO L231 Difference]: Finished difference. Result has 348 places, 513 transitions, 9511 flow [2025-04-14 01:22:22,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9289, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=9511, PETRI_PLACES=348, PETRI_TRANSITIONS=513} [2025-04-14 01:22:22,170 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 313 predicate places. [2025-04-14 01:22:22,170 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 513 transitions, 9511 flow [2025-04-14 01:22:22,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:22,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:22,170 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:22,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-14 01:22:22,170 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:22:22,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash 161714304, now seen corresponding path program 6 times [2025-04-14 01:22:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:22,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485821540] [2025-04-14 01:22:22,171 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:22,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:22,176 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:22:22,186 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:22,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:22,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:22,268 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:22:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:22,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485821540] [2025-04-14 01:22:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485821540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:22,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325094885] [2025-04-14 01:22:22,268 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:22,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:22,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:22,270 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:22:22,271 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:22:22,323 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:22:22,347 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:22,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:22,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:22,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:22:22,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:22,367 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:22:22,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:22:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325094885] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:22:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-04-14 01:22:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241393001] [2025-04-14 01:22:22,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:22,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:22:22,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:22:22,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:22:22,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:22,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 513 transitions, 9511 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:22,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:22,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:22,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:25,787 INFO L116 PetriNetUnfolderBase]: 12476/19844 cut-off events. [2025-04-14 01:22:25,787 INFO L117 PetriNetUnfolderBase]: For 381512/381512 co-relation queries the response was YES. [2025-04-14 01:22:25,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127744 conditions, 19844 events. 12476/19844 cut-off events. For 381512/381512 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 140411 event pairs, 4968 based on Foata normal form. 80/19856 useless extension candidates. Maximal degree in co-relation 127314. Up to 12495 conditions per place. [2025-04-14 01:22:25,959 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 571 selfloop transitions, 52 changer transitions 44/668 dead transitions. [2025-04-14 01:22:25,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 668 transitions, 13740 flow [2025-04-14 01:22:25,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:22:25,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:22:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-14 01:22:25,960 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:22:25,960 INFO L175 Difference]: Start difference. First operand has 348 places, 513 transitions, 9511 flow. Second operand 5 states and 85 transitions. [2025-04-14 01:22:25,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 668 transitions, 13740 flow [2025-04-14 01:22:29,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 668 transitions, 13632 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-04-14 01:22:29,777 INFO L231 Difference]: Finished difference. Result has 347 places, 496 transitions, 9187 flow [2025-04-14 01:22:29,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9328, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9187, PETRI_PLACES=347, PETRI_TRANSITIONS=496} [2025-04-14 01:22:29,778 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 312 predicate places. [2025-04-14 01:22:29,778 INFO L485 AbstractCegarLoop]: Abstraction has has 347 places, 496 transitions, 9187 flow [2025-04-14 01:22:29,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:29,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:29,778 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:29,784 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:22:29,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:29,979 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:22:29,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 774945244, now seen corresponding path program 7 times [2025-04-14 01:22:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:29,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075438311] [2025-04-14 01:22:29,980 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:22:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:29,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:22:29,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:29,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:30,028 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:22:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:30,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075438311] [2025-04-14 01:22:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075438311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:22:30,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:22:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 01:22:30,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751365951] [2025-04-14 01:22:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:22:30,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:22:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:30,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:22:30,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:22:30,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:30,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 496 transitions, 9187 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:30,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:30,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:30,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:32,507 INFO L116 PetriNetUnfolderBase]: 10942/17385 cut-off events. [2025-04-14 01:22:32,507 INFO L117 PetriNetUnfolderBase]: For 339923/339923 co-relation queries the response was YES. [2025-04-14 01:22:32,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111756 conditions, 17385 events. 10942/17385 cut-off events. For 339923/339923 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 119763 event pairs, 3568 based on Foata normal form. 147/17464 useless extension candidates. Maximal degree in co-relation 111594. Up to 8466 conditions per place. [2025-04-14 01:22:32,859 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 466 selfloop transitions, 77 changer transitions 47/591 dead transitions. [2025-04-14 01:22:32,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 591 transitions, 11949 flow [2025-04-14 01:22:32,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:22:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:22:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-14 01:22:32,860 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2025-04-14 01:22:32,860 INFO L175 Difference]: Start difference. First operand has 347 places, 496 transitions, 9187 flow. Second operand 5 states and 75 transitions. [2025-04-14 01:22:32,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 591 transitions, 11949 flow [2025-04-14 01:22:35,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 591 transitions, 11592 flow, removed 18 selfloop flow, removed 8 redundant places. [2025-04-14 01:22:35,977 INFO L231 Difference]: Finished difference. Result has 337 places, 452 transitions, 7932 flow [2025-04-14 01:22:35,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8373, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=7932, PETRI_PLACES=337, PETRI_TRANSITIONS=452} [2025-04-14 01:22:35,978 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 302 predicate places. [2025-04-14 01:22:35,978 INFO L485 AbstractCegarLoop]: Abstraction has has 337 places, 452 transitions, 7932 flow [2025-04-14 01:22:35,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:22:35,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:35,978 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, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:35,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-14 01:22:35,978 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:22:35,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -158679186, now seen corresponding path program 7 times [2025-04-14 01:22:35,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:35,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725762957] [2025-04-14 01:22:35,979 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:22:35,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:35,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:22:35,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:35,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:35,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:36,035 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:22:36,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:36,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725762957] [2025-04-14 01:22:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725762957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:36,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279870071] [2025-04-14 01:22:36,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:22:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:36,038 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:22:36,038 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:22:36,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:22:36,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:22:36,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:36,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:36,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:22:36,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:36,118 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:22:36,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:36,143 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:22:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279870071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:36,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:36,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-14 01:22:36,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113957812] [2025-04-14 01:22:36,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:36,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:22:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:36,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:22:36,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:22:36,144 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:36,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 452 transitions, 7932 flow. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:22:36,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:36,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:36,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:38,253 INFO L116 PetriNetUnfolderBase]: 9971/15770 cut-off events. [2025-04-14 01:22:38,253 INFO L117 PetriNetUnfolderBase]: For 281678/281678 co-relation queries the response was YES. [2025-04-14 01:22:38,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99571 conditions, 15770 events. 9971/15770 cut-off events. For 281678/281678 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 105858 event pairs, 4163 based on Foata normal form. 169/15871 useless extension candidates. Maximal degree in co-relation 99095. Up to 11776 conditions per place. [2025-04-14 01:22:38,420 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 481 selfloop transitions, 76 changer transitions 18/576 dead transitions. [2025-04-14 01:22:38,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 576 transitions, 10868 flow [2025-04-14 01:22:38,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:22:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:22:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2025-04-14 01:22:38,420 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4227941176470588 [2025-04-14 01:22:38,421 INFO L175 Difference]: Start difference. First operand has 337 places, 452 transitions, 7932 flow. Second operand 8 states and 115 transitions. [2025-04-14 01:22:38,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 576 transitions, 10868 flow [2025-04-14 01:22:41,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 576 transitions, 10446 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-04-14 01:22:41,055 INFO L231 Difference]: Finished difference. Result has 334 places, 431 transitions, 7076 flow [2025-04-14 01:22:41,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7253, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7076, PETRI_PLACES=334, PETRI_TRANSITIONS=431} [2025-04-14 01:22:41,056 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 299 predicate places. [2025-04-14 01:22:41,056 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 431 transitions, 7076 flow [2025-04-14 01:22:41,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 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:22:41,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:41,056 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:22:41,062 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:22:41,257 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,SelfDestructingSolverStorable45 [2025-04-14 01:22:41,257 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:22:41,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1754942890, now seen corresponding path program 1 times [2025-04-14 01:22:41,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:41,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559868807] [2025-04-14 01:22:41,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:22:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:41,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:22:41,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:22:41,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:41,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:42,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:42,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559868807] [2025-04-14 01:22:42,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559868807] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:42,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977088527] [2025-04-14 01:22:42,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:22:42,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:42,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:42,549 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:22:42,551 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:22:42,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:22:42,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:22:42,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:22:42,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:42,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-14 01:22:42,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:42,715 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:22:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:43,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:45,180 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 102 treesize of output 92 [2025-04-14 01:22:45,226 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-14 01:22:45,226 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 182 [2025-04-14 01:22:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977088527] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:47,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2025-04-14 01:22:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180508731] [2025-04-14 01:22:47,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:47,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-14 01:22:47,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:47,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-14 01:22:47,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1543, Unknown=0, NotChecked=0, Total=1806 [2025-04-14 01:22:47,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:22:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 431 transitions, 7076 flow. Second operand has 43 states, 43 states have (on average 6.069767441860465) internal successors, (261), 43 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have 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:22:47,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:47,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:22:47,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:56,161 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:22:59,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:03,075 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:07,109 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:11,355 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:17,472 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:21,485 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:26,443 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:31,207 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:35,232 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:39,260 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:43,286 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:23:45,606 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:01,054 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:08,397 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:16,395 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:22,131 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:28,987 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:33,980 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:38,819 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:44,711 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:51,090 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:24:54,579 INFO L116 PetriNetUnfolderBase]: 11719/18477 cut-off events. [2025-04-14 01:24:54,580 INFO L117 PetriNetUnfolderBase]: For 301408/301408 co-relation queries the response was YES. [2025-04-14 01:24:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115647 conditions, 18477 events. 11719/18477 cut-off events. For 301408/301408 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 125327 event pairs, 3991 based on Foata normal form. 3/18480 useless extension candidates. Maximal degree in co-relation 114487. Up to 9414 conditions per place. [2025-04-14 01:24:54,738 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 738 selfloop transitions, 172 changer transitions 84/995 dead transitions. [2025-04-14 01:24:54,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 995 transitions, 14572 flow [2025-04-14 01:24:54,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-14 01:24:54,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-14 01:24:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 640 transitions. [2025-04-14 01:24:54,739 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38415366146458585 [2025-04-14 01:24:54,739 INFO L175 Difference]: Start difference. First operand has 334 places, 431 transitions, 7076 flow. Second operand 49 states and 640 transitions. [2025-04-14 01:24:54,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 995 transitions, 14572 flow [2025-04-14 01:24:56,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 995 transitions, 13986 flow, removed 88 selfloop flow, removed 8 redundant places. [2025-04-14 01:24:56,928 INFO L231 Difference]: Finished difference. Result has 385 places, 507 transitions, 8943 flow [2025-04-14 01:24:56,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=6812, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=8943, PETRI_PLACES=385, PETRI_TRANSITIONS=507} [2025-04-14 01:24:56,929 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 350 predicate places. [2025-04-14 01:24:56,929 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 507 transitions, 8943 flow [2025-04-14 01:24:56,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.069767441860465) internal successors, (261), 43 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have 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:24:56,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:56,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:24:56,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-04-14 01:24:57,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-14 01:24:57,130 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:24:57,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:57,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1175188582, now seen corresponding path program 2 times [2025-04-14 01:24:57,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:57,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966106538] [2025-04-14 01:24:57,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:24:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:57,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:24:57,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:24:57,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:57,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:24:59,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:59,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966106538] [2025-04-14 01:24:59,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966106538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:59,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113879906] [2025-04-14 01:24:59,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:24:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:59,327 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:24:59,328 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:24:59,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:24:59,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:24:59,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:59,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:59,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-14 01:24:59,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:59,671 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 23 treesize of output 1 [2025-04-14 01:25:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:25:02,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:07,800 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 102 treesize of output 92 [2025-04-14 01:25:08,050 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-14 01:25:08,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 186 [2025-04-14 01:25:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:25:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113879906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:16,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 40 [2025-04-14 01:25:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168774002] [2025-04-14 01:25:16,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:16,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-14 01:25:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:16,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-14 01:25:16,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1500, Unknown=0, NotChecked=0, Total=1722 [2025-04-14 01:25:16,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:25:16,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 507 transitions, 8943 flow. Second operand has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have 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:25:16,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:16,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:25:16,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:30,602 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:34,683 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:38,719 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:40,667 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:25:44,722 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:11,703 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:16,496 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:18,623 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:22,697 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:27,648 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:31,732 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:32,810 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:36,913 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:51,263 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:55,882 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:26:57,197 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:01,214 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:02,772 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:06,781 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:09,524 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:14,827 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:20,682 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:24,742 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:35,733 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:40,299 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:44,404 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:27:48,440 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:10,652 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:14,707 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:18,791 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:19,953 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:23,958 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:26,580 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:30,590 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:36,162 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:41,859 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:45,902 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:49,976 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:54,007 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:28:58,978 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:00,539 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:04,554 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:05,601 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:09,697 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:14,966 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:19,439 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:21,391 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:25,499 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:30,479 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:41,679 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:44,749 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:48,852 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:52,890 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:29:54,564 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:30:19,583 INFO L116 PetriNetUnfolderBase]: 13296/20929 cut-off events. [2025-04-14 01:30:19,583 INFO L117 PetriNetUnfolderBase]: For 351789/351789 co-relation queries the response was YES. [2025-04-14 01:30:19,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131579 conditions, 20929 events. 13296/20929 cut-off events. For 351789/351789 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 143760 event pairs, 5117 based on Foata normal form. 3/20932 useless extension candidates. Maximal degree in co-relation 131385. Up to 9414 conditions per place. [2025-04-14 01:30:19,810 INFO L140 encePairwiseOnDemand]: 15/34 looper letters, 728 selfloop transitions, 174 changer transitions 74/977 dead transitions. [2025-04-14 01:30:19,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 977 transitions, 15479 flow [2025-04-14 01:30:19,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 01:30:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-14 01:30:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 531 transitions. [2025-04-14 01:30:19,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39044117647058824 [2025-04-14 01:30:19,812 INFO L175 Difference]: Start difference. First operand has 385 places, 507 transitions, 8943 flow. Second operand 40 states and 531 transitions. [2025-04-14 01:30:19,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 977 transitions, 15479 flow [2025-04-14 01:30:22,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 977 transitions, 14580 flow, removed 409 selfloop flow, removed 19 redundant places. [2025-04-14 01:30:22,610 INFO L231 Difference]: Finished difference. Result has 408 places, 569 transitions, 10064 flow [2025-04-14 01:30:22,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=8361, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=10064, PETRI_PLACES=408, PETRI_TRANSITIONS=569} [2025-04-14 01:30:22,611 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 373 predicate places. [2025-04-14 01:30:22,611 INFO L485 AbstractCegarLoop]: Abstraction has has 408 places, 569 transitions, 10064 flow [2025-04-14 01:30:22,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.142857142857143) internal successors, (258), 42 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have 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:30:22,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:22,611 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:30:22,618 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:30:22,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-14 01:30:22,812 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:30:22,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1550230024, now seen corresponding path program 3 times [2025-04-14 01:30:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:22,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201846436] [2025-04-14 01:30:22,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:30:22,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:22,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:30:22,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:30:22,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:30:22,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:25,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201846436] [2025-04-14 01:30:25,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201846436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:30:25,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967797888] [2025-04-14 01:30:25,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:30:25,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:30:25,399 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:30:25,399 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:30:25,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:30:25,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:30:25,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:30:25,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:25,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:30:25,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:30:25,799 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 23 treesize of output 1 [2025-04-14 01:30:28,853 INFO L325 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2025-04-14 01:30:28,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 43 [2025-04-14 01:30:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:29,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:30:38,961 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 102 treesize of output 92 [2025-04-14 01:30:39,218 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-14 01:30:39,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 182 [2025-04-14 01:30:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:30:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967797888] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:30:48,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:30:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 41 [2025-04-14 01:30:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247989814] [2025-04-14 01:30:48,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:30:48,157 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-14 01:30:48,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:48,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-14 01:30:48,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1584, Unknown=1, NotChecked=0, Total=1806 [2025-04-14 01:30:48,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:30:48,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 569 transitions, 10064 flow. Second operand has 43 states, 43 states have (on average 6.093023255813954) internal successors, (262), 43 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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:30:48,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:48,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:30:48,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:31:29,202 INFO L116 PetriNetUnfolderBase]: 14730/23481 cut-off events. [2025-04-14 01:31:29,202 INFO L117 PetriNetUnfolderBase]: For 360512/360512 co-relation queries the response was YES. [2025-04-14 01:31:29,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146807 conditions, 23481 events. 14730/23481 cut-off events. For 360512/360512 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 165931 event pairs, 5098 based on Foata normal form. 2/23483 useless extension candidates. Maximal degree in co-relation 146564. Up to 9414 conditions per place. [2025-04-14 01:31:29,413 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 690 selfloop transitions, 205 changer transitions 30/926 dead transitions. [2025-04-14 01:31:29,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 926 transitions, 15357 flow [2025-04-14 01:31:29,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 01:31:29,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-14 01:31:29,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 376 transitions. [2025-04-14 01:31:29,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3686274509803922 [2025-04-14 01:31:29,414 INFO L175 Difference]: Start difference. First operand has 408 places, 569 transitions, 10064 flow. Second operand 30 states and 376 transitions. [2025-04-14 01:31:29,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 926 transitions, 15357 flow [2025-04-14 01:31:32,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 926 transitions, 14924 flow, removed 144 selfloop flow, removed 22 redundant places. [2025-04-14 01:31:32,230 INFO L231 Difference]: Finished difference. Result has 415 places, 613 transitions, 10977 flow [2025-04-14 01:31:32,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9667, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=10977, PETRI_PLACES=415, PETRI_TRANSITIONS=613} [2025-04-14 01:31:32,231 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 380 predicate places. [2025-04-14 01:31:32,231 INFO L485 AbstractCegarLoop]: Abstraction has has 415 places, 613 transitions, 10977 flow [2025-04-14 01:31:32,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.093023255813954) internal successors, (262), 43 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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:31:32,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:31:32,231 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:31:32,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-14 01:31:32,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:32,432 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:31:32,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:31:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1822116872, now seen corresponding path program 19 times [2025-04-14 01:31:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:31:32,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467985555] [2025-04-14 01:31:32,432 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:31:32,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:31:32,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:31:32,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:31:32,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:31:32,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:31:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:31:35,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467985555] [2025-04-14 01:31:35,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467985555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:31:35,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074937973] [2025-04-14 01:31:35,719 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:31:35,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:35,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:31:35,720 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:31:35,721 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:31:35,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 01:31:35,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:31:35,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:31:35,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:35,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:31:35,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:31:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:31:37,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:31:38,731 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:31:38,732 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2025-04-14 01:31:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 01:31:40,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074937973] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:31:40,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:31:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 13] total 34 [2025-04-14 01:31:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423682249] [2025-04-14 01:31:40,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:31:40,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:31:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:31:40,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:31:40,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:31:40,164 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:31:40,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 613 transitions, 10977 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:31:40,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:31:40,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:31:40,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:31:47,669 INFO L116 PetriNetUnfolderBase]: 16163/25545 cut-off events. [2025-04-14 01:31:47,669 INFO L117 PetriNetUnfolderBase]: For 403882/403882 co-relation queries the response was YES. [2025-04-14 01:31:47,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159537 conditions, 25545 events. 16163/25545 cut-off events. For 403882/403882 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 180842 event pairs, 4323 based on Foata normal form. 3/25548 useless extension candidates. Maximal degree in co-relation 159347. Up to 8211 conditions per place. [2025-04-14 01:31:48,050 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 484 selfloop transitions, 285 changer transitions 31/801 dead transitions. [2025-04-14 01:31:48,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 801 transitions, 14603 flow [2025-04-14 01:31:48,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:31:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:31:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 190 transitions. [2025-04-14 01:31:48,051 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4298642533936652 [2025-04-14 01:31:48,051 INFO L175 Difference]: Start difference. First operand has 415 places, 613 transitions, 10977 flow. Second operand 13 states and 190 transitions. [2025-04-14 01:31:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 801 transitions, 14603 flow [2025-04-14 01:31:51,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 801 transitions, 14249 flow, removed 23 selfloop flow, removed 14 redundant places. [2025-04-14 01:31:51,302 INFO L231 Difference]: Finished difference. Result has 416 places, 646 transitions, 12016 flow [2025-04-14 01:31:51,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=10637, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=249, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12016, PETRI_PLACES=416, PETRI_TRANSITIONS=646} [2025-04-14 01:31:51,303 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 381 predicate places. [2025-04-14 01:31:51,303 INFO L485 AbstractCegarLoop]: Abstraction has has 416 places, 646 transitions, 12016 flow [2025-04-14 01:31:51,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:31:51,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:31:51,303 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:31:51,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-14 01:31:51,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 01:31:51,504 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:31:51,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:31:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 365658138, now seen corresponding path program 4 times [2025-04-14 01:31:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:31:51,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834730091] [2025-04-14 01:31:51,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:31:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:31:51,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:31:51,519 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:31:51,519 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:31:51,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:31:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:31:56,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834730091] [2025-04-14 01:31:56,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834730091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:31:56,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765192450] [2025-04-14 01:31:56,605 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:31:56,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:31:56,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:31:56,607 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:31:56,608 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:31:56,662 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-14 01:31:56,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 01:31:56,702 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:31:56,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:31:56,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-14 01:31:56,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:31:57,078 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:32:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:00,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:06,090 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 99 treesize of output 89 [2025-04-14 01:32:06,267 INFO L325 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2025-04-14 01:32:06,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 164 [2025-04-14 01:32:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:07,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765192450] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:07,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:07,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2025-04-14 01:32:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197879534] [2025-04-14 01:32:07,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:07,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-04-14 01:32:07,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:07,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-04-14 01:32:07,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=1637, Unknown=0, NotChecked=0, Total=1892 [2025-04-14 01:32:07,451 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2025-04-14 01:32:07,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 646 transitions, 12016 flow. Second operand has 44 states, 44 states have (on average 6.045454545454546) internal successors, (266), 44 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:32:07,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:07,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2025-04-14 01:32:07,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-14 01:32:36,628 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:32:36,629 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:32:36,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-14 01:32:36,883 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:32:36,889 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:32:37,083 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:37,083 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 4/34 universal loopers) in iteration 51,while PetriNetUnfolder was constructing finite prefix that currently has 40082 conditions, 5719 events (3505/5718 cut-off events. For 113499/113499 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 41745 event pairs, 537 based on Foata normal form. 0/6584 useless extension candidates. Maximal degree in co-relation 39965. Up to 1960 conditions per place.). [2025-04-14 01:32:37,085 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:32:37,085 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:32:37,085 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:32:37,085 INFO L422 BasicCegarLoop]: Path program histogram: [19, 10, 7, 7, 4, 2, 1, 1] [2025-04-14 01:32:37,088 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:32:37,088 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:32:37,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:32:37 BasicIcfg [2025-04-14 01:32:37,090 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:32:37,091 INFO L158 Benchmark]: Toolchain (without parser) took 831663.39ms. Allocated memory was 125.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 87.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 938.3MB. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.61ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: Boogie Preprocessor took 34.06ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 68.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: IcfgBuilder took 517.65ms. Allocated memory is still 125.8MB. Free memory was 67.5MB in the beginning and 77.5MB in the end (delta: -10.0MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2025-04-14 01:32:37,091 INFO L158 Benchmark]: TraceAbstraction took 830861.68ms. Allocated memory was 125.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 76.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 928.0MB. Max. memory is 8.0GB. [2025-04-14 01:32:37,092 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.19ms. Allocated memory is still 155.2MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.78ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 71.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.61ms. Allocated memory is still 125.8MB. Free memory was 71.6MB in the beginning and 69.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 34.06ms. Allocated memory is still 125.8MB. Free memory was 69.5MB in the beginning and 68.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 517.65ms. Allocated memory is still 125.8MB. Free memory was 67.5MB in the beginning and 77.5MB in the end (delta: -10.0MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. * TraceAbstraction took 830861.68ms. Allocated memory was 125.8MB in the beginning and 2.4GB in the end (delta: 2.3GB). Free memory was 76.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 928.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 4/34 universal loopers) in iteration 51,while PetriNetUnfolder was constructing finite prefix that currently has 40082 conditions, 5719 events (3505/5718 cut-off events. For 113499/113499 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 41745 event pairs, 537 based on Foata normal form. 0/6584 useless extension candidates. Maximal degree in co-relation 39965. Up to 1960 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 4/34 universal loopers) in iteration 51,while PetriNetUnfolder was constructing finite prefix that currently has 40082 conditions, 5719 events (3505/5718 cut-off events. For 113499/113499 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 41745 event pairs, 537 based on Foata normal form. 0/6584 useless extension candidates. Maximal degree in co-relation 39965. Up to 1960 conditions per place.). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 4/34 universal loopers) in iteration 51,while PetriNetUnfolder was constructing finite prefix that currently has 40082 conditions, 5719 events (3505/5718 cut-off events. For 113499/113499 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 41745 event pairs, 537 based on Foata normal form. 0/6584 useless extension candidates. Maximal degree in co-relation 39965. Up to 1960 conditions per place.). - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 4/34 universal loopers) in iteration 51,while PetriNetUnfolder was constructing finite prefix that currently has 40082 conditions, 5719 events (3505/5718 cut-off events. For 113499/113499 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 41745 event pairs, 537 based on Foata normal form. 0/6584 useless extension candidates. Maximal degree in co-relation 39965. Up to 1960 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 49 locations, 57 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: 830.8s, OverallIterations: 51, TraceHistogramMax: 6, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 718.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 58 mSolverCounterUnknown, 8235 SdHoareTripleChecker+Valid, 370.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8235 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 362.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43010 IncrementalHoareTripleChecker+Invalid, 43874 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 806 mSolverCounterUnsat, 0 mSDtfsCounter, 43010 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2102 GetRequests, 927 SyntacticMatches, 6 SemanticMatches, 1169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14893 ImplicationChecksByTransitivity, 204.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12016occurred in iteration=50, InterpolantAutomatonStates: 727, 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, 1.4s SatisfiabilityAnalysisTime, 104.6s InterpolantComputationTime, 2064 NumberOfCodeBlocks, 2030 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 2597 ConstructedInterpolants, 91 QuantifiedInterpolants, 69577 SizeOfPredicates, 262 NumberOfNonLiveVariables, 4983 ConjunctsInSsa, 704 ConjunctsInUnsatCore, 99 InterpolantComputations, 33 PerfectInterpolantSequences, 187/462 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