/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-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:18:07,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:18:07,977 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:07,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:18:07,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:18:08,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:18:08,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:18:08,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:18:08,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:18:08,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:18:08,004 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:18:08,004 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:18:08,004 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:18:08,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:18:08,005 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:18:08,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:18:08,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:18:08,006 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:08,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:08,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:08,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:18:08,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:18:08,007 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:08,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:18:08,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:18:08,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:18:08,249 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:18:08,249 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:18:08,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-14 01:18:09,544 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e8b06/81e8ced894cc45b2ab1fc22a4c961206/FLAGec5b0c7a2 [2025-04-14 01:18:09,727 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:18:09,727 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-04-14 01:18:09,733 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e8b06/81e8ced894cc45b2ab1fc22a4c961206/FLAGec5b0c7a2 [2025-04-14 01:18:10,594 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e1e8b06/81e8ced894cc45b2ab1fc22a4c961206 [2025-04-14 01:18:10,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:18:10,597 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:18:10,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:10,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:18:10,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:18:10,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:10" (1/1) ... [2025-04-14 01:18:10,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ecd4cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:10, skipping insertion in model container [2025-04-14 01:18:10,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:18:10" (1/1) ... [2025-04-14 01:18:10,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:18:10,790 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-min-array-hom.wvr.c[2625,2638] [2025-04-14 01:18:10,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:10,808 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:18:10,840 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-min-array-hom.wvr.c[2625,2638] [2025-04-14 01:18:10,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:18:10,856 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:18:10,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:10 WrapperNode [2025-04-14 01:18:10,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:18:10,858 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:10,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:18:10,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:18:10,863 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:10" (1/1) ... [2025-04-14 01:18:10,874 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:10" (1/1) ... [2025-04-14 01:18:10,894 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-04-14 01:18:10,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:18:10,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:18:10,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:18:10,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:18:10,904 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:10" (1/1) ... [2025-04-14 01:18:10,904 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:10" (1/1) ... [2025-04-14 01:18:10,909 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:10" (1/1) ... [2025-04-14 01:18:10,923 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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:10,923 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:10" (1/1) ... [2025-04-14 01:18:10,923 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:10" (1/1) ... [2025-04-14 01:18:10,927 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:10" (1/1) ... [2025-04-14 01:18:10,932 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:10" (1/1) ... [2025-04-14 01:18:10,933 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:10" (1/1) ... [2025-04-14 01:18:10,933 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:10" (1/1) ... [2025-04-14 01:18:10,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:18:10,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:18:10,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:18:10,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:18:10,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:10" (1/1) ... [2025-04-14 01:18:10,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:18:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:10,975 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:10,977 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:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:18:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:18:10,993 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:18:10,993 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:18:10,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:18:10,994 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:18:10,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:18:10,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:18:10,995 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:11,065 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:18:11,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:18:11,282 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:18:11,283 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:18:11,283 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:18:11,476 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:11,477 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:11,481 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:11,486 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:18:11,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:11 BoogieIcfgContainer [2025-04-14 01:18:11,487 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:18:11,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:18:11,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:18:11,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:18:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:18:10" (1/3) ... [2025-04-14 01:18:11,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6085ec12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:11, skipping insertion in model container [2025-04-14 01:18:11,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:18:10" (2/3) ... [2025-04-14 01:18:11,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6085ec12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:18:11, skipping insertion in model container [2025-04-14 01:18:11,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:18:11" (3/3) ... [2025-04-14 01:18:11,495 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-04-14 01:18:11,507 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:18:11,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:18:11,509 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:18:11,557 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:18:11,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:18:11,606 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-14 01:18:11,607 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:11,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-14 01:18:11,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-14 01:18:11,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-14 01:18:11,618 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:18:11,626 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;@1748d8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:18:11,626 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:18:11,633 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:18:11,633 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-14 01:18:11,634 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:18:11,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:11,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:11,635 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:11,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash -809757656, now seen corresponding path program 1 times [2025-04-14 01:18:11,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:11,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362168416] [2025-04-14 01:18:11,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:11,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:11,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:18:11,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:18:11,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:11,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:11,883 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:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:11,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362168416] [2025-04-14 01:18:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362168416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:11,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559077528] [2025-04-14 01:18:11,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:11,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:11,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:11,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:11,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:11,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:11,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:11,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:11,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:12,064 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-14 01:18:12,065 INFO L117 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-04-14 01:18:12,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1960 event pairs, 306 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-14 01:18:12,076 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-14 01:18:12,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-14 01:18:12,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:18:12,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:18:12,088 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:18:12,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-14 01:18:12,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:12,096 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-14 01:18:12,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-14 01:18:12,101 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-14 01:18:12,102 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-14 01:18:12,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:12,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:12,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:12,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:18:12,102 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:12,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -537765117, now seen corresponding path program 1 times [2025-04-14 01:18:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:12,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130391391] [2025-04-14 01:18:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:12,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 01:18:12,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 01:18:12,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:12,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:12,193 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:12,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:12,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130391391] [2025-04-14 01:18:12,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130391391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:12,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:12,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:18:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129506404] [2025-04-14 01:18:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:12,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:12,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:12,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:12,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:12,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call 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:12,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:12,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:12,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:12,279 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-14 01:18:12,279 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:18:12,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 666 events. 474/666 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-14 01:18:12,284 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-14 01:18:12,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-14 01:18:12,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-14 01:18:12,285 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-14 01:18:12,285 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-14 01:18:12,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-14 01:18:12,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:12,287 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-14 01:18:12,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-14 01:18:12,287 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-14 01:18:12,287 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-14 01:18:12,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call 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:12,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:12,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:12,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:18:12,289 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:12,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:12,289 INFO L85 PathProgramCache]: Analyzing trace with hash 833748358, now seen corresponding path program 1 times [2025-04-14 01:18:12,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:12,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441378281] [2025-04-14 01:18:12,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:12,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:12,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:18:12,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:18:12,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:12,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:12,424 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:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:12,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441378281] [2025-04-14 01:18:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441378281] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:18:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478280823] [2025-04-14 01:18:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:12,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:18:12,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:12,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:18:12,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:18:12,426 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:12,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:12,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:12,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:12,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:12,514 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-14 01:18:12,514 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 01:18:12,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 667 events. 474/667 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1870 event pairs, 306 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1347. Up to 667 conditions per place. [2025-04-14 01:18:12,517 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-14 01:18:12,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-14 01:18:12,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:18:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:18:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:18:12,518 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:18:12,518 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:18:12,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-14 01:18:12,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:12,520 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-14 01:18:12,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-14 01:18:12,520 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-14 01:18:12,520 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-14 01:18:12,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call 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:12,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:12,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:12,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:18:12,521 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:12,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:12,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1704734234, now seen corresponding path program 1 times [2025-04-14 01:18:12,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:12,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44499001] [2025-04-14 01:18:12,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:12,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:12,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:12,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:12,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:13,524 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:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:13,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44499001] [2025-04-14 01:18:13,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44499001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:13,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249549897] [2025-04-14 01:18:13,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:18:13,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:13,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:13,531 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:13,532 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:13,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:13,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:13,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:13,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:13,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:13,659 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:13,985 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 59 treesize of output 35 [2025-04-14 01:18:14,062 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:14,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:15,320 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 76 treesize of output 66 [2025-04-14 01:18:15,329 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-14 01:18:15,386 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 98 treesize of output 88 [2025-04-14 01:18:15,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-14 01:18:15,500 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:15,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249549897] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:15,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:15,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 24 [2025-04-14 01:18:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473376195] [2025-04-14 01:18:15,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:15,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 01:18:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 01:18:15,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:18:15,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:15,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 72 flow. Second operand has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call 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:15,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:15,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:15,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:17,768 INFO L116 PetriNetUnfolderBase]: 1364/2009 cut-off events. [2025-04-14 01:18:17,768 INFO L117 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-04-14 01:18:17,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4102 conditions, 2009 events. 1364/2009 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8812 event pairs, 19 based on Foata normal form. 1/1669 useless extension candidates. Maximal degree in co-relation 4091. Up to 998 conditions per place. [2025-04-14 01:18:17,776 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 172 selfloop transitions, 120 changer transitions 1/293 dead transitions. [2025-04-14 01:18:17,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 293 transitions, 1250 flow [2025-04-14 01:18:17,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:18:17,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:18:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 421 transitions. [2025-04-14 01:18:17,779 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3373397435897436 [2025-04-14 01:18:17,779 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 39 states and 421 transitions. [2025-04-14 01:18:17,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 293 transitions, 1250 flow [2025-04-14 01:18:17,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 293 transitions, 1246 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:17,783 INFO L231 Difference]: Finished difference. Result has 85 places, 156 transitions, 757 flow [2025-04-14 01:18:17,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=757, PETRI_PLACES=85, PETRI_TRANSITIONS=156} [2025-04-14 01:18:17,783 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2025-04-14 01:18:17,783 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 156 transitions, 757 flow [2025-04-14 01:18:17,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.3076923076923075) internal successors, (138), 26 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call 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:17,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:17,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:17,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:18:17,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:17,984 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:17,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1605080768, now seen corresponding path program 2 times [2025-04-14 01:18:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:17,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101795139] [2025-04-14 01:18:17,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:17,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:17,994 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:18,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:18,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:18,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:18,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101795139] [2025-04-14 01:18:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101795139] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:18,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11684611] [2025-04-14 01:18:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:18,399 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:18,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:18,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:18,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:18,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 156 transitions, 757 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:18,730 INFO L116 PetriNetUnfolderBase]: 1432/2128 cut-off events. [2025-04-14 01:18:18,730 INFO L117 PetriNetUnfolderBase]: For 6020/6020 co-relation queries the response was YES. [2025-04-14 01:18:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7738 conditions, 2128 events. 1432/2128 cut-off events. For 6020/6020 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9368 event pairs, 112 based on Foata normal form. 1/1951 useless extension candidates. Maximal degree in co-relation 7219. Up to 1862 conditions per place. [2025-04-14 01:18:18,743 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 161 selfloop transitions, 54 changer transitions 1/216 dead transitions. [2025-04-14 01:18:18,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 216 transitions, 1468 flow [2025-04-14 01:18:18,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2025-04-14 01:18:18,746 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-14 01:18:18,746 INFO L175 Difference]: Start difference. First operand has 85 places, 156 transitions, 757 flow. Second operand 10 states and 102 transitions. [2025-04-14 01:18:18,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 216 transitions, 1468 flow [2025-04-14 01:18:18,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 216 transitions, 1460 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:18,770 INFO L231 Difference]: Finished difference. Result has 99 places, 190 transitions, 1132 flow [2025-04-14 01:18:18,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1132, PETRI_PLACES=99, PETRI_TRANSITIONS=190} [2025-04-14 01:18:18,771 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2025-04-14 01:18:18,771 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 190 transitions, 1132 flow [2025-04-14 01:18:18,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:18,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:18,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:18,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:18:18,772 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:18,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -164979484, now seen corresponding path program 3 times [2025-04-14 01:18:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:18,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309913588] [2025-04-14 01:18:18,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:18,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:18,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:18,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:18,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:19,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309913588] [2025-04-14 01:18:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309913588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211392372] [2025-04-14 01:18:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:19,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:19,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:19,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:19,203 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:19,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 190 transitions, 1132 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:19,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:19,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:19,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:19,782 INFO L116 PetriNetUnfolderBase]: 1614/2406 cut-off events. [2025-04-14 01:18:19,782 INFO L117 PetriNetUnfolderBase]: For 8330/8330 co-relation queries the response was YES. [2025-04-14 01:18:19,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 2406 events. 1614/2406 cut-off events. For 8330/8330 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10973 event pairs, 105 based on Foata normal form. 1/2218 useless extension candidates. Maximal degree in co-relation 9094. Up to 2053 conditions per place. [2025-04-14 01:18:19,796 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 178 selfloop transitions, 105 changer transitions 4/287 dead transitions. [2025-04-14 01:18:19,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 287 transitions, 2276 flow [2025-04-14 01:18:19,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:18:19,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:18:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2025-04-14 01:18:19,798 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-14 01:18:19,798 INFO L175 Difference]: Start difference. First operand has 99 places, 190 transitions, 1132 flow. Second operand 12 states and 130 transitions. [2025-04-14 01:18:19,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 287 transitions, 2276 flow [2025-04-14 01:18:19,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 287 transitions, 2169 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-04-14 01:18:19,825 INFO L231 Difference]: Finished difference. Result has 116 places, 248 transitions, 1846 flow [2025-04-14 01:18:19,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1846, PETRI_PLACES=116, PETRI_TRANSITIONS=248} [2025-04-14 01:18:19,825 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2025-04-14 01:18:19,825 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 248 transitions, 1846 flow [2025-04-14 01:18:19,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:19,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:19,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:19,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:18:19,827 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:19,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:19,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1533124464, now seen corresponding path program 4 times [2025-04-14 01:18:19,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:19,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137616828] [2025-04-14 01:18:19,828 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:19,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:19,847 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:19,847 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:19,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:20,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:20,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137616828] [2025-04-14 01:18:20,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137616828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:20,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:20,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:20,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221130962] [2025-04-14 01:18:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:20,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:20,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:20,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:20,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:20,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 248 transitions, 1846 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:20,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:20,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:20,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:20,995 INFO L116 PetriNetUnfolderBase]: 1709/2553 cut-off events. [2025-04-14 01:18:20,995 INFO L117 PetriNetUnfolderBase]: For 10617/10617 co-relation queries the response was YES. [2025-04-14 01:18:21,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11232 conditions, 2553 events. 1709/2553 cut-off events. For 10617/10617 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 11754 event pairs, 176 based on Foata normal form. 1/2353 useless extension candidates. Maximal degree in co-relation 11114. Up to 2185 conditions per place. [2025-04-14 01:18:21,037 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 202 selfloop transitions, 126 changer transitions 4/332 dead transitions. [2025-04-14 01:18:21,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 332 transitions, 3061 flow [2025-04-14 01:18:21,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:18:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:18:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2025-04-14 01:18:21,038 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-14 01:18:21,039 INFO L175 Difference]: Start difference. First operand has 116 places, 248 transitions, 1846 flow. Second operand 12 states and 126 transitions. [2025-04-14 01:18:21,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 332 transitions, 3061 flow [2025-04-14 01:18:21,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 332 transitions, 3010 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:21,078 INFO L231 Difference]: Finished difference. Result has 134 places, 294 transitions, 2666 flow [2025-04-14 01:18:21,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2666, PETRI_PLACES=134, PETRI_TRANSITIONS=294} [2025-04-14 01:18:21,080 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 103 predicate places. [2025-04-14 01:18:21,080 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 294 transitions, 2666 flow [2025-04-14 01:18:21,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:21,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:21,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:21,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:18:21,080 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:21,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash 91909074, now seen corresponding path program 5 times [2025-04-14 01:18:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:21,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306698860] [2025-04-14 01:18:21,081 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:21,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:21,092 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:21,102 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:21,102 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:21,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:21,541 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:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:21,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306698860] [2025-04-14 01:18:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306698860] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:21,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179181002] [2025-04-14 01:18:21,541 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:21,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:21,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:21,543 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:21,544 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:21,580 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:21,600 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:21,600 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:21,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:21,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:21,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:21,617 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:21,766 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 59 treesize of output 35 [2025-04-14 01:18:21,835 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:21,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:22,842 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:18:22,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-14 01:18:22,934 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 112 treesize of output 98 [2025-04-14 01:18:22,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-14 01:18:22,965 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:22,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179181002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:22,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:22,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-14 01:18:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462163708] [2025-04-14 01:18:22,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:22,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:18:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:18:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:18:22,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:22,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 294 transitions, 2666 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:22,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:22,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:22,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:25,298 INFO L116 PetriNetUnfolderBase]: 2122/3210 cut-off events. [2025-04-14 01:18:25,298 INFO L117 PetriNetUnfolderBase]: For 15011/15011 co-relation queries the response was YES. [2025-04-14 01:18:25,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15088 conditions, 3210 events. 2122/3210 cut-off events. For 15011/15011 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 15976 event pairs, 91 based on Foata normal form. 2/2941 useless extension candidates. Maximal degree in co-relation 14950. Up to 1735 conditions per place. [2025-04-14 01:18:25,327 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 180 selfloop transitions, 327 changer transitions 4/511 dead transitions. [2025-04-14 01:18:25,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 511 transitions, 5136 flow [2025-04-14 01:18:25,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 01:18:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-14 01:18:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 308 transitions. [2025-04-14 01:18:25,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30078125 [2025-04-14 01:18:25,329 INFO L175 Difference]: Start difference. First operand has 134 places, 294 transitions, 2666 flow. Second operand 32 states and 308 transitions. [2025-04-14 01:18:25,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 511 transitions, 5136 flow [2025-04-14 01:18:25,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 511 transitions, 4999 flow, removed 67 selfloop flow, removed 1 redundant places. [2025-04-14 01:18:25,393 INFO L231 Difference]: Finished difference. Result has 176 places, 426 transitions, 4691 flow [2025-04-14 01:18:25,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2549, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=4691, PETRI_PLACES=176, PETRI_TRANSITIONS=426} [2025-04-14 01:18:25,393 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2025-04-14 01:18:25,394 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 426 transitions, 4691 flow [2025-04-14 01:18:25,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:25,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:25,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:25,401 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:25,596 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,SelfDestructingSolverStorable7 [2025-04-14 01:18:25,596 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:25,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:25,597 INFO L85 PathProgramCache]: Analyzing trace with hash 665342518, now seen corresponding path program 6 times [2025-04-14 01:18:25,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:25,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196284136] [2025-04-14 01:18:25,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:25,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:25,602 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:25,611 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:25,611 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:25,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196284136] [2025-04-14 01:18:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196284136] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:25,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:25,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:25,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673202912] [2025-04-14 01:18:25,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:25,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:25,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:25,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:25,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:25,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 426 transitions, 4691 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:25,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:25,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:25,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:26,564 INFO L116 PetriNetUnfolderBase]: 2174/3309 cut-off events. [2025-04-14 01:18:26,565 INFO L117 PetriNetUnfolderBase]: For 18840/18840 co-relation queries the response was YES. [2025-04-14 01:18:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18311 conditions, 3309 events. 2174/3309 cut-off events. For 18840/18840 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16719 event pairs, 177 based on Foata normal form. 1/3045 useless extension candidates. Maximal degree in co-relation 18150. Up to 2979 conditions per place. [2025-04-14 01:18:26,587 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 344 selfloop transitions, 126 changer transitions 4/474 dead transitions. [2025-04-14 01:18:26,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 474 transitions, 5914 flow [2025-04-14 01:18:26,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-04-14 01:18:26,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34375 [2025-04-14 01:18:26,591 INFO L175 Difference]: Start difference. First operand has 176 places, 426 transitions, 4691 flow. Second operand 10 states and 110 transitions. [2025-04-14 01:18:26,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 474 transitions, 5914 flow [2025-04-14 01:18:26,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 474 transitions, 5445 flow, removed 179 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:26,727 INFO L231 Difference]: Finished difference. Result has 183 places, 446 transitions, 4680 flow [2025-04-14 01:18:26,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4680, PETRI_PLACES=183, PETRI_TRANSITIONS=446} [2025-04-14 01:18:26,728 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 152 predicate places. [2025-04-14 01:18:26,728 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 446 transitions, 4680 flow [2025-04-14 01:18:26,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:26,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:26,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:26,728 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:18:26,728 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:18:26,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:26,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1291405498, now seen corresponding path program 7 times [2025-04-14 01:18:26,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:26,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866679019] [2025-04-14 01:18:26,729 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:26,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:26,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:26,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:27,223 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:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:27,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866679019] [2025-04-14 01:18:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866679019] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:27,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36581358] [2025-04-14 01:18:27,224 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:27,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:27,226 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:27,228 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:27,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:27,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:27,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:27,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:27,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:27,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:27,316 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:27,473 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 59 treesize of output 35 [2025-04-14 01:18:27,526 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:27,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:28,476 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 98 treesize of output 88 [2025-04-14 01:18:28,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-14 01:18:28,540 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 76 treesize of output 66 [2025-04-14 01:18:28,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-14 01:18:28,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:28,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36581358] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:28,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:28,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-14 01:18:28,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304627498] [2025-04-14 01:18:28,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:28,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:18:28,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:28,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:18:28,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:18:28,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:28,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 446 transitions, 4680 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call 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:28,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:28,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:28,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:30,584 INFO L116 PetriNetUnfolderBase]: 2627/4047 cut-off events. [2025-04-14 01:18:30,585 INFO L117 PetriNetUnfolderBase]: For 18894/18894 co-relation queries the response was YES. [2025-04-14 01:18:30,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22288 conditions, 4047 events. 2627/4047 cut-off events. For 18894/18894 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 21752 event pairs, 151 based on Foata normal form. 1/3737 useless extension candidates. Maximal degree in co-relation 22098. Up to 2976 conditions per place. [2025-04-14 01:18:30,607 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 401 selfloop transitions, 286 changer transitions 4/691 dead transitions. [2025-04-14 01:18:30,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 691 transitions, 8258 flow [2025-04-14 01:18:30,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 01:18:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-04-14 01:18:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 254 transitions. [2025-04-14 01:18:30,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29398148148148145 [2025-04-14 01:18:30,609 INFO L175 Difference]: Start difference. First operand has 183 places, 446 transitions, 4680 flow. Second operand 27 states and 254 transitions. [2025-04-14 01:18:30,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 691 transitions, 8258 flow [2025-04-14 01:18:30,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 691 transitions, 8079 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:30,739 INFO L231 Difference]: Finished difference. Result has 214 places, 592 transitions, 7131 flow [2025-04-14 01:18:30,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4532, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=7131, PETRI_PLACES=214, PETRI_TRANSITIONS=592} [2025-04-14 01:18:30,740 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 183 predicate places. [2025-04-14 01:18:30,740 INFO L485 AbstractCegarLoop]: Abstraction has has 214 places, 592 transitions, 7131 flow [2025-04-14 01:18:30,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:30,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:30,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:30,746 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:30,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:30,944 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:18:30,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 254497382, now seen corresponding path program 8 times [2025-04-14 01:18:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:30,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627694204] [2025-04-14 01:18:30,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:30,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:30,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:30,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:30,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:31,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:31,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627694204] [2025-04-14 01:18:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627694204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327808754] [2025-04-14 01:18:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:31,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:31,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:31,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:31,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:31,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:31,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 592 transitions, 7131 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:31,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:31,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:31,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:31,937 INFO L116 PetriNetUnfolderBase]: 2682/4143 cut-off events. [2025-04-14 01:18:31,937 INFO L117 PetriNetUnfolderBase]: For 24230/24230 co-relation queries the response was YES. [2025-04-14 01:18:31,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25585 conditions, 4143 events. 2682/4143 cut-off events. For 24230/24230 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 22447 event pairs, 195 based on Foata normal form. 1/3835 useless extension candidates. Maximal degree in co-relation 25375. Up to 3652 conditions per place. [2025-04-14 01:18:31,961 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 470 selfloop transitions, 172 changer transitions 5/647 dead transitions. [2025-04-14 01:18:31,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 647 transitions, 8850 flow [2025-04-14 01:18:31,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-14 01:18:31,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-14 01:18:31,962 INFO L175 Difference]: Start difference. First operand has 214 places, 592 transitions, 7131 flow. Second operand 10 states and 114 transitions. [2025-04-14 01:18:31,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 647 transitions, 8850 flow [2025-04-14 01:18:32,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 647 transitions, 8417 flow, removed 187 selfloop flow, removed 3 redundant places. [2025-04-14 01:18:32,171 INFO L231 Difference]: Finished difference. Result has 223 places, 612 transitions, 7382 flow [2025-04-14 01:18:32,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=6722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7382, PETRI_PLACES=223, PETRI_TRANSITIONS=612} [2025-04-14 01:18:32,172 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 192 predicate places. [2025-04-14 01:18:32,172 INFO L485 AbstractCegarLoop]: Abstraction has has 223 places, 612 transitions, 7382 flow [2025-04-14 01:18:32,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:32,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:32,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:32,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:18:32,172 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:18:32,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1500190170, now seen corresponding path program 9 times [2025-04-14 01:18:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:32,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071514261] [2025-04-14 01:18:32,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:32,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:32,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:32,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:32,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:32,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:32,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071514261] [2025-04-14 01:18:32,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071514261] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:32,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:32,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:32,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399981403] [2025-04-14 01:18:32,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:32,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:32,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:32,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:32,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:32,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 612 transitions, 7382 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:33,111 INFO L116 PetriNetUnfolderBase]: 2760/4265 cut-off events. [2025-04-14 01:18:33,111 INFO L117 PetriNetUnfolderBase]: For 25604/25604 co-relation queries the response was YES. [2025-04-14 01:18:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26588 conditions, 4265 events. 2760/4265 cut-off events. For 25604/25604 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 23296 event pairs, 236 based on Foata normal form. 2/3942 useless extension candidates. Maximal degree in co-relation 26369. Up to 3864 conditions per place. [2025-04-14 01:18:33,193 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 491 selfloop transitions, 178 changer transitions 4/673 dead transitions. [2025-04-14 01:18:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 673 transitions, 9213 flow [2025-04-14 01:18:33,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-04-14 01:18:33,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.353125 [2025-04-14 01:18:33,195 INFO L175 Difference]: Start difference. First operand has 223 places, 612 transitions, 7382 flow. Second operand 10 states and 113 transitions. [2025-04-14 01:18:33,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 673 transitions, 9213 flow [2025-04-14 01:18:33,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 673 transitions, 8999 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:33,424 INFO L231 Difference]: Finished difference. Result has 230 places, 644 transitions, 7967 flow [2025-04-14 01:18:33,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7168, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7967, PETRI_PLACES=230, PETRI_TRANSITIONS=644} [2025-04-14 01:18:33,425 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 199 predicate places. [2025-04-14 01:18:33,425 INFO L485 AbstractCegarLoop]: Abstraction has has 230 places, 644 transitions, 7967 flow [2025-04-14 01:18:33,425 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:33,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:33,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:33,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:18:33,426 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:18:33,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:33,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1768972260, now seen corresponding path program 10 times [2025-04-14 01:18:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:33,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684718378] [2025-04-14 01:18:33,427 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:33,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:33,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:33,437 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:33,437 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:33,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:33,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:33,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:33,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684718378] [2025-04-14 01:18:33,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684718378] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:33,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:33,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:33,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566191033] [2025-04-14 01:18:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:33,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:33,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:33,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:33,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:33,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:33,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 644 transitions, 7967 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:33,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:33,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:33,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:34,563 INFO L116 PetriNetUnfolderBase]: 2771/4284 cut-off events. [2025-04-14 01:18:34,564 INFO L117 PetriNetUnfolderBase]: For 26783/26783 co-relation queries the response was YES. [2025-04-14 01:18:34,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27477 conditions, 4284 events. 2771/4284 cut-off events. For 26783/26783 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 23382 event pairs, 245 based on Foata normal form. 1/3974 useless extension candidates. Maximal degree in co-relation 27245. Up to 4005 conditions per place. [2025-04-14 01:18:34,596 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 550 selfloop transitions, 116 changer transitions 3/669 dead transitions. [2025-04-14 01:18:34,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 669 transitions, 9404 flow [2025-04-14 01:18:34,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2025-04-14 01:18:34,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33125 [2025-04-14 01:18:34,597 INFO L175 Difference]: Start difference. First operand has 230 places, 644 transitions, 7967 flow. Second operand 10 states and 106 transitions. [2025-04-14 01:18:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 669 transitions, 9404 flow [2025-04-14 01:18:34,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 669 transitions, 9130 flow, removed 49 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:34,812 INFO L231 Difference]: Finished difference. Result has 236 places, 648 transitions, 7983 flow [2025-04-14 01:18:34,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7693, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7983, PETRI_PLACES=236, PETRI_TRANSITIONS=648} [2025-04-14 01:18:34,813 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 205 predicate places. [2025-04-14 01:18:34,813 INFO L485 AbstractCegarLoop]: Abstraction has has 236 places, 648 transitions, 7983 flow [2025-04-14 01:18:34,813 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:34,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:34,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:34,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:18:34,813 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:18:34,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:34,813 INFO L85 PathProgramCache]: Analyzing trace with hash 784986006, now seen corresponding path program 11 times [2025-04-14 01:18:34,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:34,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456039824] [2025-04-14 01:18:34,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:34,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:34,817 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:34,822 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:34,822 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:34,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:35,133 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:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:35,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456039824] [2025-04-14 01:18:35,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456039824] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:35,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287816411] [2025-04-14 01:18:35,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:35,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:35,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:35,135 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:35,138 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:35,175 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:35,191 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:35,191 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:35,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:35,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:35,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:35,209 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:35,363 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 59 treesize of output 35 [2025-04-14 01:18:35,429 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:35,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:36,422 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:18:36,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-14 01:18:36,507 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 112 treesize of output 98 [2025-04-14 01:18:36,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-14 01:18:36,533 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:36,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287816411] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:36,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:36,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-14 01:18:36,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702011800] [2025-04-14 01:18:36,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:36,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 01:18:36,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:36,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 01:18:36,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-04-14 01:18:36,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:36,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 648 transitions, 7983 flow. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:36,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:36,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:36,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:39,483 INFO L116 PetriNetUnfolderBase]: 3370/5206 cut-off events. [2025-04-14 01:18:39,483 INFO L117 PetriNetUnfolderBase]: For 33354/33354 co-relation queries the response was YES. [2025-04-14 01:18:39,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33538 conditions, 5206 events. 3370/5206 cut-off events. For 33354/33354 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 29561 event pairs, 156 based on Foata normal form. 3/4828 useless extension candidates. Maximal degree in co-relation 33298. Up to 2155 conditions per place. [2025-04-14 01:18:39,524 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 234 selfloop transitions, 705 changer transitions 12/951 dead transitions. [2025-04-14 01:18:39,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 951 transitions, 13037 flow [2025-04-14 01:18:39,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 01:18:39,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-04-14 01:18:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 358 transitions. [2025-04-14 01:18:39,526 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2944078947368421 [2025-04-14 01:18:39,526 INFO L175 Difference]: Start difference. First operand has 236 places, 648 transitions, 7983 flow. Second operand 38 states and 358 transitions. [2025-04-14 01:18:39,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 951 transitions, 13037 flow [2025-04-14 01:18:39,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 951 transitions, 12880 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:39,827 INFO L231 Difference]: Finished difference. Result has 282 places, 856 transitions, 12806 flow [2025-04-14 01:18:39,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7840, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=12806, PETRI_PLACES=282, PETRI_TRANSITIONS=856} [2025-04-14 01:18:39,828 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 251 predicate places. [2025-04-14 01:18:39,828 INFO L485 AbstractCegarLoop]: Abstraction has has 282 places, 856 transitions, 12806 flow [2025-04-14 01:18:39,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:39,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:39,828 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:39,835 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:18:40,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:40,029 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:18:40,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:40,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1285870218, now seen corresponding path program 12 times [2025-04-14 01:18:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:40,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972369407] [2025-04-14 01:18:40,029 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:40,035 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:40,044 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:40,047 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:40,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:40,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972369407] [2025-04-14 01:18:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972369407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:40,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804998727] [2025-04-14 01:18:40,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:40,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:40,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:40,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:40,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:40,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 856 transitions, 12806 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:40,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:40,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:40,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:41,238 INFO L116 PetriNetUnfolderBase]: 3418/5276 cut-off events. [2025-04-14 01:18:41,238 INFO L117 PetriNetUnfolderBase]: For 47721/47721 co-relation queries the response was YES. [2025-04-14 01:18:41,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39998 conditions, 5276 events. 3418/5276 cut-off events. For 47721/47721 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 29995 event pairs, 251 based on Foata normal form. 1/4900 useless extension candidates. Maximal degree in co-relation 39729. Up to 4741 conditions per place. [2025-04-14 01:18:41,278 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 677 selfloop transitions, 224 changer transitions 7/908 dead transitions. [2025-04-14 01:18:41,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 908 transitions, 15131 flow [2025-04-14 01:18:41,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-04-14 01:18:41,280 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3625 [2025-04-14 01:18:41,280 INFO L175 Difference]: Start difference. First operand has 282 places, 856 transitions, 12806 flow. Second operand 10 states and 116 transitions. [2025-04-14 01:18:41,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 908 transitions, 15131 flow [2025-04-14 01:18:41,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 908 transitions, 14459 flow, removed 299 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:41,818 INFO L231 Difference]: Finished difference. Result has 288 places, 875 transitions, 12959 flow [2025-04-14 01:18:41,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12154, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12959, PETRI_PLACES=288, PETRI_TRANSITIONS=875} [2025-04-14 01:18:41,819 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 257 predicate places. [2025-04-14 01:18:41,819 INFO L485 AbstractCegarLoop]: Abstraction has has 288 places, 875 transitions, 12959 flow [2025-04-14 01:18:41,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:41,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:41,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:41,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:18:41,819 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:18:41,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2047222922, now seen corresponding path program 13 times [2025-04-14 01:18:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:41,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033892225] [2025-04-14 01:18:41,820 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:18:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:41,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:18:41,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:41,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:18:41,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:42,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:42,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033892225] [2025-04-14 01:18:42,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033892225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:42,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:42,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611071596] [2025-04-14 01:18:42,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:42,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:42,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:42,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:42,168 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:42,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 875 transitions, 12959 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:42,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:42,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:42,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:43,427 INFO L116 PetriNetUnfolderBase]: 3452/5322 cut-off events. [2025-04-14 01:18:43,427 INFO L117 PetriNetUnfolderBase]: For 46221/46221 co-relation queries the response was YES. [2025-04-14 01:18:43,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39898 conditions, 5322 events. 3452/5322 cut-off events. For 46221/46221 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 30210 event pairs, 259 based on Foata normal form. 1/4962 useless extension candidates. Maximal degree in co-relation 39640. Up to 4999 conditions per place. [2025-04-14 01:18:43,480 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 768 selfloop transitions, 159 changer transitions 4/931 dead transitions. [2025-04-14 01:18:43,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 931 transitions, 15399 flow [2025-04-14 01:18:43,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:18:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:18:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-04-14 01:18:43,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29375 [2025-04-14 01:18:43,481 INFO L175 Difference]: Start difference. First operand has 288 places, 875 transitions, 12959 flow. Second operand 15 states and 141 transitions. [2025-04-14 01:18:43,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 931 transitions, 15399 flow [2025-04-14 01:18:44,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 931 transitions, 15017 flow, removed 52 selfloop flow, removed 8 redundant places. [2025-04-14 01:18:44,038 INFO L231 Difference]: Finished difference. Result has 301 places, 900 transitions, 13522 flow [2025-04-14 01:18:44,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12581, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=875, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13522, PETRI_PLACES=301, PETRI_TRANSITIONS=900} [2025-04-14 01:18:44,039 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 270 predicate places. [2025-04-14 01:18:44,039 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 900 transitions, 13522 flow [2025-04-14 01:18:44,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:44,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:44,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:44,040 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:18:44,040 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:18:44,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2052237770, now seen corresponding path program 14 times [2025-04-14 01:18:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:44,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766158873] [2025-04-14 01:18:44,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:18:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:44,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:44,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:44,050 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:18:44,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:44,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766158873] [2025-04-14 01:18:44,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766158873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:44,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769655413] [2025-04-14 01:18:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:44,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:44,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:44,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:44,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:44,318 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:44,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 900 transitions, 13522 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:44,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:44,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:44,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:45,342 INFO L116 PetriNetUnfolderBase]: 3484/5379 cut-off events. [2025-04-14 01:18:45,342 INFO L117 PetriNetUnfolderBase]: For 49774/49774 co-relation queries the response was YES. [2025-04-14 01:18:45,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41105 conditions, 5379 events. 3484/5379 cut-off events. For 49774/49774 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 30684 event pairs, 260 based on Foata normal form. 1/5071 useless extension candidates. Maximal degree in co-relation 40826. Up to 5010 conditions per place. [2025-04-14 01:18:45,394 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 777 selfloop transitions, 165 changer transitions 4/946 dead transitions. [2025-04-14 01:18:45,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 946 transitions, 15873 flow [2025-04-14 01:18:45,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:18:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:18:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 139 transitions. [2025-04-14 01:18:45,395 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28958333333333336 [2025-04-14 01:18:45,395 INFO L175 Difference]: Start difference. First operand has 301 places, 900 transitions, 13522 flow. Second operand 15 states and 139 transitions. [2025-04-14 01:18:45,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 946 transitions, 15873 flow [2025-04-14 01:18:45,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 946 transitions, 15330 flow, removed 153 selfloop flow, removed 6 redundant places. [2025-04-14 01:18:45,967 INFO L231 Difference]: Finished difference. Result has 313 places, 918 transitions, 13724 flow [2025-04-14 01:18:45,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12979, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=745, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13724, PETRI_PLACES=313, PETRI_TRANSITIONS=918} [2025-04-14 01:18:45,969 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 282 predicate places. [2025-04-14 01:18:45,969 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 918 transitions, 13724 flow [2025-04-14 01:18:45,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:45,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:45,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:45,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:18:45,969 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:18:45,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:45,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1827203358, now seen corresponding path program 15 times [2025-04-14 01:18:45,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:45,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081126992] [2025-04-14 01:18:45,970 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:18:45,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:45,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:45,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:45,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:18:45,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:46,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081126992] [2025-04-14 01:18:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081126992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997363807] [2025-04-14 01:18:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:46,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:46,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:46,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:46,236 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:46,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 918 transitions, 13724 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:46,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:46,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:47,378 INFO L116 PetriNetUnfolderBase]: 3516/5446 cut-off events. [2025-04-14 01:18:47,379 INFO L117 PetriNetUnfolderBase]: For 50491/50491 co-relation queries the response was YES. [2025-04-14 01:18:47,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41737 conditions, 5446 events. 3516/5446 cut-off events. For 50491/50491 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 31329 event pairs, 266 based on Foata normal form. 1/5138 useless extension candidates. Maximal degree in co-relation 41502. Up to 4970 conditions per place. [2025-04-14 01:18:47,422 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 778 selfloop transitions, 179 changer transitions 1/958 dead transitions. [2025-04-14 01:18:47,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 958 transitions, 15939 flow [2025-04-14 01:18:47,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:18:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:18:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 140 transitions. [2025-04-14 01:18:47,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-04-14 01:18:47,423 INFO L175 Difference]: Start difference. First operand has 313 places, 918 transitions, 13724 flow. Second operand 15 states and 140 transitions. [2025-04-14 01:18:47,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 958 transitions, 15939 flow [2025-04-14 01:18:48,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 958 transitions, 15616 flow, removed 126 selfloop flow, removed 4 redundant places. [2025-04-14 01:18:48,014 INFO L231 Difference]: Finished difference. Result has 327 places, 933 transitions, 14081 flow [2025-04-14 01:18:48,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13401, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=14081, PETRI_PLACES=327, PETRI_TRANSITIONS=933} [2025-04-14 01:18:48,015 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 296 predicate places. [2025-04-14 01:18:48,015 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 933 transitions, 14081 flow [2025-04-14 01:18:48,016 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:48,016 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:48,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:18:48,016 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:18:48,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:48,017 INFO L85 PathProgramCache]: Analyzing trace with hash -702066488, now seen corresponding path program 16 times [2025-04-14 01:18:48,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:48,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892733382] [2025-04-14 01:18:48,017 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:18:48,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:48,022 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:48,027 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:48,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:18:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:48,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:48,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892733382] [2025-04-14 01:18:48,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892733382] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:48,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:48,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:18:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618272629] [2025-04-14 01:18:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:48,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:18:48,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:48,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:18:48,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:18:48,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:48,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 933 transitions, 14081 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:48,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:48,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:48,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:49,318 INFO L116 PetriNetUnfolderBase]: 3522/5467 cut-off events. [2025-04-14 01:18:49,318 INFO L117 PetriNetUnfolderBase]: For 52097/52097 co-relation queries the response was YES. [2025-04-14 01:18:49,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42294 conditions, 5467 events. 3522/5467 cut-off events. For 52097/52097 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 31563 event pairs, 297 based on Foata normal form. 1/5153 useless extension candidates. Maximal degree in co-relation 42049. Up to 5147 conditions per place. [2025-04-14 01:18:49,370 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 821 selfloop transitions, 133 changer transitions 4/958 dead transitions. [2025-04-14 01:18:49,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 958 transitions, 16202 flow [2025-04-14 01:18:49,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:18:49,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:18:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2025-04-14 01:18:49,371 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3 [2025-04-14 01:18:49,371 INFO L175 Difference]: Start difference. First operand has 327 places, 933 transitions, 14081 flow. Second operand 10 states and 96 transitions. [2025-04-14 01:18:49,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 958 transitions, 16202 flow [2025-04-14 01:18:49,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 958 transitions, 15918 flow, removed 49 selfloop flow, removed 10 redundant places. [2025-04-14 01:18:49,927 INFO L231 Difference]: Finished difference. Result has 328 places, 938 transitions, 14175 flow [2025-04-14 01:18:49,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13801, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14175, PETRI_PLACES=328, PETRI_TRANSITIONS=938} [2025-04-14 01:18:49,928 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 297 predicate places. [2025-04-14 01:18:49,928 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 938 transitions, 14175 flow [2025-04-14 01:18:49,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:49,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:49,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:49,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 01:18:49,928 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:18:49,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:49,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1304133014, now seen corresponding path program 17 times [2025-04-14 01:18:49,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:49,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193956987] [2025-04-14 01:18:49,929 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:49,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:49,941 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:49,941 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:50,255 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:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:50,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193956987] [2025-04-14 01:18:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193956987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:18:50,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967334810] [2025-04-14 01:18:50,255 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:18:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:18:50,257 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:18:50,260 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:18:50,298 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:50,313 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:18:50,313 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:18:50,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:50,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:18:50,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:18:50,324 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:50,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:18:50,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-14 01:18:50,572 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:50,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:18:51,379 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 112 treesize of output 98 [2025-04-14 01:18:51,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-14 01:18:51,452 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:18:51,455 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-14 01:18:51,546 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:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967334810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:18:51,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:18:51,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 23 [2025-04-14 01:18:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69269664] [2025-04-14 01:18:51,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:18:51,547 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 01:18:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:51,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 01:18:51,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2025-04-14 01:18:51,548 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:51,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 938 transitions, 14175 flow. Second operand has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call 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,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:51,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:51,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:55,423 INFO L116 PetriNetUnfolderBase]: 4820/7381 cut-off events. [2025-04-14 01:18:55,423 INFO L117 PetriNetUnfolderBase]: For 74164/74164 co-relation queries the response was YES. [2025-04-14 01:18:55,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58128 conditions, 7381 events. 4820/7381 cut-off events. For 74164/74164 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 44156 event pairs, 75 based on Foata normal form. 1/6987 useless extension candidates. Maximal degree in co-relation 57854. Up to 3154 conditions per place. [2025-04-14 01:18:55,501 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 357 selfloop transitions, 1115 changer transitions 2/1474 dead transitions. [2025-04-14 01:18:55,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 1474 transitions, 24266 flow [2025-04-14 01:18:55,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-14 01:18:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-14 01:18:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 496 transitions. [2025-04-14 01:18:55,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31 [2025-04-14 01:18:55,503 INFO L175 Difference]: Start difference. First operand has 328 places, 938 transitions, 14175 flow. Second operand 50 states and 496 transitions. [2025-04-14 01:18:55,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 1474 transitions, 24266 flow [2025-04-14 01:18:56,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1474 transitions, 24042 flow, removed 30 selfloop flow, removed 5 redundant places. [2025-04-14 01:18:56,500 INFO L231 Difference]: Finished difference. Result has 387 places, 1339 transitions, 23627 flow [2025-04-14 01:18:56,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13955, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=745, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=23627, PETRI_PLACES=387, PETRI_TRANSITIONS=1339} [2025-04-14 01:18:56,501 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 356 predicate places. [2025-04-14 01:18:56,501 INFO L485 AbstractCegarLoop]: Abstraction has has 387 places, 1339 transitions, 23627 flow [2025-04-14 01:18:56,501 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.32) internal successors, (133), 25 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call 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,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:18:56,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:18:56,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:18:56,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:18:56,702 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:18:56,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:18:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash -791178570, now seen corresponding path program 18 times [2025-04-14 01:18:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:18:56,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473177443] [2025-04-14 01:18:56,703 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:18:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:18:56,707 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:18:56,710 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:18:56,710 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:18:56,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:18:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:18:56,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:18:56,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473177443] [2025-04-14 01:18:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473177443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:18:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:18:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:18:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977824120] [2025-04-14 01:18:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:18:56,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:18:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:18:56,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:18:56,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:18:56,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:18:56,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 1339 transitions, 23627 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:18:56,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:18:56,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:18:56,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:18:59,011 INFO L116 PetriNetUnfolderBase]: 4858/7450 cut-off events. [2025-04-14 01:18:59,011 INFO L117 PetriNetUnfolderBase]: For 93363/93363 co-relation queries the response was YES. [2025-04-14 01:18:59,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66895 conditions, 7450 events. 4858/7450 cut-off events. For 93363/93363 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 44652 event pairs, 310 based on Foata normal form. 1/7061 useless extension candidates. Maximal degree in co-relation 66571. Up to 7043 conditions per place. [2025-04-14 01:18:59,090 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1224 selfloop transitions, 166 changer transitions 4/1394 dead transitions. [2025-04-14 01:18:59,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1394 transitions, 27172 flow [2025-04-14 01:18:59,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:18:59,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:18:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2025-04-14 01:18:59,091 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3098958333333333 [2025-04-14 01:18:59,091 INFO L175 Difference]: Start difference. First operand has 387 places, 1339 transitions, 23627 flow. Second operand 12 states and 119 transitions. [2025-04-14 01:18:59,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1394 transitions, 27172 flow [2025-04-14 01:19:01,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1394 transitions, 24858 flow, removed 1036 selfloop flow, removed 10 redundant places. [2025-04-14 01:19:01,239 INFO L231 Difference]: Finished difference. Result has 392 places, 1365 transitions, 22278 flow [2025-04-14 01:19:01,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21413, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22278, PETRI_PLACES=392, PETRI_TRANSITIONS=1365} [2025-04-14 01:19:01,240 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 361 predicate places. [2025-04-14 01:19:01,240 INFO L485 AbstractCegarLoop]: Abstraction has has 392 places, 1365 transitions, 22278 flow [2025-04-14 01:19:01,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:01,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:01,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:01,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 01:19:01,241 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:19:01,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 771560164, now seen corresponding path program 19 times [2025-04-14 01:19:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:01,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031848714] [2025-04-14 01:19:01,241 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:01,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:01,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:01,653 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:19:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:01,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031848714] [2025-04-14 01:19:01,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031848714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:01,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645627603] [2025-04-14 01:19:01,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:01,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:01,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:01,656 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:01,658 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:01,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:01,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:01,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:01,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:01,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:19:01,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:01,739 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:01,911 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:19:01,911 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 43 [2025-04-14 01:19:02,009 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:19:02,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:03,043 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 98 treesize of output 88 [2025-04-14 01:19:03,045 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-14 01:19:03,101 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 76 treesize of output 66 [2025-04-14 01:19:03,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-14 01:19:03,127 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:19:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645627603] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:03,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-14 01:19:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360749452] [2025-04-14 01:19:03,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:03,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:19:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:03,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:19:03,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:19:03,128 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:03,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1365 transitions, 22278 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call 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,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:07,890 INFO L116 PetriNetUnfolderBase]: 6790/10297 cut-off events. [2025-04-14 01:19:07,890 INFO L117 PetriNetUnfolderBase]: For 70131/70131 co-relation queries the response was YES. [2025-04-14 01:19:07,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83333 conditions, 10297 events. 6790/10297 cut-off events. For 70131/70131 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 64004 event pairs, 229 based on Foata normal form. 1/9651 useless extension candidates. Maximal degree in co-relation 83103. Up to 6000 conditions per place. [2025-04-14 01:19:07,993 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 891 selfloop transitions, 1224 changer transitions 1/2116 dead transitions. [2025-04-14 01:19:07,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2116 transitions, 37788 flow [2025-04-14 01:19:07,994 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:19:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:19:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 428 transitions. [2025-04-14 01:19:07,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34294871794871795 [2025-04-14 01:19:07,995 INFO L175 Difference]: Start difference. First operand has 392 places, 1365 transitions, 22278 flow. Second operand 39 states and 428 transitions. [2025-04-14 01:19:07,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 2116 transitions, 37788 flow [2025-04-14 01:19:09,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 2116 transitions, 37339 flow, removed 49 selfloop flow, removed 7 redundant places. [2025-04-14 01:19:09,670 INFO L231 Difference]: Finished difference. Result has 439 places, 1925 transitions, 34902 flow [2025-04-14 01:19:09,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21924, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=771, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=34902, PETRI_PLACES=439, PETRI_TRANSITIONS=1925} [2025-04-14 01:19:09,671 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 408 predicate places. [2025-04-14 01:19:09,671 INFO L485 AbstractCegarLoop]: Abstraction has has 439 places, 1925 transitions, 34902 flow [2025-04-14 01:19:09,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:09,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:09,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:09,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:19:09,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:09,872 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:09,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1824097010, now seen corresponding path program 20 times [2025-04-14 01:19:09,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:09,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696235719] [2025-04-14 01:19:09,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:09,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:09,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:09,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:10,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:10,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696235719] [2025-04-14 01:19:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696235719] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:10,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:10,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:10,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952565530] [2025-04-14 01:19:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:10,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:10,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:10,202 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1925 transitions, 34902 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:13,298 INFO L116 PetriNetUnfolderBase]: 6845/10403 cut-off events. [2025-04-14 01:19:13,298 INFO L117 PetriNetUnfolderBase]: For 87841/87841 co-relation queries the response was YES. [2025-04-14 01:19:13,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92112 conditions, 10403 events. 6845/10403 cut-off events. For 87841/87841 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 65026 event pairs, 481 based on Foata normal form. 1/9772 useless extension candidates. Maximal degree in co-relation 91854. Up to 10005 conditions per place. [2025-04-14 01:19:13,406 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1781 selfloop transitions, 187 changer transitions 3/1971 dead transitions. [2025-04-14 01:19:13,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 1971 transitions, 39458 flow [2025-04-14 01:19:13,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:19:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:19:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2025-04-14 01:19:13,408 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3210227272727273 [2025-04-14 01:19:13,408 INFO L175 Difference]: Start difference. First operand has 439 places, 1925 transitions, 34902 flow. Second operand 11 states and 113 transitions. [2025-04-14 01:19:13,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 1971 transitions, 39458 flow [2025-04-14 01:19:15,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 1971 transitions, 38189 flow, removed 599 selfloop flow, removed 4 redundant places. [2025-04-14 01:19:15,788 INFO L231 Difference]: Finished difference. Result has 447 places, 1942 transitions, 34422 flow [2025-04-14 01:19:15,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33689, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1739, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=34422, PETRI_PLACES=447, PETRI_TRANSITIONS=1942} [2025-04-14 01:19:15,789 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 416 predicate places. [2025-04-14 01:19:15,790 INFO L485 AbstractCegarLoop]: Abstraction has has 447 places, 1942 transitions, 34422 flow [2025-04-14 01:19:15,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:15,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:15,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:15,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 01:19:15,790 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:15,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:15,790 INFO L85 PathProgramCache]: Analyzing trace with hash 631027970, now seen corresponding path program 21 times [2025-04-14 01:19:15,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:15,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988174567] [2025-04-14 01:19:15,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:19:15,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:15,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:15,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:15,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:19:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:16,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988174567] [2025-04-14 01:19:16,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988174567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:16,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:16,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:19:16,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183239742] [2025-04-14 01:19:16,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:16,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:19:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:16,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:19:16,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:16,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:16,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 1942 transitions, 34422 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:16,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:16,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:19,063 INFO L116 PetriNetUnfolderBase]: 6894/10491 cut-off events. [2025-04-14 01:19:19,064 INFO L117 PetriNetUnfolderBase]: For 77585/77585 co-relation queries the response was YES. [2025-04-14 01:19:19,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90683 conditions, 10491 events. 6894/10491 cut-off events. For 77585/77585 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 65814 event pairs, 496 based on Foata normal form. 2/9853 useless extension candidates. Maximal degree in co-relation 90422. Up to 9936 conditions per place. [2025-04-14 01:19:19,343 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1762 selfloop transitions, 222 changer transitions 2/1986 dead transitions. [2025-04-14 01:19:19,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 1986 transitions, 38905 flow [2025-04-14 01:19:19,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:19:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:19:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 132 transitions. [2025-04-14 01:19:19,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29464285714285715 [2025-04-14 01:19:19,344 INFO L175 Difference]: Start difference. First operand has 447 places, 1942 transitions, 34422 flow. Second operand 14 states and 132 transitions. [2025-04-14 01:19:19,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 1986 transitions, 38905 flow [2025-04-14 01:19:21,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 1986 transitions, 38643 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-04-14 01:19:21,306 INFO L231 Difference]: Finished difference. Result has 457 places, 1955 transitions, 34985 flow [2025-04-14 01:19:21,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=34160, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=34985, PETRI_PLACES=457, PETRI_TRANSITIONS=1955} [2025-04-14 01:19:21,308 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 426 predicate places. [2025-04-14 01:19:21,308 INFO L485 AbstractCegarLoop]: Abstraction has has 457 places, 1955 transitions, 34985 flow [2025-04-14 01:19:21,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:21,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:21,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:21,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 01:19:21,308 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:21,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1836184214, now seen corresponding path program 22 times [2025-04-14 01:19:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:21,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641125190] [2025-04-14 01:19:21,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:19:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:21,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:21,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:21,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:19:21,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:21,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:21,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641125190] [2025-04-14 01:19:21,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641125190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:21,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:21,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009823358] [2025-04-14 01:19:21,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:21,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:21,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:21,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:21,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:21,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 1955 transitions, 34985 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:21,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:21,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:21,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:24,961 INFO L116 PetriNetUnfolderBase]: 6913/10531 cut-off events. [2025-04-14 01:19:24,961 INFO L117 PetriNetUnfolderBase]: For 81348/81348 co-relation queries the response was YES. [2025-04-14 01:19:25,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91707 conditions, 10531 events. 6913/10531 cut-off events. For 81348/81348 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 66251 event pairs, 426 based on Foata normal form. 1/9892 useless extension candidates. Maximal degree in co-relation 91432. Up to 8944 conditions per place. [2025-04-14 01:19:25,068 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 1527 selfloop transitions, 529 changer transitions 4/2060 dead transitions. [2025-04-14 01:19:25,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 2060 transitions, 40603 flow [2025-04-14 01:19:25,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:19:25,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:19:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 152 transitions. [2025-04-14 01:19:25,069 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31666666666666665 [2025-04-14 01:19:25,069 INFO L175 Difference]: Start difference. First operand has 457 places, 1955 transitions, 34985 flow. Second operand 15 states and 152 transitions. [2025-04-14 01:19:25,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 2060 transitions, 40603 flow [2025-04-14 01:19:27,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 2060 transitions, 40151 flow, removed 27 selfloop flow, removed 9 redundant places. [2025-04-14 01:19:27,124 INFO L231 Difference]: Finished difference. Result has 466 places, 1983 transitions, 36912 flow [2025-04-14 01:19:27,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=34541, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=36912, PETRI_PLACES=466, PETRI_TRANSITIONS=1983} [2025-04-14 01:19:27,126 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 435 predicate places. [2025-04-14 01:19:27,126 INFO L485 AbstractCegarLoop]: Abstraction has has 466 places, 1983 transitions, 36912 flow [2025-04-14 01:19:27,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:27,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:27,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:27,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 01:19:27,126 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:27,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:27,127 INFO L85 PathProgramCache]: Analyzing trace with hash 796130394, now seen corresponding path program 23 times [2025-04-14 01:19:27,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:27,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956970984] [2025-04-14 01:19:27,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:27,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:27,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:27,135 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:27,135 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:27,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:27,410 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:19:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:27,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956970984] [2025-04-14 01:19:27,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956970984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:27,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365290460] [2025-04-14 01:19:27,411 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:19:27,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:27,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:27,413 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:27,413 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:27,450 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:27,462 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:27,462 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:19:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:27,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:19:27,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:27,472 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:27,589 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 58 treesize of output 34 [2025-04-14 01:19:27,623 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:19:27,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:28,593 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 112 treesize of output 98 [2025-04-14 01:19:28,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 127 [2025-04-14 01:19:28,706 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:19:28,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 121 treesize of output 111 [2025-04-14 01:19:28,864 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:19:28,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365290460] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:28,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:28,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 20 [2025-04-14 01:19:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237661302] [2025-04-14 01:19:28,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:28,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 01:19:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:28,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 01:19:28,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-14 01:19:28,865 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:28,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1983 transitions, 36912 flow. Second operand has 22 states, 22 states have (on average 5.409090909090909) internal successors, (119), 22 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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:28,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:28,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:28,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:33,918 INFO L116 PetriNetUnfolderBase]: 7595/11589 cut-off events. [2025-04-14 01:19:33,918 INFO L117 PetriNetUnfolderBase]: For 101796/101796 co-relation queries the response was YES. [2025-04-14 01:19:34,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103458 conditions, 11589 events. 7595/11589 cut-off events. For 101796/101796 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 73998 event pairs, 217 based on Foata normal form. 2/10903 useless extension candidates. Maximal degree in co-relation 103156. Up to 6298 conditions per place. [2025-04-14 01:19:34,246 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1050 selfloop transitions, 1273 changer transitions 3/2326 dead transitions. [2025-04-14 01:19:34,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 2326 transitions, 46739 flow [2025-04-14 01:19:34,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:19:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:19:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 305 transitions. [2025-04-14 01:19:34,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3074596774193548 [2025-04-14 01:19:34,247 INFO L175 Difference]: Start difference. First operand has 466 places, 1983 transitions, 36912 flow. Second operand 31 states and 305 transitions. [2025-04-14 01:19:34,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 2326 transitions, 46739 flow [2025-04-14 01:19:36,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 2326 transitions, 46556 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-14 01:19:36,558 INFO L231 Difference]: Finished difference. Result has 500 places, 2212 transitions, 44755 flow [2025-04-14 01:19:36,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36729, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=44755, PETRI_PLACES=500, PETRI_TRANSITIONS=2212} [2025-04-14 01:19:36,560 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 469 predicate places. [2025-04-14 01:19:36,560 INFO L485 AbstractCegarLoop]: Abstraction has has 500 places, 2212 transitions, 44755 flow [2025-04-14 01:19:36,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.409090909090909) internal successors, (119), 22 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call 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,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:36,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:36,567 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:36,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:36,761 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:19:36,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1621910454, now seen corresponding path program 24 times [2025-04-14 01:19:36,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:36,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83665628] [2025-04-14 01:19:36,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:19:36,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:36,766 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:36,770 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:36,770 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:19:36,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:37,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83665628] [2025-04-14 01:19:37,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83665628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:37,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 01:19:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080437106] [2025-04-14 01:19:37,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:37,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 01:19:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:37,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 01:19:37,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:19:37,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:37,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 2212 transitions, 44755 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:37,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:37,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:37,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:41,588 INFO L116 PetriNetUnfolderBase]: 7899/12034 cut-off events. [2025-04-14 01:19:41,588 INFO L117 PetriNetUnfolderBase]: For 131975/131975 co-relation queries the response was YES. [2025-04-14 01:19:41,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117589 conditions, 12034 events. 7899/12034 cut-off events. For 131975/131975 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 77074 event pairs, 510 based on Foata normal form. 2/11328 useless extension candidates. Maximal degree in co-relation 117258. Up to 10426 conditions per place. [2025-04-14 01:19:41,725 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1645 selfloop transitions, 728 changer transitions 2/2375 dead transitions. [2025-04-14 01:19:41,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 2375 transitions, 52336 flow [2025-04-14 01:19:41,725 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-14 01:19:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-14 01:19:41,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 225 transitions. [2025-04-14 01:19:41,726 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30570652173913043 [2025-04-14 01:19:41,726 INFO L175 Difference]: Start difference. First operand has 500 places, 2212 transitions, 44755 flow. Second operand 23 states and 225 transitions. [2025-04-14 01:19:41,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 2375 transitions, 52336 flow [2025-04-14 01:19:44,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 2375 transitions, 51152 flow, removed 382 selfloop flow, removed 17 redundant places. [2025-04-14 01:19:44,893 INFO L231 Difference]: Finished difference. Result has 512 places, 2331 transitions, 48619 flow [2025-04-14 01:19:44,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43642, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=608, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=48619, PETRI_PLACES=512, PETRI_TRANSITIONS=2331} [2025-04-14 01:19:44,896 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 481 predicate places. [2025-04-14 01:19:44,896 INFO L485 AbstractCegarLoop]: Abstraction has has 512 places, 2331 transitions, 48619 flow [2025-04-14 01:19:44,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:44,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:44,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:44,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 01:19:44,897 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:19:44,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1664171860, now seen corresponding path program 25 times [2025-04-14 01:19:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:44,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804625501] [2025-04-14 01:19:44,897 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:44,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:44,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:44,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:44,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:45,232 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:19:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:45,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804625501] [2025-04-14 01:19:45,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804625501] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:19:45,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071459336] [2025-04-14 01:19:45,232 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:19:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:19:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:19:45,234 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:45,235 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:45,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:19:45,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:19:45,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:19:45,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:45,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-14 01:19:45,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:19:45,304 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:45,424 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 59 treesize of output 35 [2025-04-14 01:19:45,467 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:19:45,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:19:46,365 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 76 treesize of output 66 [2025-04-14 01:19:46,367 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 93 treesize of output 83 [2025-04-14 01:19:46,401 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 98 treesize of output 88 [2025-04-14 01:19:46,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 119 treesize of output 109 [2025-04-14 01:19:46,484 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:19:46,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071459336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:19:46,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:19:46,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2025-04-14 01:19:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740668932] [2025-04-14 01:19:46,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:19:46,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:19:46,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:46,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:19:46,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:19:46,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:46,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 2331 transitions, 48619 flow. Second operand has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call 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:46,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:46,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:46,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:19:52,537 INFO L116 PetriNetUnfolderBase]: 7961/12146 cut-off events. [2025-04-14 01:19:52,538 INFO L117 PetriNetUnfolderBase]: For 128745/128745 co-relation queries the response was YES. [2025-04-14 01:19:52,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120446 conditions, 12146 events. 7961/12146 cut-off events. For 128745/128745 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 78032 event pairs, 385 based on Foata normal form. 2/11412 useless extension candidates. Maximal degree in co-relation 120179. Up to 9430 conditions per place. [2025-04-14 01:19:52,712 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1605 selfloop transitions, 855 changer transitions 7/2467 dead transitions. [2025-04-14 01:19:52,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 2467 transitions, 55134 flow [2025-04-14 01:19:52,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 01:19:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-14 01:19:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 286 transitions. [2025-04-14 01:19:52,714 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28830645161290325 [2025-04-14 01:19:52,714 INFO L175 Difference]: Start difference. First operand has 512 places, 2331 transitions, 48619 flow. Second operand 31 states and 286 transitions. [2025-04-14 01:19:52,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 2467 transitions, 55134 flow [2025-04-14 01:19:56,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 2467 transitions, 54150 flow, removed 117 selfloop flow, removed 13 redundant places. [2025-04-14 01:19:56,539 INFO L231 Difference]: Finished difference. Result has 537 places, 2362 transitions, 49995 flow [2025-04-14 01:19:56,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=47639, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=833, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=49995, PETRI_PLACES=537, PETRI_TRANSITIONS=2362} [2025-04-14 01:19:56,541 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 506 predicate places. [2025-04-14 01:19:56,541 INFO L485 AbstractCegarLoop]: Abstraction has has 537 places, 2362 transitions, 49995 flow [2025-04-14 01:19:56,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.222222222222222) internal successors, (141), 27 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call 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,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:19:56,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:19:56,547 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:56,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-14 01:19:56,742 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:19:56,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:19:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash -716182734, now seen corresponding path program 26 times [2025-04-14 01:19:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:19:56,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846432160] [2025-04-14 01:19:56,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:19:56,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:19:56,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-14 01:19:56,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-14 01:19:56,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:19:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:19:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:19:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:19:56,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846432160] [2025-04-14 01:19:56,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846432160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:19:56,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:19:56,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:19:56,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255131602] [2025-04-14 01:19:56,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:19:56,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:19:56,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:19:56,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:19:56,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:19:56,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:19:56,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 2362 transitions, 49995 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:19:56,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:19:56,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:19:56,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:01,741 INFO L116 PetriNetUnfolderBase]: 7963/12153 cut-off events. [2025-04-14 01:20:01,742 INFO L117 PetriNetUnfolderBase]: For 138069/138069 co-relation queries the response was YES. [2025-04-14 01:20:01,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122356 conditions, 12153 events. 7963/12153 cut-off events. For 138069/138069 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 78180 event pairs, 557 based on Foata normal form. 1/11464 useless extension candidates. Maximal degree in co-relation 122082. Up to 11764 conditions per place. [2025-04-14 01:20:01,902 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 2217 selfloop transitions, 170 changer transitions 1/2388 dead transitions. [2025-04-14 01:20:01,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 2388 transitions, 55062 flow [2025-04-14 01:20:01,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-14 01:20:01,903 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.321875 [2025-04-14 01:20:01,903 INFO L175 Difference]: Start difference. First operand has 537 places, 2362 transitions, 49995 flow. Second operand 10 states and 103 transitions. [2025-04-14 01:20:01,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 2388 transitions, 55062 flow [2025-04-14 01:20:05,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 2388 transitions, 54289 flow, removed 182 selfloop flow, removed 15 redundant places. [2025-04-14 01:20:05,229 INFO L231 Difference]: Finished difference. Result has 533 places, 2368 transitions, 49741 flow [2025-04-14 01:20:05,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49196, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=49741, PETRI_PLACES=533, PETRI_TRANSITIONS=2368} [2025-04-14 01:20:05,231 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 502 predicate places. [2025-04-14 01:20:05,231 INFO L485 AbstractCegarLoop]: Abstraction has has 533 places, 2368 transitions, 49741 flow [2025-04-14 01:20:05,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:05,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:05,231 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] [2025-04-14 01:20:05,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 01:20:05,232 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:05,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2053541900, now seen corresponding path program 27 times [2025-04-14 01:20:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:05,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953786758] [2025-04-14 01:20:05,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:05,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:05,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:20:05,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-14 01:20:05,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:20:05,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:05,452 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:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:05,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953786758] [2025-04-14 01:20:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953786758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 01:20:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070557599] [2025-04-14 01:20:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:05,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:05,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:05,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:05,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:05,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 2368 transitions, 49741 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:05,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:05,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:05,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:09,995 INFO L116 PetriNetUnfolderBase]: 8259/12656 cut-off events. [2025-04-14 01:20:09,995 INFO L117 PetriNetUnfolderBase]: For 144613/144613 co-relation queries the response was YES. [2025-04-14 01:20:10,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126665 conditions, 12656 events. 8259/12656 cut-off events. For 144613/144613 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 82615 event pairs, 322 based on Foata normal form. 2/11928 useless extension candidates. Maximal degree in co-relation 126392. Up to 11217 conditions per place. [2025-04-14 01:20:10,174 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 2017 selfloop transitions, 546 changer transitions 5/2568 dead transitions. [2025-04-14 01:20:10,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 2568 transitions, 58637 flow [2025-04-14 01:20:10,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:20:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:20:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2025-04-14 01:20:10,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.390625 [2025-04-14 01:20:10,175 INFO L175 Difference]: Start difference. First operand has 533 places, 2368 transitions, 49741 flow. Second operand 10 states and 125 transitions. [2025-04-14 01:20:10,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 2568 transitions, 58637 flow [2025-04-14 01:20:14,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 2568 transitions, 58303 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:14,107 INFO L231 Difference]: Finished difference. Result has 539 places, 2516 transitions, 54249 flow [2025-04-14 01:20:14,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49407, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=418, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1855, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=54249, PETRI_PLACES=539, PETRI_TRANSITIONS=2516} [2025-04-14 01:20:14,109 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 508 predicate places. [2025-04-14 01:20:14,110 INFO L485 AbstractCegarLoop]: Abstraction has has 539 places, 2516 transitions, 54249 flow [2025-04-14 01:20:14,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:14,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:14,110 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] [2025-04-14 01:20:14,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 01:20:14,110 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:14,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1952522934, now seen corresponding path program 28 times [2025-04-14 01:20:14,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:14,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127577718] [2025-04-14 01:20:14,111 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:14,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:14,117 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:20:14,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:20:14,121 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:14,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:14,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127577718] [2025-04-14 01:20:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127577718] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:14,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23742061] [2025-04-14 01:20:14,154 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:14,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:14,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:14,156 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:20:14,157 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:20:14,200 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-14 01:20:14,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:20:14,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:20:14,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:14,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:20:14,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:14,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23742061] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-14 01:20:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244652745] [2025-04-14 01:20:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:14,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:14,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-14 01:20:14,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:14,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 2516 transitions, 54249 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:14,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:14,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:14,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:21,026 INFO L116 PetriNetUnfolderBase]: 10530/15921 cut-off events. [2025-04-14 01:20:21,026 INFO L117 PetriNetUnfolderBase]: For 193561/193561 co-relation queries the response was YES. [2025-04-14 01:20:21,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158325 conditions, 15921 events. 10530/15921 cut-off events. For 193561/193561 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 104448 event pairs, 2475 based on Foata normal form. 258/15429 useless extension candidates. Maximal degree in co-relation 158044. Up to 8455 conditions per place. [2025-04-14 01:20:21,267 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 3202 selfloop transitions, 190 changer transitions 0/3392 dead transitions. [2025-04-14 01:20:21,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 3392 transitions, 77099 flow [2025-04-14 01:20:21,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-14 01:20:21,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-14 01:20:21,268 INFO L175 Difference]: Start difference. First operand has 539 places, 2516 transitions, 54249 flow. Second operand 6 states and 87 transitions. [2025-04-14 01:20:21,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 3392 transitions, 77099 flow [2025-04-14 01:20:27,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 3392 transitions, 76733 flow, removed 76 selfloop flow, removed 6 redundant places. [2025-04-14 01:20:27,260 INFO L231 Difference]: Finished difference. Result has 540 places, 2442 transitions, 52175 flow [2025-04-14 01:20:27,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=49011, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=52175, PETRI_PLACES=540, PETRI_TRANSITIONS=2442} [2025-04-14 01:20:27,262 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 509 predicate places. [2025-04-14 01:20:27,262 INFO L485 AbstractCegarLoop]: Abstraction has has 540 places, 2442 transitions, 52175 flow [2025-04-14 01:20:27,262 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:27,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:27,263 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:20:27,269 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:20:27,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:27,463 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:27,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:27,464 INFO L85 PathProgramCache]: Analyzing trace with hash -853947411, now seen corresponding path program 1 times [2025-04-14 01:20:27,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:27,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414722798] [2025-04-14 01:20:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:27,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:27,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:27,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:27,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:27,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:27,499 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:20:27,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:27,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414722798] [2025-04-14 01:20:27,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414722798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:27,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555510076] [2025-04-14 01:20:27,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:27,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:27,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:27,502 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:20:27,502 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:20:27,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:27,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:27,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:27,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:27,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:27,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:27,581 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:20:27,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:27,605 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:20:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555510076] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:27,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-14 01:20:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941913404] [2025-04-14 01:20:27,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:27,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:20:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:20:27,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:20:27,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:27,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 2442 transitions, 52175 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:20:27,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:27,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:27,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:32,062 INFO L116 PetriNetUnfolderBase]: 6963/10774 cut-off events. [2025-04-14 01:20:32,063 INFO L117 PetriNetUnfolderBase]: For 137748/137748 co-relation queries the response was YES. [2025-04-14 01:20:32,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104626 conditions, 10774 events. 6963/10774 cut-off events. For 137748/137748 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 69242 event pairs, 1664 based on Foata normal form. 234/10558 useless extension candidates. Maximal degree in co-relation 104326. Up to 5752 conditions per place. [2025-04-14 01:20:32,191 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 2262 selfloop transitions, 44 changer transitions 7/2313 dead transitions. [2025-04-14 01:20:32,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2313 transitions, 51979 flow [2025-04-14 01:20:32,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-14 01:20:32,192 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-14 01:20:32,192 INFO L175 Difference]: Start difference. First operand has 540 places, 2442 transitions, 52175 flow. Second operand 6 states and 82 transitions. [2025-04-14 01:20:32,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2313 transitions, 51979 flow [2025-04-14 01:20:35,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 2313 transitions, 50733 flow, removed 514 selfloop flow, removed 17 redundant places. [2025-04-14 01:20:35,257 INFO L231 Difference]: Finished difference. Result has 515 places, 1919 transitions, 39082 flow [2025-04-14 01:20:35,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38512, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=39082, PETRI_PLACES=515, PETRI_TRANSITIONS=1919} [2025-04-14 01:20:35,259 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 484 predicate places. [2025-04-14 01:20:35,259 INFO L485 AbstractCegarLoop]: Abstraction has has 515 places, 1919 transitions, 39082 flow [2025-04-14 01:20:35,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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:20:35,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:35,259 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:35,266 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:20:35,460 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,SelfDestructingSolverStorable31 [2025-04-14 01:20:35,460 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:35,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash -654472491, now seen corresponding path program 1 times [2025-04-14 01:20:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:35,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577472073] [2025-04-14 01:20:35,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:35,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:35,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:35,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:35,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577472073] [2025-04-14 01:20:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577472073] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:35,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255462655] [2025-04-14 01:20:35,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:35,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:35,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:35,609 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:20:35,610 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:20:35,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:35,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:35,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:35,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:35,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-14 01:20:35,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:35,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:35,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:20:35,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255462655] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:35,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:35,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966562231] [2025-04-14 01:20:35,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:35,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:35,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:35,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:35,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:35,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:35,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 1919 transitions, 39082 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:35,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:35,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:35,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:38,680 INFO L116 PetriNetUnfolderBase]: 6001/9344 cut-off events. [2025-04-14 01:20:38,681 INFO L117 PetriNetUnfolderBase]: For 105633/105633 co-relation queries the response was YES. [2025-04-14 01:20:38,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90254 conditions, 9344 events. 6001/9344 cut-off events. For 105633/105633 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 59132 event pairs, 1620 based on Foata normal form. 214/9234 useless extension candidates. Maximal degree in co-relation 90009. Up to 7601 conditions per place. [2025-04-14 01:20:38,819 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1893 selfloop transitions, 78 changer transitions 78/2049 dead transitions. [2025-04-14 01:20:38,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 2049 transitions, 45644 flow [2025-04-14 01:20:38,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-04-14 01:20:38,820 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-14 01:20:38,820 INFO L175 Difference]: Start difference. First operand has 515 places, 1919 transitions, 39082 flow. Second operand 6 states and 74 transitions. [2025-04-14 01:20:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 2049 transitions, 45644 flow [2025-04-14 01:20:41,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 2049 transitions, 45487 flow, removed 62 selfloop flow, removed 11 redundant places. [2025-04-14 01:20:41,191 INFO L231 Difference]: Finished difference. Result has 504 places, 1856 transitions, 38352 flow [2025-04-14 01:20:41,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38132, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1868, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1790, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=38352, PETRI_PLACES=504, PETRI_TRANSITIONS=1856} [2025-04-14 01:20:41,192 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 473 predicate places. [2025-04-14 01:20:41,192 INFO L485 AbstractCegarLoop]: Abstraction has has 504 places, 1856 transitions, 38352 flow [2025-04-14 01:20:41,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call 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:41,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:41,192 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:41,199 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:20:41,393 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,SelfDestructingSolverStorable32 [2025-04-14 01:20:41,393 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:20:41,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1183992771, now seen corresponding path program 1 times [2025-04-14 01:20:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:41,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364545035] [2025-04-14 01:20:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:41,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:41,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:41,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:41,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:41,430 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:20:41,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:41,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364545035] [2025-04-14 01:20:41,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364545035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:41,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450914793] [2025-04-14 01:20:41,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:20:41,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:41,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:41,433 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:41,433 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:41,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-14 01:20:41,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-14 01:20:41,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:20:41,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:41,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:41,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:41,521 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:20:41,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:41,554 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:20:41,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450914793] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:41,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:41,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-14 01:20:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666352114] [2025-04-14 01:20:41,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:41,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:20:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:41,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:20:41,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:41,556 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:41,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 1856 transitions, 38352 flow. Second operand has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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:41,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:41,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:41,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:44,303 INFO L116 PetriNetUnfolderBase]: 5367/8132 cut-off events. [2025-04-14 01:20:44,304 INFO L117 PetriNetUnfolderBase]: For 94975/94975 co-relation queries the response was YES. [2025-04-14 01:20:44,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81421 conditions, 8132 events. 5367/8132 cut-off events. For 94975/94975 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 47179 event pairs, 1422 based on Foata normal form. 154/8034 useless extension candidates. Maximal degree in co-relation 81192. Up to 7601 conditions per place. [2025-04-14 01:20:44,417 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1627 selfloop transitions, 3 changer transitions 171/1801 dead transitions. [2025-04-14 01:20:44,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1801 transitions, 40994 flow [2025-04-14 01:20:44,417 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:44,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-14 01:20:44,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.359375 [2025-04-14 01:20:44,418 INFO L175 Difference]: Start difference. First operand has 504 places, 1856 transitions, 38352 flow. Second operand 6 states and 69 transitions. [2025-04-14 01:20:44,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1801 transitions, 40994 flow [2025-04-14 01:20:46,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 1801 transitions, 40211 flow, removed 109 selfloop flow, removed 20 redundant places. [2025-04-14 01:20:46,358 INFO L231 Difference]: Finished difference. Result has 476 places, 1630 transitions, 32893 flow [2025-04-14 01:20:46,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35822, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=32893, PETRI_PLACES=476, PETRI_TRANSITIONS=1630} [2025-04-14 01:20:46,359 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 445 predicate places. [2025-04-14 01:20:46,359 INFO L485 AbstractCegarLoop]: Abstraction has has 476 places, 1630 transitions, 32893 flow [2025-04-14 01:20:46,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.0) internal successors, (84), 12 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call 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,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:46,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] [2025-04-14 01:20:46,365 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:46,560 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,SelfDestructingSolverStorable33 [2025-04-14 01:20:46,560 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:20:46,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -386197653, now seen corresponding path program 2 times [2025-04-14 01:20:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:46,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961778872] [2025-04-14 01:20:46,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:20:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:46,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:46,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:20:46,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:20:46,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:46,591 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:46,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:46,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961778872] [2025-04-14 01:20:46,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961778872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:46,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:20:46,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171934623] [2025-04-14 01:20:46,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:46,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:46,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:46,592 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:46,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 1630 transitions, 32893 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:46,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:46,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:46,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:48,804 INFO L116 PetriNetUnfolderBase]: 5318/7872 cut-off events. [2025-04-14 01:20:48,804 INFO L117 PetriNetUnfolderBase]: For 80067/80067 co-relation queries the response was YES. [2025-04-14 01:20:48,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76196 conditions, 7872 events. 5318/7872 cut-off events. For 80067/80067 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 44047 event pairs, 371 based on Foata normal form. 8/7618 useless extension candidates. Maximal degree in co-relation 76034. Up to 5001 conditions per place. [2025-04-14 01:20:48,915 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1609 selfloop transitions, 204 changer transitions 0/1813 dead transitions. [2025-04-14 01:20:48,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 1813 transitions, 39463 flow [2025-04-14 01:20:48,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:20:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:20:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-14 01:20:48,916 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2025-04-14 01:20:48,916 INFO L175 Difference]: Start difference. First operand has 476 places, 1630 transitions, 32893 flow. Second operand 6 states and 97 transitions. [2025-04-14 01:20:48,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 1813 transitions, 39463 flow [2025-04-14 01:20:50,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1813 transitions, 38669 flow, removed 135 selfloop flow, removed 14 redundant places. [2025-04-14 01:20:50,608 INFO L231 Difference]: Finished difference. Result has 460 places, 1636 transitions, 32812 flow [2025-04-14 01:20:50,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=32121, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=32812, PETRI_PLACES=460, PETRI_TRANSITIONS=1636} [2025-04-14 01:20:50,609 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 429 predicate places. [2025-04-14 01:20:50,609 INFO L485 AbstractCegarLoop]: Abstraction has has 460 places, 1636 transitions, 32812 flow [2025-04-14 01:20:50,609 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:50,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:50,609 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:50,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-14 01:20:50,609 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:20:50,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -146303313, now seen corresponding path program 3 times [2025-04-14 01:20:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:50,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62543940] [2025-04-14 01:20:50,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:50,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:50,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:50,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:50,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:50,641 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:20:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:50,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62543940] [2025-04-14 01:20:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62543940] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:50,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444699063] [2025-04-14 01:20:50,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:20:50,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:50,643 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:50,645 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:50,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:50,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:50,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:20:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:50,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:20:50,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:50,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:20:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444699063] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:50,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:20:50,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:20:50,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605342035] [2025-04-14 01:20:50,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:50,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:20:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:50,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:20:50,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:20:50,793 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:50,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 1636 transitions, 32812 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:50,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:50,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:50,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:52,860 INFO L116 PetriNetUnfolderBase]: 5407/8014 cut-off events. [2025-04-14 01:20:52,860 INFO L117 PetriNetUnfolderBase]: For 87952/87952 co-relation queries the response was YES. [2025-04-14 01:20:52,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77284 conditions, 8014 events. 5407/8014 cut-off events. For 87952/87952 co-relation queries the response was YES. Maximal size of possible extension queue 576. Compared 45002 event pairs, 537 based on Foata normal form. 39/7789 useless extension candidates. Maximal degree in co-relation 77128. Up to 5938 conditions per place. [2025-04-14 01:20:52,967 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1523 selfloop transitions, 197 changer transitions 0/1720 dead transitions. [2025-04-14 01:20:52,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 1720 transitions, 37831 flow [2025-04-14 01:20:52,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:20:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:20:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-14 01:20:52,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-14 01:20:52,968 INFO L175 Difference]: Start difference. First operand has 460 places, 1636 transitions, 32812 flow. Second operand 7 states and 78 transitions. [2025-04-14 01:20:52,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 1720 transitions, 37831 flow [2025-04-14 01:20:54,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1720 transitions, 37523 flow, removed 33 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:54,590 INFO L231 Difference]: Finished difference. Result has 462 places, 1641 transitions, 33582 flow [2025-04-14 01:20:54,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=32376, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=33582, PETRI_PLACES=462, PETRI_TRANSITIONS=1641} [2025-04-14 01:20:54,592 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 431 predicate places. [2025-04-14 01:20:54,592 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 1641 transitions, 33582 flow [2025-04-14 01:20:54,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:54,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:54,592 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:54,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 01:20:54,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-14 01:20:54,792 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:20:54,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -830618677, now seen corresponding path program 4 times [2025-04-14 01:20:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:54,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907908192] [2025-04-14 01:20:54,793 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:20:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:54,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:54,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-14 01:20:54,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-14 01:20:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:54,826 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,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:54,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907908192] [2025-04-14 01:20:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907908192] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:20:54,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:20:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:20:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310678132] [2025-04-14 01:20:54,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:20:54,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:20:54,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:54,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:20:54,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:20:54,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:54,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1641 transitions, 33582 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:54,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:54,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:54,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:20:57,112 INFO L116 PetriNetUnfolderBase]: 5963/8773 cut-off events. [2025-04-14 01:20:57,113 INFO L117 PetriNetUnfolderBase]: For 94945/94945 co-relation queries the response was YES. [2025-04-14 01:20:57,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85351 conditions, 8773 events. 5963/8773 cut-off events. For 94945/94945 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 49460 event pairs, 215 based on Foata normal form. 12/8551 useless extension candidates. Maximal degree in co-relation 85191. Up to 4914 conditions per place. [2025-04-14 01:20:57,228 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1766 selfloop transitions, 327 changer transitions 1/2094 dead transitions. [2025-04-14 01:20:57,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 2094 transitions, 45898 flow [2025-04-14 01:20:57,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 01:20:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 01:20:57,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-04-14 01:20:57,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2025-04-14 01:20:57,229 INFO L175 Difference]: Start difference. First operand has 462 places, 1641 transitions, 33582 flow. Second operand 9 states and 133 transitions. [2025-04-14 01:20:57,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 470 places, 2094 transitions, 45898 flow [2025-04-14 01:20:59,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 2094 transitions, 45837 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-14 01:20:59,231 INFO L231 Difference]: Finished difference. Result has 472 places, 1735 transitions, 36477 flow [2025-04-14 01:20:59,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33545, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=36477, PETRI_PLACES=472, PETRI_TRANSITIONS=1735} [2025-04-14 01:20:59,233 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 441 predicate places. [2025-04-14 01:20:59,233 INFO L485 AbstractCegarLoop]: Abstraction has has 472 places, 1735 transitions, 36477 flow [2025-04-14 01:20:59,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:59,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:20:59,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:20:59,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-14 01:20:59,233 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:20:59,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:20:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1909814205, now seen corresponding path program 5 times [2025-04-14 01:20:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:20:59,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852277338] [2025-04-14 01:20:59,234 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:59,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:20:59,253 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:59,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:59,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:59,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:20:59,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852277338] [2025-04-14 01:20:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852277338] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:20:59,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331180242] [2025-04-14 01:20:59,309 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:20:59,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:20:59,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:20:59,311 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:59,312 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:59,356 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:20:59,371 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:20:59,371 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:20:59,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:20:59,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:20:59,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:20:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:59,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:20:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:20:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331180242] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:20:59,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:20:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-04-14 01:20:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33939715] [2025-04-14 01:20:59,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:20:59,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 01:20:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:20:59,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 01:20:59,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:20:59,457 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:20:59,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 1735 transitions, 36477 flow. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:20:59,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:20:59,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:20:59,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:02,259 INFO L116 PetriNetUnfolderBase]: 6245/9271 cut-off events. [2025-04-14 01:21:02,259 INFO L117 PetriNetUnfolderBase]: For 127496/127496 co-relation queries the response was YES. [2025-04-14 01:21:02,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92321 conditions, 9271 events. 6245/9271 cut-off events. For 127496/127496 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 53474 event pairs, 572 based on Foata normal form. 12/9201 useless extension candidates. Maximal degree in co-relation 92158. Up to 5498 conditions per place. [2025-04-14 01:21:02,391 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1868 selfloop transitions, 170 changer transitions 1/2039 dead transitions. [2025-04-14 01:21:02,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 2039 transitions, 45931 flow [2025-04-14 01:21:02,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 01:21:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 01:21:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2025-04-14 01:21:02,392 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-04-14 01:21:02,392 INFO L175 Difference]: Start difference. First operand has 472 places, 1735 transitions, 36477 flow. Second operand 8 states and 108 transitions. [2025-04-14 01:21:02,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 2039 transitions, 45931 flow [2025-04-14 01:21:04,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 2039 transitions, 45586 flow, removed 60 selfloop flow, removed 2 redundant places. [2025-04-14 01:21:04,770 INFO L231 Difference]: Finished difference. Result has 483 places, 1760 transitions, 37388 flow [2025-04-14 01:21:04,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36152, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=37388, PETRI_PLACES=483, PETRI_TRANSITIONS=1760} [2025-04-14 01:21:04,772 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 452 predicate places. [2025-04-14 01:21:04,772 INFO L485 AbstractCegarLoop]: Abstraction has has 483 places, 1760 transitions, 37388 flow [2025-04-14 01:21:04,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:04,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:04,772 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:04,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 01:21:04,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:04,973 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:04,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1537059307, now seen corresponding path program 6 times [2025-04-14 01:21:04,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:04,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711778228] [2025-04-14 01:21:04,973 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:21:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:04,978 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:04,980 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-14 01:21:04,980 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 01:21:04,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:05,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:21:05,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:05,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711778228] [2025-04-14 01:21:05,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711778228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:05,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:21:05,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:21:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588459364] [2025-04-14 01:21:05,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:05,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 01:21:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 01:21:05,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:21:05,006 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:05,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 1760 transitions, 37388 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:05,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:05,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:05,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:08,215 INFO L116 PetriNetUnfolderBase]: 6342/9414 cut-off events. [2025-04-14 01:21:08,215 INFO L117 PetriNetUnfolderBase]: For 138714/138714 co-relation queries the response was YES. [2025-04-14 01:21:08,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94807 conditions, 9414 events. 6342/9414 cut-off events. For 138714/138714 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 54482 event pairs, 1275 based on Foata normal form. 26/9350 useless extension candidates. Maximal degree in co-relation 94638. Up to 7060 conditions per place. [2025-04-14 01:21:08,335 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1573 selfloop transitions, 319 changer transitions 0/1892 dead transitions. [2025-04-14 01:21:08,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1892 transitions, 43682 flow [2025-04-14 01:21:08,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:21:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:21:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-14 01:21:08,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-04-14 01:21:08,336 INFO L175 Difference]: Start difference. First operand has 483 places, 1760 transitions, 37388 flow. Second operand 6 states and 86 transitions. [2025-04-14 01:21:08,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 1892 transitions, 43682 flow [2025-04-14 01:21:10,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1892 transitions, 43552 flow, removed 34 selfloop flow, removed 1 redundant places. [2025-04-14 01:21:10,975 INFO L231 Difference]: Finished difference. Result has 490 places, 1786 transitions, 38949 flow [2025-04-14 01:21:10,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37262, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1760, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=293, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=38949, PETRI_PLACES=490, PETRI_TRANSITIONS=1786} [2025-04-14 01:21:10,976 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2025-04-14 01:21:10,976 INFO L485 AbstractCegarLoop]: Abstraction has has 490 places, 1786 transitions, 38949 flow [2025-04-14 01:21:10,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:10,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:10,977 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:10,977 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-14 01:21:10,977 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:10,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 228796209, now seen corresponding path program 7 times [2025-04-14 01:21:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:10,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011156561] [2025-04-14 01:21:10,977 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:10,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:10,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:10,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:10,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:10,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:11,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:11,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011156561] [2025-04-14 01:21:11,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011156561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:11,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944293432] [2025-04-14 01:21:11,021 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:21:11,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:11,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:11,023 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:11,024 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:11,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:21:11,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:11,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:11,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:11,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:11,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:11,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:11,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:11,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944293432] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:11,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-14 01:21:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127925192] [2025-04-14 01:21:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:11,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:11,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:11,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-14 01:21:11,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:11,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1786 transitions, 38949 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:11,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:11,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:11,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:14,150 INFO L116 PetriNetUnfolderBase]: 6289/9319 cut-off events. [2025-04-14 01:21:14,150 INFO L117 PetriNetUnfolderBase]: For 141285/141285 co-relation queries the response was YES. [2025-04-14 01:21:14,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95477 conditions, 9319 events. 6289/9319 cut-off events. For 141285/141285 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 53339 event pairs, 1156 based on Foata normal form. 78/9307 useless extension candidates. Maximal degree in co-relation 95305. Up to 6550 conditions per place. [2025-04-14 01:21:14,250 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1718 selfloop transitions, 106 changer transitions 0/1824 dead transitions. [2025-04-14 01:21:14,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 1824 transitions, 43303 flow [2025-04-14 01:21:14,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:14,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-14 01:21:14,251 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-14 01:21:14,251 INFO L175 Difference]: Start difference. First operand has 490 places, 1786 transitions, 38949 flow. Second operand 7 states and 74 transitions. [2025-04-14 01:21:14,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 1824 transitions, 43303 flow [2025-04-14 01:21:16,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 1824 transitions, 42417 flow, removed 233 selfloop flow, removed 5 redundant places. [2025-04-14 01:21:16,792 INFO L231 Difference]: Finished difference. Result has 489 places, 1758 transitions, 37956 flow [2025-04-14 01:21:16,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37301, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=37956, PETRI_PLACES=489, PETRI_TRANSITIONS=1758} [2025-04-14 01:21:16,794 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 458 predicate places. [2025-04-14 01:21:16,794 INFO L485 AbstractCegarLoop]: Abstraction has has 489 places, 1758 transitions, 37956 flow [2025-04-14 01:21:16,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:16,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:16,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:21:16,801 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:16,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-14 01:21:16,995 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:16,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1241131583, now seen corresponding path program 8 times [2025-04-14 01:21:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:16,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061196752] [2025-04-14 01:21:16,995 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:17,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:17,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:17,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:17,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:17,044 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:17,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:17,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061196752] [2025-04-14 01:21:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061196752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:17,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788814725] [2025-04-14 01:21:17,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:17,047 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:17,047 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:17,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:21:17,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:21:17,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:17,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:21:17,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:21:17,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:21:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788814725] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:21:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-14 01:21:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267284039] [2025-04-14 01:21:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:17,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:21:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:17,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:21:17,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:21:17,225 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:17,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 1758 transitions, 37956 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:17,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:17,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:17,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:20,553 INFO L116 PetriNetUnfolderBase]: 6464/9475 cut-off events. [2025-04-14 01:21:20,553 INFO L117 PetriNetUnfolderBase]: For 134015/134015 co-relation queries the response was YES. [2025-04-14 01:21:20,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91181 conditions, 9475 events. 6464/9475 cut-off events. For 134015/134015 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 53232 event pairs, 715 based on Foata normal form. 134/9298 useless extension candidates. Maximal degree in co-relation 91007. Up to 5221 conditions per place. [2025-04-14 01:21:20,663 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1495 selfloop transitions, 342 changer transitions 0/1837 dead transitions. [2025-04-14 01:21:20,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1837 transitions, 42895 flow [2025-04-14 01:21:20,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:21:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:21:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-04-14 01:21:20,664 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-14 01:21:20,664 INFO L175 Difference]: Start difference. First operand has 489 places, 1758 transitions, 37956 flow. Second operand 7 states and 79 transitions. [2025-04-14 01:21:20,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1837 transitions, 42895 flow [2025-04-14 01:21:22,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 1837 transitions, 42564 flow, removed 106 selfloop flow, removed 9 redundant places. [2025-04-14 01:21:22,946 INFO L231 Difference]: Finished difference. Result has 478 places, 1711 transitions, 38096 flow [2025-04-14 01:21:22,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36350, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38096, PETRI_PLACES=478, PETRI_TRANSITIONS=1711} [2025-04-14 01:21:22,948 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 447 predicate places. [2025-04-14 01:21:22,948 INFO L485 AbstractCegarLoop]: Abstraction has has 478 places, 1711 transitions, 38096 flow [2025-04-14 01:21:22,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:22,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:22,948 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] [2025-04-14 01:21:22,972 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:23,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:23,149 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:21:23,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1015429984, now seen corresponding path program 1 times [2025-04-14 01:21:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:23,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293914578] [2025-04-14 01:21:23,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:23,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:23,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:23,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:23,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:24,094 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:21:24,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:24,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293914578] [2025-04-14 01:21:24,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293914578] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:24,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150699670] [2025-04-14 01:21:24,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:21:24,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:24,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:24,096 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:24,097 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:24,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:21:24,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:24,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:21:24,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:24,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-14 01:21:24,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:24,699 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:24,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 80 [2025-04-14 01:21:24,828 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:24,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:21:24,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150699670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:21:24,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:21:24,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-14 01:21:24,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200640855] [2025-04-14 01:21:24,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:21:24,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:21:24,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:24,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:21:24,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-04-14 01:21:24,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 1711 transitions, 38096 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:24,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:28,431 INFO L116 PetriNetUnfolderBase]: 7343/10796 cut-off events. [2025-04-14 01:21:28,431 INFO L117 PetriNetUnfolderBase]: For 159975/159975 co-relation queries the response was YES. [2025-04-14 01:21:28,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103809 conditions, 10796 events. 7343/10796 cut-off events. For 159975/159975 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 62418 event pairs, 365 based on Foata normal form. 1/10625 useless extension candidates. Maximal degree in co-relation 103637. Up to 9294 conditions per place. [2025-04-14 01:21:28,564 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1605 selfloop transitions, 307 changer transitions 2/1914 dead transitions. [2025-04-14 01:21:28,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1914 transitions, 45079 flow [2025-04-14 01:21:28,565 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 01:21:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 01:21:28,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2025-04-14 01:21:28,566 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2025-04-14 01:21:28,566 INFO L175 Difference]: Start difference. First operand has 478 places, 1711 transitions, 38096 flow. Second operand 12 states and 170 transitions. [2025-04-14 01:21:28,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1914 transitions, 45079 flow [2025-04-14 01:21:31,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 1914 transitions, 45010 flow, removed 29 selfloop flow, removed 4 redundant places. [2025-04-14 01:21:31,091 INFO L231 Difference]: Finished difference. Result has 490 places, 1773 transitions, 39965 flow [2025-04-14 01:21:31,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38051, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=39965, PETRI_PLACES=490, PETRI_TRANSITIONS=1773} [2025-04-14 01:21:31,093 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2025-04-14 01:21:31,093 INFO L485 AbstractCegarLoop]: Abstraction has has 490 places, 1773 transitions, 39965 flow [2025-04-14 01:21:31,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:21:31,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:31,093 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] [2025-04-14 01:21:31,100 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:31,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:31,294 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:21:31,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1433402204, now seen corresponding path program 2 times [2025-04-14 01:21:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:31,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550554218] [2025-04-14 01:21:31,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:31,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:31,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:31,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:31,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:31,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:32,022 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:32,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:32,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550554218] [2025-04-14 01:21:32,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550554218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:32,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681842361] [2025-04-14 01:21:32,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:21:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:32,025 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:32,025 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:32,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:32,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:32,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:21:32,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:32,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:21:32,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:32,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:32,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:32,659 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:32,659 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 90 [2025-04-14 01:21:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:21:33,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:34,211 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:34,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 162 [2025-04-14 01:21:34,720 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:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681842361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:34,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-14 01:21:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980290026] [2025-04-14 01:21:34,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:34,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:21:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:34,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:21:34,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:21:34,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:34,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1773 transitions, 39965 flow. Second operand has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call 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:34,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:34,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:34,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:42,448 INFO L116 PetriNetUnfolderBase]: 8628/12767 cut-off events. [2025-04-14 01:21:42,448 INFO L117 PetriNetUnfolderBase]: For 198898/198898 co-relation queries the response was YES. [2025-04-14 01:21:42,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122868 conditions, 12767 events. 8628/12767 cut-off events. For 198898/198898 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 76525 event pairs, 363 based on Foata normal form. 3/12560 useless extension candidates. Maximal degree in co-relation 122693. Up to 9338 conditions per place. [2025-04-14 01:21:42,612 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1476 selfloop transitions, 791 changer transitions 15/2282 dead transitions. [2025-04-14 01:21:42,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 2282 transitions, 52434 flow [2025-04-14 01:21:42,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:21:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:21:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 421 transitions. [2025-04-14 01:21:42,614 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3132440476190476 [2025-04-14 01:21:42,614 INFO L175 Difference]: Start difference. First operand has 490 places, 1773 transitions, 39965 flow. Second operand 42 states and 421 transitions. [2025-04-14 01:21:42,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 2282 transitions, 52434 flow [2025-04-14 01:21:45,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 2282 transitions, 52002 flow, removed 68 selfloop flow, removed 4 redundant places. [2025-04-14 01:21:45,814 INFO L231 Difference]: Finished difference. Result has 533 places, 2012 transitions, 46301 flow [2025-04-14 01:21:45,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=39573, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=595, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1088, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=46301, PETRI_PLACES=533, PETRI_TRANSITIONS=2012} [2025-04-14 01:21:45,816 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 502 predicate places. [2025-04-14 01:21:45,816 INFO L485 AbstractCegarLoop]: Abstraction has has 533 places, 2012 transitions, 46301 flow [2025-04-14 01:21:45,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call 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,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:21:45,816 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] [2025-04-14 01:21:45,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-14 01:21:46,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:46,017 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:21:46,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:21:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash -296239776, now seen corresponding path program 3 times [2025-04-14 01:21:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:21:46,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680666484] [2025-04-14 01:21:46,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:21:46,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:46,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:46,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:46,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:46,850 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:21:46,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:21:46,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680666484] [2025-04-14 01:21:46,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680666484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:21:46,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677746095] [2025-04-14 01:21:46,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:21:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:21:46,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:21:46,852 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:21:46,853 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:21:46,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:21:46,911 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:21:46,911 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:21:46,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:21:46,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:21:46,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:21:47,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:47,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:21:47,545 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:47,546 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 92 [2025-04-14 01:21:47,907 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:47,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:21:49,346 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:21:49,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 162 [2025-04-14 01:21:49,817 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:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677746095] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:21:49,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:21:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 37 [2025-04-14 01:21:49,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647829337] [2025-04-14 01:21:49,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:21:49,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 01:21:49,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:21:49,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 01:21:49,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2025-04-14 01:21:49,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:21:49,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 2012 transitions, 46301 flow. Second operand has 39 states, 39 states have (on average 4.769230769230769) internal successors, (186), 39 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call 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:49,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:21:49,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:21:49,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:21:59,443 INFO L116 PetriNetUnfolderBase]: 9274/13706 cut-off events. [2025-04-14 01:21:59,443 INFO L117 PetriNetUnfolderBase]: For 232427/232427 co-relation queries the response was YES. [2025-04-14 01:21:59,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136562 conditions, 13706 events. 9274/13706 cut-off events. For 232427/232427 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 82827 event pairs, 352 based on Foata normal form. 3/13400 useless extension candidates. Maximal degree in co-relation 136380. Up to 9686 conditions per place. [2025-04-14 01:21:59,630 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1505 selfloop transitions, 880 changer transitions 13/2398 dead transitions. [2025-04-14 01:21:59,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 2398 transitions, 56487 flow [2025-04-14 01:21:59,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-14 01:21:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-04-14 01:21:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 481 transitions. [2025-04-14 01:21:59,631 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3067602040816326 [2025-04-14 01:21:59,631 INFO L175 Difference]: Start difference. First operand has 533 places, 2012 transitions, 46301 flow. Second operand 49 states and 481 transitions. [2025-04-14 01:21:59,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 2398 transitions, 56487 flow [2025-04-14 01:22:03,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 2398 transitions, 55608 flow, removed 278 selfloop flow, removed 8 redundant places. [2025-04-14 01:22:03,507 INFO L231 Difference]: Finished difference. Result has 579 places, 2126 transitions, 49512 flow [2025-04-14 01:22:03,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=45478, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=790, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=49512, PETRI_PLACES=579, PETRI_TRANSITIONS=2126} [2025-04-14 01:22:03,509 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 548 predicate places. [2025-04-14 01:22:03,509 INFO L485 AbstractCegarLoop]: Abstraction has has 579 places, 2126 transitions, 49512 flow [2025-04-14 01:22:03,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.769230769230769) internal successors, (186), 39 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call 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:03,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:03,509 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] [2025-04-14 01:22:03,516 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:03,710 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:03,710 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:03,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash -334495910, now seen corresponding path program 4 times [2025-04-14 01:22:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:03,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281203303] [2025-04-14 01:22:03,711 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:03,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:03,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:03,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:03,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:04,298 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:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:04,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281203303] [2025-04-14 01:22:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281203303] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:04,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890385790] [2025-04-14 01:22:04,299 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:22:04,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:04,301 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:04,301 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:04,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:04,362 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:04,362 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:22:04,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:04,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:22:04,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:04,904 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:04,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 96 [2025-04-14 01:22:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:05,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:06,642 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:06,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 350 treesize of output 164 [2025-04-14 01:22:07,076 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:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890385790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 32 [2025-04-14 01:22:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016102025] [2025-04-14 01:22:07,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:07,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:22:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:07,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:22:07,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:22:07,078 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:07,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 2126 transitions, 49512 flow. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call 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:07,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:07,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:14,566 INFO L116 PetriNetUnfolderBase]: 9538/14113 cut-off events. [2025-04-14 01:22:14,566 INFO L117 PetriNetUnfolderBase]: For 252718/252718 co-relation queries the response was YES. [2025-04-14 01:22:14,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145909 conditions, 14113 events. 9538/14113 cut-off events. For 252718/252718 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 85763 event pairs, 491 based on Foata normal form. 2/13800 useless extension candidates. Maximal degree in co-relation 145716. Up to 12832 conditions per place. [2025-04-14 01:22:14,806 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1911 selfloop transitions, 403 changer transitions 6/2320 dead transitions. [2025-04-14 01:22:14,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 2320 transitions, 56961 flow [2025-04-14 01:22:14,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 01:22:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-14 01:22:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 262 transitions. [2025-04-14 01:22:14,807 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3275 [2025-04-14 01:22:14,808 INFO L175 Difference]: Start difference. First operand has 579 places, 2126 transitions, 49512 flow. Second operand 25 states and 262 transitions. [2025-04-14 01:22:14,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 2320 transitions, 56961 flow [2025-04-14 01:22:18,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 2320 transitions, 55710 flow, removed 310 selfloop flow, removed 18 redundant places. [2025-04-14 01:22:18,923 INFO L231 Difference]: Finished difference. Result has 595 places, 2211 transitions, 51038 flow [2025-04-14 01:22:18,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=48278, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=51038, PETRI_PLACES=595, PETRI_TRANSITIONS=2211} [2025-04-14 01:22:18,925 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 564 predicate places. [2025-04-14 01:22:18,925 INFO L485 AbstractCegarLoop]: Abstraction has has 595 places, 2211 transitions, 51038 flow [2025-04-14 01:22:18,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call 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:18,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:18,925 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] [2025-04-14 01:22:18,932 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:19,126 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,SelfDestructingSolverStorable44 [2025-04-14 01:22:19,126 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:19,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:19,127 INFO L85 PathProgramCache]: Analyzing trace with hash 162828938, now seen corresponding path program 5 times [2025-04-14 01:22:19,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:19,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402788095] [2025-04-14 01:22:19,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:19,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:19,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:19,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:19,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:19,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:20,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:20,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402788095] [2025-04-14 01:22:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402788095] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:20,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88939168] [2025-04-14 01:22:20,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:22:20,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:20,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:20,168 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:20,168 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:20,217 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:20,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:20,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:22:20,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:20,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:22:20,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:21,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:21,086 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 80 [2025-04-14 01:22:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:22:21,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:22,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:22,530 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 164 [2025-04-14 01:22:23,050 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:23,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88939168] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:23,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:23,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 37 [2025-04-14 01:22:23,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556104008] [2025-04-14 01:22:23,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:23,051 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 01:22:23,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:23,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 01:22:23,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-04-14 01:22:23,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:23,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 2211 transitions, 51038 flow. Second operand has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:23,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:23,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:23,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:36,267 INFO L116 PetriNetUnfolderBase]: 10331/15405 cut-off events. [2025-04-14 01:22:36,267 INFO L117 PetriNetUnfolderBase]: For 276422/276422 co-relation queries the response was YES. [2025-04-14 01:22:36,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158914 conditions, 15405 events. 10331/15405 cut-off events. For 276422/276422 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 95964 event pairs, 546 based on Foata normal form. 2/15193 useless extension candidates. Maximal degree in co-relation 158713. Up to 12627 conditions per place. [2025-04-14 01:22:36,504 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2041 selfloop transitions, 614 changer transitions 6/2661 dead transitions. [2025-04-14 01:22:36,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 2661 transitions, 63190 flow [2025-04-14 01:22:36,504 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-14 01:22:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2025-04-14 01:22:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 627 transitions. [2025-04-14 01:22:36,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.296875 [2025-04-14 01:22:36,506 INFO L175 Difference]: Start difference. First operand has 595 places, 2211 transitions, 51038 flow. Second operand 66 states and 627 transitions. [2025-04-14 01:22:36,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 2661 transitions, 63190 flow [2025-04-14 01:22:40,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 2661 transitions, 62329 flow, removed 203 selfloop flow, removed 7 redundant places. [2025-04-14 01:22:40,777 INFO L231 Difference]: Finished difference. Result has 675 places, 2387 transitions, 56103 flow [2025-04-14 01:22:40,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50242, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=56103, PETRI_PLACES=675, PETRI_TRANSITIONS=2387} [2025-04-14 01:22:40,779 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 644 predicate places. [2025-04-14 01:22:40,779 INFO L485 AbstractCegarLoop]: Abstraction has has 675 places, 2387 transitions, 56103 flow [2025-04-14 01:22:40,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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:40,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:22:40,780 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] [2025-04-14 01:22:40,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-14 01:22:40,980 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,SelfDestructingSolverStorable45 [2025-04-14 01:22:40,980 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:40,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:22:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash -863225932, now seen corresponding path program 6 times [2025-04-14 01:22:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:22:40,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858812054] [2025-04-14 01:22:40,981 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:22:40,986 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:40,995 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:40,996 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:40,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:22:41,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:22:41,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858812054] [2025-04-14 01:22:41,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858812054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:22:41,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777909562] [2025-04-14 01:22:41,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:22:41,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:22:41,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:22:41,900 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:22:41,901 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:22:41,962 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:22:41,981 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:22:41,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:22:41,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:22:41,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:22:41,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:22:42,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:42,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:22:42,656 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:42,656 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 90 [2025-04-14 01:22:42,963 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:42,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:22:44,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:22:44,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 162 [2025-04-14 01:22:44,755 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:44,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777909562] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:22:44,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:22:44,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-14 01:22:44,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344958329] [2025-04-14 01:22:44,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:22:44,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:22:44,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:22:44,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:22:44,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:22:44,756 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:22:44,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 2387 transitions, 56103 flow. Second operand has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call 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:44,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:22:44,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:22:44,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:22:57,006 INFO L116 PetriNetUnfolderBase]: 10984/16500 cut-off events. [2025-04-14 01:22:57,006 INFO L117 PetriNetUnfolderBase]: For 322672/322672 co-relation queries the response was YES. [2025-04-14 01:22:57,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174319 conditions, 16500 events. 10984/16500 cut-off events. For 322672/322672 co-relation queries the response was YES. Maximal size of possible extension queue 962. Compared 105437 event pairs, 407 based on Foata normal form. 2/16272 useless extension candidates. Maximal degree in co-relation 174094. Up to 11726 conditions per place. [2025-04-14 01:22:57,456 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 1600 selfloop transitions, 1277 changer transitions 10/2887 dead transitions. [2025-04-14 01:22:57,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 734 places, 2887 transitions, 69799 flow [2025-04-14 01:22:57,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-14 01:22:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-14 01:22:57,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 589 transitions. [2025-04-14 01:22:57,458 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3067708333333333 [2025-04-14 01:22:57,458 INFO L175 Difference]: Start difference. First operand has 675 places, 2387 transitions, 56103 flow. Second operand 60 states and 589 transitions. [2025-04-14 01:22:57,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 734 places, 2887 transitions, 69799 flow [2025-04-14 01:23:03,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 2887 transitions, 68357 flow, removed 450 selfloop flow, removed 19 redundant places. [2025-04-14 01:23:03,847 INFO L231 Difference]: Finished difference. Result has 739 places, 2625 transitions, 64053 flow [2025-04-14 01:23:03,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=54825, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=64053, PETRI_PLACES=739, PETRI_TRANSITIONS=2625} [2025-04-14 01:23:03,848 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 708 predicate places. [2025-04-14 01:23:03,849 INFO L485 AbstractCegarLoop]: Abstraction has has 739 places, 2625 transitions, 64053 flow [2025-04-14 01:23:03,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:03,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:03,849 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] [2025-04-14 01:23:03,855 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:23:04,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:04,050 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:23:04,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash 828953350, now seen corresponding path program 7 times [2025-04-14 01:23:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:04,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542839493] [2025-04-14 01:23:04,051 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:04,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:23:04,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:04,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:04,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:23:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:04,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542839493] [2025-04-14 01:23:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542839493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:04,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303326455] [2025-04-14 01:23:04,898 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:23:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:04,900 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:23:04,900 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:23:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:23:04,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:04,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:23:04,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:04,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-14 01:23:04,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:05,021 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:23:05,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:05,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 98 [2025-04-14 01:23:06,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:23:06,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:08,935 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 187 treesize of output 163 [2025-04-14 01:23:08,939 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:08,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 209 [2025-04-14 01:23:09,050 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 338 treesize of output 300 [2025-04-14 01:23:09,058 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:09,058 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 349 [2025-04-14 01:23:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:23:09,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303326455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:09,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:09,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 39 [2025-04-14 01:23:09,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833542847] [2025-04-14 01:23:09,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:09,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 01:23:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:09,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 01:23:09,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 01:23:09,385 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:09,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 739 places, 2625 transitions, 64053 flow. Second operand has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:09,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:09,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:09,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:26,571 INFO L116 PetriNetUnfolderBase]: 11698/17559 cut-off events. [2025-04-14 01:23:26,572 INFO L117 PetriNetUnfolderBase]: For 388526/388526 co-relation queries the response was YES. [2025-04-14 01:23:26,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190431 conditions, 17559 events. 11698/17559 cut-off events. For 388526/388526 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 112505 event pairs, 439 based on Foata normal form. 2/17326 useless extension candidates. Maximal degree in co-relation 190183. Up to 13889 conditions per place. [2025-04-14 01:23:26,886 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2212 selfloop transitions, 751 changer transitions 7/2970 dead transitions. [2025-04-14 01:23:26,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 797 places, 2970 transitions, 74384 flow [2025-04-14 01:23:26,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-14 01:23:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-14 01:23:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 600 transitions. [2025-04-14 01:23:26,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3073770491803279 [2025-04-14 01:23:26,888 INFO L175 Difference]: Start difference. First operand has 739 places, 2625 transitions, 64053 flow. Second operand 61 states and 600 transitions. [2025-04-14 01:23:26,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 797 places, 2970 transitions, 74384 flow [2025-04-14 01:23:35,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 776 places, 2970 transitions, 72565 flow, removed 564 selfloop flow, removed 21 redundant places. [2025-04-14 01:23:35,927 INFO L231 Difference]: Finished difference. Result has 795 places, 2726 transitions, 65914 flow [2025-04-14 01:23:35,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62316, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=659, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=65914, PETRI_PLACES=795, PETRI_TRANSITIONS=2726} [2025-04-14 01:23:35,929 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 764 predicate places. [2025-04-14 01:23:35,929 INFO L485 AbstractCegarLoop]: Abstraction has has 795 places, 2726 transitions, 65914 flow [2025-04-14 01:23:35,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.7560975609756095) internal successors, (195), 41 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:35,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:23:35,930 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] [2025-04-14 01:23:35,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-14 01:23:36,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:36,130 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:23:36,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:23:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1876617514, now seen corresponding path program 8 times [2025-04-14 01:23:36,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:23:36,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687804188] [2025-04-14 01:23:36,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:36,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:23:36,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:36,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:36,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:36,841 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:23:36,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:23:36,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687804188] [2025-04-14 01:23:36,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687804188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:23:36,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479083447] [2025-04-14 01:23:36,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:23:36,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:23:36,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:23:36,843 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:23:36,844 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:23:36,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:23:36,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:23:36,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:23:36,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:23:36,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-14 01:23:36,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:23:37,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:23:37,514 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:37,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 88 [2025-04-14 01:23:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:23:37,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:23:39,192 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:23:39,192 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 314 treesize of output 170 [2025-04-14 01:23:39,706 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:23:39,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479083447] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:23:39,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:23:39,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-14 01:23:39,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069677993] [2025-04-14 01:23:39,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:23:39,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:23:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:23:39,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:23:39,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:23:39,707 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:23:39,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 795 places, 2726 transitions, 65914 flow. Second operand has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:23:39,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:23:39,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:23:39,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:23:52,083 INFO L116 PetriNetUnfolderBase]: 11717/17605 cut-off events. [2025-04-14 01:23:52,083 INFO L117 PetriNetUnfolderBase]: For 425404/425404 co-relation queries the response was YES. [2025-04-14 01:23:52,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195793 conditions, 17605 events. 11717/17605 cut-off events. For 425404/425404 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 113109 event pairs, 612 based on Foata normal form. 2/17363 useless extension candidates. Maximal degree in co-relation 195535. Up to 13241 conditions per place. [2025-04-14 01:23:52,411 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1958 selfloop transitions, 985 changer transitions 7/2950 dead transitions. [2025-04-14 01:23:52,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 2950 transitions, 74767 flow [2025-04-14 01:23:52,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:23:52,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:23:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 392 transitions. [2025-04-14 01:23:52,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3141025641025641 [2025-04-14 01:23:52,412 INFO L175 Difference]: Start difference. First operand has 795 places, 2726 transitions, 65914 flow. Second operand 39 states and 392 transitions. [2025-04-14 01:23:52,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 833 places, 2950 transitions, 74767 flow [2025-04-14 01:24:01,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 808 places, 2950 transitions, 72968 flow, removed 455 selfloop flow, removed 25 redundant places. [2025-04-14 01:24:01,611 INFO L231 Difference]: Finished difference. Result has 811 places, 2733 transitions, 66173 flow [2025-04-14 01:24:01,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64115, PETRI_DIFFERENCE_MINUEND_PLACES=770, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=978, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=66173, PETRI_PLACES=811, PETRI_TRANSITIONS=2733} [2025-04-14 01:24:01,613 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 780 predicate places. [2025-04-14 01:24:01,613 INFO L485 AbstractCegarLoop]: Abstraction has has 811 places, 2733 transitions, 66173 flow [2025-04-14 01:24:01,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call 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:01,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:01,614 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] [2025-04-14 01:24:01,621 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:24:01,814 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,SelfDestructingSolverStorable48 [2025-04-14 01:24:01,814 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:24:01,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:01,815 INFO L85 PathProgramCache]: Analyzing trace with hash 900798178, now seen corresponding path program 9 times [2025-04-14 01:24:01,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:01,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509950859] [2025-04-14 01:24:01,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:01,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:01,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:01,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:01,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:01,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:02,575 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:24:02,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:02,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509950859] [2025-04-14 01:24:02,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509950859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:02,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980319586] [2025-04-14 01:24:02,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:24:02,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:02,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:02,577 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:24:02,578 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:24:02,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:02,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:02,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:24:02,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:02,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:24:02,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:03,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:03,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:03,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:03,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 90 [2025-04-14 01:24:03,513 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:24:03,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:04,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:04,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 162 [2025-04-14 01:24:05,279 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:24:05,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980319586] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:05,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:05,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:24:05,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112543842] [2025-04-14 01:24:05,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:05,284 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:24:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:05,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:24:05,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:24:05,285 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:05,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 2733 transitions, 66173 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call 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:05,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:05,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:18,550 INFO L116 PetriNetUnfolderBase]: 12260/18423 cut-off events. [2025-04-14 01:24:18,550 INFO L117 PetriNetUnfolderBase]: For 454704/454704 co-relation queries the response was YES. [2025-04-14 01:24:18,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204505 conditions, 18423 events. 12260/18423 cut-off events. For 454704/454704 co-relation queries the response was YES. Maximal size of possible extension queue 1048. Compared 119081 event pairs, 589 based on Foata normal form. 2/18161 useless extension candidates. Maximal degree in co-relation 204259. Up to 13573 conditions per place. [2025-04-14 01:24:18,880 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2023 selfloop transitions, 1119 changer transitions 11/3153 dead transitions. [2025-04-14 01:24:18,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 854 places, 3153 transitions, 79813 flow [2025-04-14 01:24:18,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 01:24:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-14 01:24:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 474 transitions. [2025-04-14 01:24:18,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2025-04-14 01:24:18,882 INFO L175 Difference]: Start difference. First operand has 811 places, 2733 transitions, 66173 flow. Second operand 45 states and 474 transitions. [2025-04-14 01:24:18,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 854 places, 3153 transitions, 79813 flow [2025-04-14 01:24:27,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 823 places, 3153 transitions, 78261 flow, removed 75 selfloop flow, removed 31 redundant places. [2025-04-14 01:24:27,855 INFO L231 Difference]: Finished difference. Result has 831 places, 2891 transitions, 71697 flow [2025-04-14 01:24:27,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=64784, PETRI_DIFFERENCE_MINUEND_PLACES=779, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=976, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=71697, PETRI_PLACES=831, PETRI_TRANSITIONS=2891} [2025-04-14 01:24:27,857 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 800 predicate places. [2025-04-14 01:24:27,857 INFO L485 AbstractCegarLoop]: Abstraction has has 831 places, 2891 transitions, 71697 flow [2025-04-14 01:24:27,857 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call 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:27,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:27,857 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] [2025-04-14 01:24:27,864 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:24:28,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-14 01:24:28,061 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:24:28,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:28,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1366300292, now seen corresponding path program 10 times [2025-04-14 01:24:28,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:28,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054154179] [2025-04-14 01:24:28,061 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:24:28,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:28,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:28,071 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:28,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:24:28,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:28,608 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:24:28,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:28,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054154179] [2025-04-14 01:24:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054154179] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:28,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365447104] [2025-04-14 01:24:28,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:24:28,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:28,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:28,611 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:28,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-14 01:24:28,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:28,673 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:28,674 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:24:28,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:28,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:24:28,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:29,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:29,162 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:29,162 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 154 treesize of output 88 [2025-04-14 01:24:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:24:29,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:30,394 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:30,395 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 527 treesize of output 263 [2025-04-14 01:24:31,951 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:24:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365447104] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:24:31,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:24:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-14 01:24:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372302025] [2025-04-14 01:24:31,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:24:31,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 01:24:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:24:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 01:24:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=935, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 01:24:31,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:24:31,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 2891 transitions, 71697 flow. Second operand has 33 states, 33 states have (on average 5.121212121212121) internal successors, (169), 33 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call 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:31,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:24:31,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:24:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:24:45,229 INFO L116 PetriNetUnfolderBase]: 12491/18768 cut-off events. [2025-04-14 01:24:45,229 INFO L117 PetriNetUnfolderBase]: For 473628/473628 co-relation queries the response was YES. [2025-04-14 01:24:45,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214799 conditions, 18768 events. 12491/18768 cut-off events. For 473628/473628 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 121462 event pairs, 752 based on Foata normal form. 1/18505 useless extension candidates. Maximal degree in co-relation 214533. Up to 16342 conditions per place. [2025-04-14 01:24:45,541 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2476 selfloop transitions, 648 changer transitions 4/3128 dead transitions. [2025-04-14 01:24:45,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 867 places, 3128 transitions, 81595 flow [2025-04-14 01:24:45,541 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 01:24:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-14 01:24:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 401 transitions. [2025-04-14 01:24:45,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3213141025641026 [2025-04-14 01:24:45,542 INFO L175 Difference]: Start difference. First operand has 831 places, 2891 transitions, 71697 flow. Second operand 39 states and 401 transitions. [2025-04-14 01:24:45,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 867 places, 3128 transitions, 81595 flow [2025-04-14 01:24:56,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 856 places, 3128 transitions, 79706 flow, removed 696 selfloop flow, removed 11 redundant places. [2025-04-14 01:24:56,182 INFO L231 Difference]: Finished difference. Result has 863 places, 2968 transitions, 72995 flow [2025-04-14 01:24:56,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=69904, PETRI_DIFFERENCE_MINUEND_PLACES=818, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=580, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=72995, PETRI_PLACES=863, PETRI_TRANSITIONS=2968} [2025-04-14 01:24:56,183 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 832 predicate places. [2025-04-14 01:24:56,184 INFO L485 AbstractCegarLoop]: Abstraction has has 863 places, 2968 transitions, 72995 flow [2025-04-14 01:24:56,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.121212121212121) internal successors, (169), 33 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call 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,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:24:56,184 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] [2025-04-14 01:24:56,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-14 01:24:56,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-14 01:24:56,384 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:24:56,385 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:24:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1721633624, now seen corresponding path program 11 times [2025-04-14 01:24:56,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:24:56,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227382412] [2025-04-14 01:24:56,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:24:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:24:56,390 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:56,395 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:56,395 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:56,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:24:57,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:24:57,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227382412] [2025-04-14 01:24:57,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227382412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:24:57,223 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431863202] [2025-04-14 01:24:57,223 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:24:57,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:24:57,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:24:57,224 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:24:57,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-14 01:24:57,272 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:24:57,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:24:57,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:24:57,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:24:57,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:24:57,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:24:57,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:24:57,870 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:57,870 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 90 [2025-04-14 01:24:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:24:58,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:24:59,539 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:24:59,539 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 519 treesize of output 263 [2025-04-14 01:25:00,960 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:25:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431863202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:00,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-14 01:25:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248080912] [2025-04-14 01:25:00,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:00,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-14 01:25:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:00,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-14 01:25:00,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-04-14 01:25:00,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:25:00,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 863 places, 2968 transitions, 72995 flow. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call 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:00,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:00,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:25:00,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:18,610 INFO L116 PetriNetUnfolderBase]: 13326/19970 cut-off events. [2025-04-14 01:25:18,611 INFO L117 PetriNetUnfolderBase]: For 510370/510370 co-relation queries the response was YES. [2025-04-14 01:25:19,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230798 conditions, 19970 events. 13326/19970 cut-off events. For 510370/510370 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 129625 event pairs, 681 based on Foata normal form. 3/19680 useless extension candidates. Maximal degree in co-relation 230523. Up to 15155 conditions per place. [2025-04-14 01:25:19,128 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2223 selfloop transitions, 1246 changer transitions 5/3474 dead transitions. [2025-04-14 01:25:19,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 913 places, 3474 transitions, 90722 flow [2025-04-14 01:25:19,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 01:25:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2025-04-14 01:25:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 545 transitions. [2025-04-14 01:25:19,130 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33394607843137253 [2025-04-14 01:25:19,130 INFO L175 Difference]: Start difference. First operand has 863 places, 2968 transitions, 72995 flow. Second operand 51 states and 545 transitions. [2025-04-14 01:25:19,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 913 places, 3474 transitions, 90722 flow [2025-04-14 01:25:31,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 899 places, 3474 transitions, 88658 flow, removed 584 selfloop flow, removed 14 redundant places. [2025-04-14 01:25:31,306 INFO L231 Difference]: Finished difference. Result has 912 places, 3227 transitions, 81779 flow [2025-04-14 01:25:31,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=71051, PETRI_DIFFERENCE_MINUEND_PLACES=849, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1007, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1806, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=81779, PETRI_PLACES=912, PETRI_TRANSITIONS=3227} [2025-04-14 01:25:31,307 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 881 predicate places. [2025-04-14 01:25:31,307 INFO L485 AbstractCegarLoop]: Abstraction has has 912 places, 3227 transitions, 81779 flow [2025-04-14 01:25:31,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call 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:31,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:25:31,308 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] [2025-04-14 01:25:31,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-14 01:25:31,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:31,508 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:25:31,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:25:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1546514976, now seen corresponding path program 12 times [2025-04-14 01:25:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:25:31,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235798218] [2025-04-14 01:25:31,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:25:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:25:31,514 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:31,520 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:31,520 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:25:31,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:32,246 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:25:32,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:25:32,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235798218] [2025-04-14 01:25:32,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235798218] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:25:32,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600628277] [2025-04-14 01:25:32,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:25:32,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:25:32,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:25:32,248 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:25:32,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-14 01:25:32,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:25:32,314 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:25:32,314 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:25:32,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:25:32,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:25:32,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:25:32,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:25:32,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:32,811 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 98 [2025-04-14 01:25:33,434 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:25:33,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:25:34,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:25:34,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 302 treesize of output 162 [2025-04-14 01:25:34,991 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:25:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600628277] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:25:34,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:25:34,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:25:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930948346] [2025-04-14 01:25:34,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:25:34,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:25:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:25:34,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:25:34,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:25:34,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:25:34,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 912 places, 3227 transitions, 81779 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call 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:34,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:25:34,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:25:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:25:55,194 INFO L116 PetriNetUnfolderBase]: 14520/21702 cut-off events. [2025-04-14 01:25:55,194 INFO L117 PetriNetUnfolderBase]: For 585638/585638 co-relation queries the response was YES. [2025-04-14 01:25:55,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255975 conditions, 21702 events. 14520/21702 cut-off events. For 585638/585638 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 142039 event pairs, 553 based on Foata normal form. 3/21533 useless extension candidates. Maximal degree in co-relation 255686. Up to 15702 conditions per place. [2025-04-14 01:25:55,621 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2084 selfloop transitions, 1861 changer transitions 15/3960 dead transitions. [2025-04-14 01:25:55,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 980 places, 3960 transitions, 103994 flow [2025-04-14 01:25:55,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-14 01:25:55,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2025-04-14 01:25:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 701 transitions. [2025-04-14 01:25:55,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.317481884057971 [2025-04-14 01:25:55,622 INFO L175 Difference]: Start difference. First operand has 912 places, 3227 transitions, 81779 flow. Second operand 69 states and 701 transitions. [2025-04-14 01:25:55,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 980 places, 3960 transitions, 103994 flow [2025-04-14 01:26:09,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 963 places, 3960 transitions, 102448 flow, removed 427 selfloop flow, removed 17 redundant places. [2025-04-14 01:26:09,413 INFO L231 Difference]: Finished difference. Result has 999 places, 3694 transitions, 99009 flow [2025-04-14 01:26:09,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80292, PETRI_DIFFERENCE_MINUEND_PLACES=895, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1427, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=99009, PETRI_PLACES=999, PETRI_TRANSITIONS=3694} [2025-04-14 01:26:09,415 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 968 predicate places. [2025-04-14 01:26:09,415 INFO L485 AbstractCegarLoop]: Abstraction has has 999 places, 3694 transitions, 99009 flow [2025-04-14 01:26:09,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:09,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:26:09,415 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] [2025-04-14 01:26:09,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-14 01:26:09,617 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:09,618 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:26:09,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:26:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1422585590, now seen corresponding path program 13 times [2025-04-14 01:26:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:26:09,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336800312] [2025-04-14 01:26:09,619 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:26:09,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:26:09,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:26:09,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:09,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:09,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:26:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:26:10,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336800312] [2025-04-14 01:26:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336800312] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:26:10,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398826616] [2025-04-14 01:26:10,750 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:26:10,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:26:10,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:26:10,751 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:26:10,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-14 01:26:10,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:26:10,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:26:10,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:26:10,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:26:10,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:26:10,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:26:10,869 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 19 treesize of output 1 [2025-04-14 01:26:11,359 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:11,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 96 [2025-04-14 01:26:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:26:11,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:26:14,452 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 187 treesize of output 163 [2025-04-14 01:26:14,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:14,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 209 [2025-04-14 01:26:14,730 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 342 treesize of output 304 [2025-04-14 01:26:14,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:26:14,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 413 treesize of output 349 [2025-04-14 01:26:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:26:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398826616] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:26:15,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:26:15,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2025-04-14 01:26:15,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395726884] [2025-04-14 01:26:15,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:26:15,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 01:26:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:26:15,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 01:26:15,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1370, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 01:26:15,028 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:26:15,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 3694 transitions, 99009 flow. Second operand has 40 states, 40 states have (on average 4.8) internal successors, (192), 40 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:26:15,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:26:15,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:26:15,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:26:39,529 INFO L116 PetriNetUnfolderBase]: 15169/22647 cut-off events. [2025-04-14 01:26:39,530 INFO L117 PetriNetUnfolderBase]: For 757739/757739 co-relation queries the response was YES. [2025-04-14 01:26:40,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284429 conditions, 22647 events. 15169/22647 cut-off events. For 757739/757739 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 148275 event pairs, 603 based on Foata normal form. 3/22472 useless extension candidates. Maximal degree in co-relation 284105. Up to 19115 conditions per place. [2025-04-14 01:26:40,248 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3069 selfloop transitions, 1062 changer transitions 9/4140 dead transitions. [2025-04-14 01:26:40,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1059 places, 4140 transitions, 116724 flow [2025-04-14 01:26:40,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 01:26:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-04-14 01:26:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 626 transitions. [2025-04-14 01:26:40,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.310515873015873 [2025-04-14 01:26:40,250 INFO L175 Difference]: Start difference. First operand has 999 places, 3694 transitions, 99009 flow. Second operand 63 states and 626 transitions. [2025-04-14 01:26:40,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1059 places, 4140 transitions, 116724 flow [2025-04-14 01:27:01,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1047 places, 4140 transitions, 113108 flow, removed 1543 selfloop flow, removed 12 redundant places. [2025-04-14 01:27:01,243 INFO L231 Difference]: Finished difference. Result has 1068 places, 3914 transitions, 105013 flow [2025-04-14 01:27:01,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96283, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=858, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=105013, PETRI_PLACES=1068, PETRI_TRANSITIONS=3914} [2025-04-14 01:27:01,245 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1037 predicate places. [2025-04-14 01:27:01,245 INFO L485 AbstractCegarLoop]: Abstraction has has 1068 places, 3914 transitions, 105013 flow [2025-04-14 01:27:01,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.8) internal successors, (192), 40 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:01,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:27:01,246 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] [2025-04-14 01:27:01,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-14 01:27:01,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:01,450 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:27:01,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:27:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1614266706, now seen corresponding path program 1 times [2025-04-14 01:27:01,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:27:01,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948451587] [2025-04-14 01:27:01,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:27:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:27:01,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:27:01,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:01,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:02,288 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:27:02,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:27:02,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948451587] [2025-04-14 01:27:02,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948451587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:27:02,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339241722] [2025-04-14 01:27:02,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:27:02,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:27:02,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:27:02,291 INFO L229 MonitoredProcess]: Starting monitored process 31 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:27:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-14 01:27:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:27:02,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:27:02,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:27:02,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:27:02,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:27:02,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:27:02,410 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 19 treesize of output 1 [2025-04-14 01:27:03,004 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:03,004 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-14 01:27:03,088 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:27:03,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:27:09,621 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 374 treesize of output 332 [2025-04-14 01:27:09,627 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:09,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 404 [2025-04-14 01:27:10,031 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 202 treesize of output 176 [2025-04-14 01:27:10,038 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:27:10,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 1 [2025-04-14 01:27:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:27:10,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339241722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:27:10,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:27:10,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 38 [2025-04-14 01:27:10,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108126470] [2025-04-14 01:27:10,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:27:10,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 01:27:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:27:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 01:27:10,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1400, Unknown=0, NotChecked=0, Total=1560 [2025-04-14 01:27:10,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:27:10,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1068 places, 3914 transitions, 105013 flow. Second operand has 40 states, 40 states have (on average 4.875) internal successors, (195), 40 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:27:10,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:27:10,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:27:10,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:27:37,957 INFO L116 PetriNetUnfolderBase]: 17813/26630 cut-off events. [2025-04-14 01:27:37,957 INFO L117 PetriNetUnfolderBase]: For 975643/975643 co-relation queries the response was YES. [2025-04-14 01:27:38,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353741 conditions, 26630 events. 17813/26630 cut-off events. For 975643/975643 co-relation queries the response was YES. Maximal size of possible extension queue 1412. Compared 178559 event pairs, 962 based on Foata normal form. 2/26451 useless extension candidates. Maximal degree in co-relation 353331. Up to 20958 conditions per place. [2025-04-14 01:27:38,992 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 3371 selfloop transitions, 1720 changer transitions 3/5094 dead transitions. [2025-04-14 01:27:38,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1132 places, 5094 transitions, 148889 flow [2025-04-14 01:27:38,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-14 01:27:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2025-04-14 01:27:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 670 transitions. [2025-04-14 01:27:38,994 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32211538461538464 [2025-04-14 01:27:38,994 INFO L175 Difference]: Start difference. First operand has 1068 places, 3914 transitions, 105013 flow. Second operand 65 states and 670 transitions. [2025-04-14 01:27:38,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1132 places, 5094 transitions, 148889 flow [2025-04-14 01:28:09,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1107 places, 5094 transitions, 145632 flow, removed 918 selfloop flow, removed 25 redundant places. [2025-04-14 01:28:09,239 INFO L231 Difference]: Finished difference. Result has 1116 places, 4717 transitions, 133257 flow [2025-04-14 01:28:09,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102480, PETRI_DIFFERENCE_MINUEND_PLACES=1043, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=965, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=133257, PETRI_PLACES=1116, PETRI_TRANSITIONS=4717} [2025-04-14 01:28:09,241 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1085 predicate places. [2025-04-14 01:28:09,241 INFO L485 AbstractCegarLoop]: Abstraction has has 1116 places, 4717 transitions, 133257 flow [2025-04-14 01:28:09,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.875) internal successors, (195), 40 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:09,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:28:09,242 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] [2025-04-14 01:28:09,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-14 01:28:09,442 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-14 01:28:09,442 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:28:09,444 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:28:09,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1097163760, now seen corresponding path program 14 times [2025-04-14 01:28:09,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:28:09,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710549385] [2025-04-14 01:28:09,444 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:28:09,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:28:09,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:28:09,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:09,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:09,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:10,310 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:28:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:28:10,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710549385] [2025-04-14 01:28:10,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710549385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:28:10,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600522995] [2025-04-14 01:28:10,310 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:28:10,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:28:10,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:28:10,313 INFO L229 MonitoredProcess]: Starting monitored process 32 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:28:10,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-14 01:28:10,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:28:10,377 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:28:10,377 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:28:10,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:28:10,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:28:10,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:28:10,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:28:10,897 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:10,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 82 [2025-04-14 01:28:11,067 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:28:11,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:28:12,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:28:12,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 298 treesize of output 162 [2025-04-14 01:28:12,725 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:28:12,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600522995] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:28:12,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:28:12,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:28:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411169498] [2025-04-14 01:28:12,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:28:12,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:28:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:28:12,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:28:12,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:28:12,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:28:12,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1116 places, 4717 transitions, 133257 flow. Second operand has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:28:12,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:28:12,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:28:12,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:28:41,277 INFO L116 PetriNetUnfolderBase]: 18662/28053 cut-off events. [2025-04-14 01:28:41,278 INFO L117 PetriNetUnfolderBase]: For 1022164/1022164 co-relation queries the response was YES. [2025-04-14 01:28:42,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375899 conditions, 28053 events. 18662/28053 cut-off events. For 1022164/1022164 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 192590 event pairs, 592 based on Foata normal form. 2/27864 useless extension candidates. Maximal degree in co-relation 375481. Up to 17997 conditions per place. [2025-04-14 01:28:42,594 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2447 selfloop transitions, 2875 changer transitions 10/5332 dead transitions. [2025-04-14 01:28:42,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1182 places, 5332 transitions, 157033 flow [2025-04-14 01:28:42,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-14 01:28:42,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-04-14 01:28:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 691 transitions. [2025-04-14 01:28:42,596 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.322294776119403 [2025-04-14 01:28:42,596 INFO L175 Difference]: Start difference. First operand has 1116 places, 4717 transitions, 133257 flow. Second operand 67 states and 691 transitions. [2025-04-14 01:28:42,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1182 places, 5332 transitions, 157033 flow [2025-04-14 01:29:14,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1175 places, 5332 transitions, 154320 flow, removed 961 selfloop flow, removed 7 redundant places. [2025-04-14 01:29:15,027 INFO L231 Difference]: Finished difference. Result has 1195 places, 5065 transitions, 148394 flow [2025-04-14 01:29:15,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130630, PETRI_DIFFERENCE_MINUEND_PLACES=1109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2559, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2077, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=148394, PETRI_PLACES=1195, PETRI_TRANSITIONS=5065} [2025-04-14 01:29:15,030 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1164 predicate places. [2025-04-14 01:29:15,030 INFO L485 AbstractCegarLoop]: Abstraction has has 1195 places, 5065 transitions, 148394 flow [2025-04-14 01:29:15,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.794117647058823) internal successors, (163), 34 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:29:15,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:29:15,031 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] [2025-04-14 01:29:15,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-14 01:29:15,231 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:29:15,231 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:29:15,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:29:15,232 INFO L85 PathProgramCache]: Analyzing trace with hash 372654858, now seen corresponding path program 15 times [2025-04-14 01:29:15,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:29:15,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304321262] [2025-04-14 01:29:15,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:29:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:29:15,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:29:15,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:29:15,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:29:15,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:15,972 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:29:15,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:29:15,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304321262] [2025-04-14 01:29:15,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304321262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:29:15,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018772024] [2025-04-14 01:29:15,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:29:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:29:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:29:15,975 INFO L229 MonitoredProcess]: Starting monitored process 33 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:29:15,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-14 01:29:16,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:29:16,049 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:29:16,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:29:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:29:16,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:29:16,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:29:16,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:29:16,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:29:16,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 100 [2025-04-14 01:29:17,340 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:29:17,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:29:18,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:29:18,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 326 treesize of output 174 [2025-04-14 01:29:19,191 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:29:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018772024] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:29:19,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:29:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-14 01:29:19,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396694702] [2025-04-14 01:29:19,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:29:19,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-14 01:29:19,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:29:19,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-14 01:29:19,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2025-04-14 01:29:19,194 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:29:19,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1195 places, 5065 transitions, 148394 flow. Second operand has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:29:19,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:29:19,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:29:19,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:29:55,972 INFO L116 PetriNetUnfolderBase]: 19056/28708 cut-off events. [2025-04-14 01:29:55,973 INFO L117 PetriNetUnfolderBase]: For 1144014/1144014 co-relation queries the response was YES. [2025-04-14 01:29:56,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398862 conditions, 28708 events. 19056/28708 cut-off events. For 1144014/1144014 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 198632 event pairs, 620 based on Foata normal form. 4/28545 useless extension candidates. Maximal degree in co-relation 398488. Up to 18314 conditions per place. [2025-04-14 01:29:56,896 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 2497 selfloop transitions, 3162 changer transitions 21/5680 dead transitions. [2025-04-14 01:29:56,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1291 places, 5680 transitions, 173240 flow [2025-04-14 01:29:56,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-14 01:29:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-14 01:29:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 918 transitions. [2025-04-14 01:29:56,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2897727272727273 [2025-04-14 01:29:56,898 INFO L175 Difference]: Start difference. First operand has 1195 places, 5065 transitions, 148394 flow. Second operand 99 states and 918 transitions. [2025-04-14 01:29:56,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1291 places, 5680 transitions, 173240 flow [2025-04-14 01:30:40,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1264 places, 5680 transitions, 170248 flow, removed 749 selfloop flow, removed 27 redundant places. [2025-04-14 01:30:40,827 INFO L231 Difference]: Finished difference. Result has 1276 places, 5373 transitions, 163182 flow [2025-04-14 01:30:40,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=145556, PETRI_DIFFERENCE_MINUEND_PLACES=1166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2877, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2089, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=163182, PETRI_PLACES=1276, PETRI_TRANSITIONS=5373} [2025-04-14 01:30:40,831 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1245 predicate places. [2025-04-14 01:30:40,831 INFO L485 AbstractCegarLoop]: Abstraction has has 1276 places, 5373 transitions, 163182 flow [2025-04-14 01:30:40,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.676470588235294) internal successors, (159), 34 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call 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:40,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:30:40,831 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] [2025-04-14 01:30:40,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-14 01:30:41,031 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:41,032 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:30:41,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:30:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1938758144, now seen corresponding path program 16 times [2025-04-14 01:30:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:30:41,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013014888] [2025-04-14 01:30:41,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:30:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:30:41,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:30:41,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:30:41,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:30:41,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:41,729 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:30:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:30:41,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013014888] [2025-04-14 01:30:41,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013014888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:30:41,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942929642] [2025-04-14 01:30:41,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:30:41,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:30:41,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:30:41,732 INFO L229 MonitoredProcess]: Starting monitored process 34 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:41,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-14 01:30:41,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-14 01:30:41,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:30:41,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:30:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:30:41,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:30:41,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:30:42,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:42,560 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 82 [2025-04-14 01:30:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:30:42,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:30:44,021 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:30:44,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 340 treesize of output 164 [2025-04-14 01:30:44,488 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:30:44,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942929642] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:30:44,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:30:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 33 [2025-04-14 01:30:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935298580] [2025-04-14 01:30:44,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:30:44,489 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 01:30:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:30:44,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 01:30:44,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 01:30:44,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-14 01:30:44,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1276 places, 5373 transitions, 163182 flow. Second operand has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call 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:44,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:30:44,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-14 01:30:44,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-14 01:30:57,455 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:30:57,455 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:30:57,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-14 01:30:57,570 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:30:57,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-14 01:30:57,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-14 01:30:57,774 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (35states, 3/32 universal loopers) in iteration 58,while PetriNetUnfolder was constructing finite prefix that currently has 144504 conditions, 9259 events (6164/9258 cut-off events. For 446900/446900 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 64601 event pairs, 263 based on Foata normal form. 0/10821 useless extension candidates. Maximal degree in co-relation 144142. Up to 6454 conditions per place.). [2025-04-14 01:30:57,775 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:30:57,776 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:30:57,776 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:30:57,776 INFO L422 BasicCegarLoop]: Path program histogram: [28, 16, 8, 1, 1, 1, 1, 1, 1] [2025-04-14 01:30:57,778 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:30:57,778 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:30:57,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:30:57 BasicIcfg [2025-04-14 01:30:57,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:30:57,781 INFO L158 Benchmark]: Toolchain (without parser) took 767183.78ms. Allocated memory was 155.2MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 108.3MB in the beginning and 1.0GB in the end (delta: -895.9MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2025-04-14 01:30:57,781 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:30:57,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.56ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 93.1MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:30:57,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:30:57,781 INFO L158 Benchmark]: Boogie Preprocessor took 44.38ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:30:57,781 INFO L158 Benchmark]: IcfgBuilder took 546.79ms. Allocated memory is still 155.2MB. Free memory was 88.9MB in the beginning and 42.8MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 01:30:57,782 INFO L158 Benchmark]: TraceAbstraction took 766292.00ms. Allocated memory was 155.2MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 42.0MB in the beginning and 1.0GB in the end (delta: -962.2MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. [2025-04-14 01:30:57,782 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.59ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.56ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 93.1MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 155.2MB. Free memory was 93.1MB in the beginning and 91.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.38ms. Allocated memory is still 155.2MB. Free memory was 91.2MB in the beginning and 89.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 546.79ms. Allocated memory is still 155.2MB. Free memory was 88.9MB in the beginning and 42.8MB in the end (delta: 46.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 766292.00ms. Allocated memory was 155.2MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 42.0MB in the beginning and 1.0GB in the end (delta: -962.2MB). Peak memory consumption was 4.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (35states, 3/32 universal loopers) in iteration 58,while PetriNetUnfolder was constructing finite prefix that currently has 144504 conditions, 9259 events (6164/9258 cut-off events. For 446900/446900 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 64601 event pairs, 263 based on Foata normal form. 0/10821 useless extension candidates. Maximal degree in co-relation 144142. Up to 6454 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (35states, 3/32 universal loopers) in iteration 58,while PetriNetUnfolder was constructing finite prefix that currently has 144504 conditions, 9259 events (6164/9258 cut-off events. For 446900/446900 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 64601 event pairs, 263 based on Foata normal form. 0/10821 useless extension candidates. Maximal degree in co-relation 144142. Up to 6454 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (35states, 3/32 universal loopers) in iteration 58,while PetriNetUnfolder was constructing finite prefix that currently has 144504 conditions, 9259 events (6164/9258 cut-off events. For 446900/446900 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 64601 event pairs, 263 based on Foata normal form. 0/10821 useless extension candidates. Maximal degree in co-relation 144142. Up to 6454 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (35states, 3/32 universal loopers) in iteration 58,while PetriNetUnfolder was constructing finite prefix that currently has 144504 conditions, 9259 events (6164/9258 cut-off events. For 446900/446900 co-relation queries the response was YES. Maximal size of possible extension queue 1631. Compared 64601 event pairs, 263 based on Foata normal form. 0/10821 useless extension candidates. Maximal degree in co-relation 144142. Up to 6454 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 766.2s, OverallIterations: 58, TraceHistogramMax: 2, PathProgramHistogramMax: 28, EmptinessCheckTime: 0.0s, AutomataDifference: 666.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9184 SdHoareTripleChecker+Valid, 44.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9184 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1682 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70772 IncrementalHoareTripleChecker+Invalid, 72454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1682 mSolverCounterUnsat, 0 mSDtfsCounter, 70772 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2952 GetRequests, 933 SyntacticMatches, 34 SemanticMatches, 1985 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34609 ImplicationChecksByTransitivity, 103.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163182occurred in iteration=57, InterpolantAutomatonStates: 1456, 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.0s SatisfiabilityAnalysisTime, 89.7s InterpolantComputationTime, 2029 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 2645 ConstructedInterpolants, 0 QuantifiedInterpolants, 128054 SizeOfPredicates, 403 NumberOfNonLiveVariables, 6071 ConjunctsInSsa, 801 ConjunctsInUnsatCore, 123 InterpolantComputations, 30 PerfectInterpolantSequences, 172/372 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