/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:30:44,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:30:44,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:30:44,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:30:44,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:30:44,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:30:44,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:30:44,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:30:44,700 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:30:44,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:30:44,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:30:44,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:30:44,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:30:44,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:30:44,702 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:30:44,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:30:44,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:30:44,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:44,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:44,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:30:44,704 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:30:44,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:30:44,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:30:44,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:30:44,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:30:44,954 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:30:44,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-04-13 20:30:46,292 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a695baf74/9c71077080404a619778564385dd86cb/FLAG67d5183af [2025-04-13 20:30:46,477 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:30:46,477 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-04-13 20:30:46,483 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a695baf74/9c71077080404a619778564385dd86cb/FLAG67d5183af [2025-04-13 20:30:47,293 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a695baf74/9c71077080404a619778564385dd86cb [2025-04-13 20:30:47,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:30:47,297 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:30:47,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:30:47,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:30:47,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:30:47,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35d7760c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47, skipping insertion in model container [2025-04-13 20:30:47,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:30:47,487 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-04-13 20:30:47,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:30:47,501 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:30:47,528 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c[2564,2577] [2025-04-13 20:30:47,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:30:47,543 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:30:47,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47 WrapperNode [2025-04-13 20:30:47,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:30:47,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:30:47,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:30:47,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:30:47,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,578 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 170 [2025-04-13 20:30:47,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:30:47,579 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:30:47,579 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:30:47,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:30:47,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,604 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:30:47,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:30:47,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:30:47,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:30:47,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:30:47,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (1/1) ... [2025-04-13 20:30:47,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:30:47,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:47,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:30:47,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:30:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:30:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:30:47,680 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:30:47,680 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:30:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:30:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:30:47,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:30:47,683 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:30:47,779 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:30:47,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:30:48,009 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:30:48,009 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:30:48,009 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:30:48,227 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:30:48,229 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:30:48,230 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:30:48,232 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:30:48,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:30:48 BoogieIcfgContainer [2025-04-13 20:30:48,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:30:48,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:30:48,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:30:48,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:30:48,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:30:47" (1/3) ... [2025-04-13 20:30:48,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cce060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:30:48, skipping insertion in model container [2025-04-13 20:30:48,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:30:47" (2/3) ... [2025-04-13 20:30:48,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cce060b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:30:48, skipping insertion in model container [2025-04-13 20:30:48,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:30:48" (3/3) ... [2025-04-13 20:30:48,240 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-04-13 20:30:48,251 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:30:48,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:30:48,253 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:30:48,301 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:30:48,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:30:48,348 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:30:48,349 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:30:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-13 20:30:48,354 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:30:48,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:30:48,360 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:30:48,366 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;@5be99d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:30:48,366 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:30:48,377 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:30:48,377 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:30:48,377 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:30:48,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:48,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:48,380 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1036968573, now seen corresponding path program 1 times [2025-04-13 20:30:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:48,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515476183] [2025-04-13 20:30:48,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:48,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:30:48,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:30:48,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:48,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:48,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515476183] [2025-04-13 20:30:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515476183] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:48,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 20:30:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059651012] [2025-04-13 20:30:48,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:48,641 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:30:48,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:48,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:30:48,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:30:48,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:48,662 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-13 20:30:48,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:48,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:48,890 INFO L116 PetriNetUnfolderBase]: 728/1005 cut-off events. [2025-04-13 20:30:48,890 INFO L117 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-04-13 20:30:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 1005 events. 728/1005 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3376 event pairs, 126 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 1860. Up to 788 conditions per place. [2025-04-13 20:30:48,903 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2025-04-13 20:30:48,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 45 transitions, 213 flow [2025-04-13 20:30:48,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:30:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:30:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-13 20:30:48,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-04-13 20:30:48,914 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 55 transitions. [2025-04-13 20:30:48,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 45 transitions, 213 flow [2025-04-13 20:30:48,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:30:48,922 INFO L231 Difference]: Finished difference. Result has 28 places, 31 transitions, 88 flow [2025-04-13 20:30:48,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=28, PETRI_TRANSITIONS=31} [2025-04-13 20:30:48,927 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-13 20:30:48,927 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 31 transitions, 88 flow [2025-04-13 20:30:48,928 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-13 20:30:48,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:48,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:48,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:30:48,928 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:48,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:48,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1266717694, now seen corresponding path program 1 times [2025-04-13 20:30:48,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:48,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926471088] [2025-04-13 20:30:48,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:48,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:48,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:48,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:48,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:49,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:49,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926471088] [2025-04-13 20:30:49,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926471088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:49,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:49,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:30:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815121958] [2025-04-13 20:30:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:49,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:49,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:49,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:49,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:49,077 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:49,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 31 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:49,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:49,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:49,258 INFO L116 PetriNetUnfolderBase]: 991/1389 cut-off events. [2025-04-13 20:30:49,258 INFO L117 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2025-04-13 20:30:49,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 1389 events. 991/1389 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4857 event pairs, 566 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1007. Up to 851 conditions per place. [2025-04-13 20:30:49,266 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 52 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-04-13 20:30:49,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 56 transitions, 268 flow [2025-04-13 20:30:49,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:30:49,268 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:30:49,268 INFO L175 Difference]: Start difference. First operand has 28 places, 31 transitions, 88 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:30:49,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 56 transitions, 268 flow [2025-04-13 20:30:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 56 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:49,269 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 114 flow [2025-04-13 20:30:49,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-04-13 20:30:49,270 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2025-04-13 20:30:49,270 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 114 flow [2025-04-13 20:30:49,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:49,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:49,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:30:49,270 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:49,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash 513798144, now seen corresponding path program 1 times [2025-04-13 20:30:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:49,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109298344] [2025-04-13 20:30:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:49,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:49,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:49,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:49,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:49,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:49,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109298344] [2025-04-13 20:30:49,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109298344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:49,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:49,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348844430] [2025-04-13 20:30:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:49,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:49,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:49,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:49,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:49,358 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:49,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:49,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:49,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:49,512 INFO L116 PetriNetUnfolderBase]: 1053/1503 cut-off events. [2025-04-13 20:30:49,512 INFO L117 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2025-04-13 20:30:49,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 1503 events. 1053/1503 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5784 event pairs, 369 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2489. Up to 889 conditions per place. [2025-04-13 20:30:49,518 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 56 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2025-04-13 20:30:49,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 61 transitions, 317 flow [2025-04-13 20:30:49,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:30:49,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:30:49,519 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 114 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:30:49,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 61 transitions, 317 flow [2025-04-13 20:30:49,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 315 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-04-13 20:30:49,521 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 150 flow [2025-04-13 20:30:49,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-04-13 20:30:49,522 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-04-13 20:30:49,522 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 150 flow [2025-04-13 20:30:49,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:49,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:49,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:30:49,522 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:49,523 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1215809656, now seen corresponding path program 2 times [2025-04-13 20:30:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:49,523 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484251742] [2025-04-13 20:30:49,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:49,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:49,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:49,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:49,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:49,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484251742] [2025-04-13 20:30:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484251742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326674823] [2025-04-13 20:30:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:49,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:49,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:49,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:49,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:49,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:49,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:49,767 INFO L116 PetriNetUnfolderBase]: 889/1294 cut-off events. [2025-04-13 20:30:49,767 INFO L117 PetriNetUnfolderBase]: For 1376/1376 co-relation queries the response was YES. [2025-04-13 20:30:49,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 1294 events. 889/1294 cut-off events. For 1376/1376 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5052 event pairs, 192 based on Foata normal form. 76/1126 useless extension candidates. Maximal degree in co-relation 2551. Up to 1014 conditions per place. [2025-04-13 20:30:49,772 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 51 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-04-13 20:30:49,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 315 flow [2025-04-13 20:30:49,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2025-04-13 20:30:49,773 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-13 20:30:49,773 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 150 flow. Second operand 4 states and 58 transitions. [2025-04-13 20:30:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 315 flow [2025-04-13 20:30:49,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:49,775 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 178 flow [2025-04-13 20:30:49,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-13 20:30:49,775 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2025-04-13 20:30:49,776 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 178 flow [2025-04-13 20:30:49,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:49,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:49,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:30:49,776 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:49,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1293819090, now seen corresponding path program 1 times [2025-04-13 20:30:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:49,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524740698] [2025-04-13 20:30:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:49,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:49,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:49,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:49,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524740698] [2025-04-13 20:30:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524740698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:49,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973799094] [2025-04-13 20:30:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:49,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:49,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:49,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:49,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:49,866 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:49,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:49,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:49,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:50,035 INFO L116 PetriNetUnfolderBase]: 944/1402 cut-off events. [2025-04-13 20:30:50,035 INFO L117 PetriNetUnfolderBase]: For 1564/1564 co-relation queries the response was YES. [2025-04-13 20:30:50,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1402 events. 944/1402 cut-off events. For 1564/1564 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5483 event pairs, 434 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 3008. Up to 1024 conditions per place. [2025-04-13 20:30:50,042 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 54 selfloop transitions, 7 changer transitions 9/70 dead transitions. [2025-04-13 20:30:50,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 451 flow [2025-04-13 20:30:50,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-13 20:30:50,043 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:30:50,043 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 178 flow. Second operand 4 states and 64 transitions. [2025-04-13 20:30:50,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 451 flow [2025-04-13 20:30:50,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:50,047 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 197 flow [2025-04-13 20:30:50,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-04-13 20:30:50,047 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-04-13 20:30:50,047 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 197 flow [2025-04-13 20:30:50,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:50,047 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:30:50,048 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:50,048 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1038811888, now seen corresponding path program 2 times [2025-04-13 20:30:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152285578] [2025-04-13 20:30:50,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:50,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:30:50,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:30:50,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:50,111 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152285578] [2025-04-13 20:30:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152285578] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615191525] [2025-04-13 20:30:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,112 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:50,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:50,112 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:50,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:50,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:50,246 INFO L116 PetriNetUnfolderBase]: 864/1284 cut-off events. [2025-04-13 20:30:50,246 INFO L117 PetriNetUnfolderBase]: For 2123/2123 co-relation queries the response was YES. [2025-04-13 20:30:50,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 1284 events. 864/1284 cut-off events. For 2123/2123 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4792 event pairs, 231 based on Foata normal form. 32/1132 useless extension candidates. Maximal degree in co-relation 3008. Up to 1093 conditions per place. [2025-04-13 20:30:50,252 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 44 selfloop transitions, 4 changer transitions 8/56 dead transitions. [2025-04-13 20:30:50,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 376 flow [2025-04-13 20:30:50,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-13 20:30:50,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-13 20:30:50,254 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 197 flow. Second operand 4 states and 56 transitions. [2025-04-13 20:30:50,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 376 flow [2025-04-13 20:30:50,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:50,258 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 166 flow [2025-04-13 20:30:50,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-04-13 20:30:50,259 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-13 20:30:50,259 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 166 flow [2025-04-13 20:30:50,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:50,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:30:50,259 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:50,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 330921525, now seen corresponding path program 1 times [2025-04-13 20:30:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929365264] [2025-04-13 20:30:50,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:50,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:30:50,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:30:50,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:50,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929365264] [2025-04-13 20:30:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929365264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:50,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393481582] [2025-04-13 20:30:50,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:50,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:50,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:50,337 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:50,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:30:50,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:30:50,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:30:50,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:50,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:30:50,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:50,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393481582] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:50,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:30:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2025-04-13 20:30:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402477192] [2025-04-13 20:30:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:30:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:30:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:30:50,509 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:50,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:50,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:50,628 INFO L116 PetriNetUnfolderBase]: 726/1058 cut-off events. [2025-04-13 20:30:50,628 INFO L117 PetriNetUnfolderBase]: For 1369/1369 co-relation queries the response was YES. [2025-04-13 20:30:50,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3106 conditions, 1058 events. 726/1058 cut-off events. For 1369/1369 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3743 event pairs, 163 based on Foata normal form. 12/908 useless extension candidates. Maximal degree in co-relation 3085. Up to 666 conditions per place. [2025-04-13 20:30:50,633 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 52 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-04-13 20:30:50,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 366 flow [2025-04-13 20:30:50,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:30:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:30:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-04-13 20:30:50,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38125 [2025-04-13 20:30:50,635 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 166 flow. Second operand 5 states and 61 transitions. [2025-04-13 20:30:50,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 366 flow [2025-04-13 20:30:50,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 319 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-04-13 20:30:50,638 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 171 flow [2025-04-13 20:30:50,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-04-13 20:30:50,640 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-13 20:30:50,640 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 171 flow [2025-04-13 20:30:50,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:50,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:50,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:30:50,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:50,843 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:50,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:50,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2050293225, now seen corresponding path program 2 times [2025-04-13 20:30:50,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:50,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373369619] [2025-04-13 20:30:50,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:50,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:50,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:30:50,856 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 20:30:50,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:50,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:50,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373369619] [2025-04-13 20:30:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373369619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:30:50,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816617457] [2025-04-13 20:30:50,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:50,907 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:30:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:50,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:30:50,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:30:50,907 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:50,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:50,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:50,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:50,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:51,138 INFO L116 PetriNetUnfolderBase]: 1118/1591 cut-off events. [2025-04-13 20:30:51,138 INFO L117 PetriNetUnfolderBase]: For 1037/1037 co-relation queries the response was YES. [2025-04-13 20:30:51,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4453 conditions, 1591 events. 1118/1591 cut-off events. For 1037/1037 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6208 event pairs, 25 based on Foata normal form. 11/1318 useless extension candidates. Maximal degree in co-relation 4428. Up to 627 conditions per place. [2025-04-13 20:30:51,146 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 102 selfloop transitions, 15 changer transitions 0/117 dead transitions. [2025-04-13 20:30:51,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 117 transitions, 675 flow [2025-04-13 20:30:51,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:30:51,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:30:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-04-13 20:30:51,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5401785714285714 [2025-04-13 20:30:51,148 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 171 flow. Second operand 7 states and 121 transitions. [2025-04-13 20:30:51,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 117 transitions, 675 flow [2025-04-13 20:30:51,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 117 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 20:30:51,150 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 288 flow [2025-04-13 20:30:51,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2025-04-13 20:30:51,151 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2025-04-13 20:30:51,151 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 288 flow [2025-04-13 20:30:51,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:51,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:51,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:51,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:30:51,153 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:51,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash 410230665, now seen corresponding path program 3 times [2025-04-13 20:30:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:51,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15653656] [2025-04-13 20:30:51,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:51,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:30:51,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 18 statements. [2025-04-13 20:30:51,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:30:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:51,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:51,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15653656] [2025-04-13 20:30:51,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15653656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:51,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:51,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:51,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931427208] [2025-04-13 20:30:51,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:51,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:51,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:51,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:51,204 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:51,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:51,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:51,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:51,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:51,367 INFO L116 PetriNetUnfolderBase]: 1116/1589 cut-off events. [2025-04-13 20:30:51,367 INFO L117 PetriNetUnfolderBase]: For 2967/2967 co-relation queries the response was YES. [2025-04-13 20:30:51,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5491 conditions, 1589 events. 1116/1589 cut-off events. For 2967/2967 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5874 event pairs, 445 based on Foata normal form. 2/1307 useless extension candidates. Maximal degree in co-relation 5462. Up to 1320 conditions per place. [2025-04-13 20:30:51,375 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 79 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-04-13 20:30:51,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 625 flow [2025-04-13 20:30:51,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 20:30:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 20:30:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-13 20:30:51,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-04-13 20:30:51,376 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 288 flow. Second operand 4 states and 62 transitions. [2025-04-13 20:30:51,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 625 flow [2025-04-13 20:30:51,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 606 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:51,381 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 305 flow [2025-04-13 20:30:51,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-04-13 20:30:51,381 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2025-04-13 20:30:51,381 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 305 flow [2025-04-13 20:30:51,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:51,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:51,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:51,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:30:51,382 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:51,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:51,382 INFO L85 PathProgramCache]: Analyzing trace with hash 390821903, now seen corresponding path program 4 times [2025-04-13 20:30:51,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:51,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203891567] [2025-04-13 20:30:51,382 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:51,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:51,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:30:51,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 18 statements. [2025-04-13 20:30:51,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:30:51,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:51,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203891567] [2025-04-13 20:30:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203891567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 20:30:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396932457] [2025-04-13 20:30:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:51,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:30:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:51,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:30:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:30:51,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:51,623 INFO L116 PetriNetUnfolderBase]: 1098/1557 cut-off events. [2025-04-13 20:30:51,623 INFO L117 PetriNetUnfolderBase]: For 3148/3148 co-relation queries the response was YES. [2025-04-13 20:30:51,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 1557 events. 1098/1557 cut-off events. For 3148/3148 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5888 event pairs, 171 based on Foata normal form. 11/1288 useless extension candidates. Maximal degree in co-relation 5310. Up to 866 conditions per place. [2025-04-13 20:30:51,631 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 86 selfloop transitions, 10 changer transitions 1/97 dead transitions. [2025-04-13 20:30:51,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 715 flow [2025-04-13 20:30:51,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:30:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:30:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-13 20:30:51,632 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 20:30:51,632 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 305 flow. Second operand 5 states and 80 transitions. [2025-04-13 20:30:51,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 715 flow [2025-04-13 20:30:51,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 711 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:51,637 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 367 flow [2025-04-13 20:30:51,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-04-13 20:30:51,638 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2025-04-13 20:30:51,638 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 367 flow [2025-04-13 20:30:51,638 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:51,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:51,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:51,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:30:51,638 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:51,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash 306227410, now seen corresponding path program 1 times [2025-04-13 20:30:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:51,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636712965] [2025-04-13 20:30:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:30:51,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:51,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:51,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:51,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636712965] [2025-04-13 20:30:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636712965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458534974] [2025-04-13 20:30:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:51,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:51,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:51,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:51,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:51,977 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:51,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 367 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-13 20:30:51,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:51,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:51,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:52,351 INFO L116 PetriNetUnfolderBase]: 1236/1773 cut-off events. [2025-04-13 20:30:52,352 INFO L117 PetriNetUnfolderBase]: For 3740/3740 co-relation queries the response was YES. [2025-04-13 20:30:52,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6365 conditions, 1773 events. 1236/1773 cut-off events. For 3740/3740 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7128 event pairs, 129 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 6333. Up to 1438 conditions per place. [2025-04-13 20:30:52,362 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 110 selfloop transitions, 29 changer transitions 3/142 dead transitions. [2025-04-13 20:30:52,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 142 transitions, 1173 flow [2025-04-13 20:30:52,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-04-13 20:30:52,363 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 20:30:52,363 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 367 flow. Second operand 10 states and 130 transitions. [2025-04-13 20:30:52,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 142 transitions, 1173 flow [2025-04-13 20:30:52,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 142 transitions, 1151 flow, removed 11 selfloop flow, removed 1 redundant places. [2025-04-13 20:30:52,369 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 593 flow [2025-04-13 20:30:52,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=593, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2025-04-13 20:30:52,370 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 42 predicate places. [2025-04-13 20:30:52,370 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 593 flow [2025-04-13 20:30:52,370 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-13 20:30:52,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:52,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:52,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:30:52,371 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:52,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1454704396, now seen corresponding path program 2 times [2025-04-13 20:30:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:52,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317756784] [2025-04-13 20:30:52,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:52,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:52,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:30:52,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:52,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:52,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317756784] [2025-04-13 20:30:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317756784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945555478] [2025-04-13 20:30:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:52,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:52,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:52,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:52,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:52,718 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:52,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 593 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-13 20:30:52,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:52,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:52,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:53,099 INFO L116 PetriNetUnfolderBase]: 1320/1900 cut-off events. [2025-04-13 20:30:53,100 INFO L117 PetriNetUnfolderBase]: For 4805/4805 co-relation queries the response was YES. [2025-04-13 20:30:53,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7715 conditions, 1900 events. 1320/1900 cut-off events. For 4805/4805 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7694 event pairs, 221 based on Foata normal form. 1/1625 useless extension candidates. Maximal degree in co-relation 7676. Up to 1700 conditions per place. [2025-04-13 20:30:53,110 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 104 selfloop transitions, 30 changer transitions 3/137 dead transitions. [2025-04-13 20:30:53,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 137 transitions, 1237 flow [2025-04-13 20:30:53,111 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:53,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2025-04-13 20:30:53,112 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.365625 [2025-04-13 20:30:53,112 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 593 flow. Second operand 10 states and 117 transitions. [2025-04-13 20:30:53,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 137 transitions, 1237 flow [2025-04-13 20:30:53,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 137 transitions, 1198 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-04-13 20:30:53,121 INFO L231 Difference]: Finished difference. Result has 85 places, 93 transitions, 793 flow [2025-04-13 20:30:53,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=793, PETRI_PLACES=85, PETRI_TRANSITIONS=93} [2025-04-13 20:30:53,122 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2025-04-13 20:30:53,122 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 93 transitions, 793 flow [2025-04-13 20:30:53,122 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-13 20:30:53,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:53,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:53,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:30:53,122 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:53,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -217116232, now seen corresponding path program 3 times [2025-04-13 20:30:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:53,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708951563] [2025-04-13 20:30:53,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:30:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:53,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:53,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:30:53,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:30:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:53,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:53,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708951563] [2025-04-13 20:30:53,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708951563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:53,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:53,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:53,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316751631] [2025-04-13 20:30:53,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:53,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:53,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:53,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:53,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:53,422 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:53,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 93 transitions, 793 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-13 20:30:53,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:53,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:53,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:53,805 INFO L116 PetriNetUnfolderBase]: 1389/2006 cut-off events. [2025-04-13 20:30:53,805 INFO L117 PetriNetUnfolderBase]: For 5897/5897 co-relation queries the response was YES. [2025-04-13 20:30:53,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 2006 events. 1389/2006 cut-off events. For 5897/5897 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8268 event pairs, 218 based on Foata normal form. 1/1731 useless extension candidates. Maximal degree in co-relation 8692. Up to 1730 conditions per place. [2025-04-13 20:30:53,813 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 113 selfloop transitions, 42 changer transitions 3/158 dead transitions. [2025-04-13 20:30:53,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 158 transitions, 1523 flow [2025-04-13 20:30:53,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2025-04-13 20:30:53,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-04-13 20:30:53,815 INFO L175 Difference]: Start difference. First operand has 85 places, 93 transitions, 793 flow. Second operand 10 states and 124 transitions. [2025-04-13 20:30:53,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 158 transitions, 1523 flow [2025-04-13 20:30:53,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 158 transitions, 1480 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-04-13 20:30:53,826 INFO L231 Difference]: Finished difference. Result has 95 places, 107 transitions, 1000 flow [2025-04-13 20:30:53,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1000, PETRI_PLACES=95, PETRI_TRANSITIONS=107} [2025-04-13 20:30:53,826 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 64 predicate places. [2025-04-13 20:30:53,826 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 107 transitions, 1000 flow [2025-04-13 20:30:53,826 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-13 20:30:53,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:53,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-13 20:30:53,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:30:53,827 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:53,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1914605064, now seen corresponding path program 4 times [2025-04-13 20:30:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:53,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838677900] [2025-04-13 20:30:53,827 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:30:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:53,835 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:53,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-13 20:30:53,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:30:53,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:54,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:54,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838677900] [2025-04-13 20:30:54,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838677900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:54,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:54,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584314084] [2025-04-13 20:30:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:54,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:54,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:54,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:54,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:54,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 107 transitions, 1000 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-13 20:30:54,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:54,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:54,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:54,492 INFO L116 PetriNetUnfolderBase]: 1469/2131 cut-off events. [2025-04-13 20:30:54,492 INFO L117 PetriNetUnfolderBase]: For 7114/7114 co-relation queries the response was YES. [2025-04-13 20:30:54,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9905 conditions, 2131 events. 1469/2131 cut-off events. For 7114/7114 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 8953 event pairs, 232 based on Foata normal form. 1/1838 useless extension candidates. Maximal degree in co-relation 9855. Up to 1831 conditions per place. [2025-04-13 20:30:54,501 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 125 selfloop transitions, 47 changer transitions 3/175 dead transitions. [2025-04-13 20:30:54,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 175 transitions, 1779 flow [2025-04-13 20:30:54,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:54,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2025-04-13 20:30:54,503 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.403125 [2025-04-13 20:30:54,503 INFO L175 Difference]: Start difference. First operand has 95 places, 107 transitions, 1000 flow. Second operand 10 states and 129 transitions. [2025-04-13 20:30:54,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 175 transitions, 1779 flow [2025-04-13 20:30:54,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 175 transitions, 1688 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-04-13 20:30:54,518 INFO L231 Difference]: Finished difference. Result has 103 places, 118 transitions, 1128 flow [2025-04-13 20:30:54,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1128, PETRI_PLACES=103, PETRI_TRANSITIONS=118} [2025-04-13 20:30:54,519 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 72 predicate places. [2025-04-13 20:30:54,519 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 118 transitions, 1128 flow [2025-04-13 20:30:54,519 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-13 20:30:54,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:54,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:54,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:30:54,519 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:54,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2109792682, now seen corresponding path program 5 times [2025-04-13 20:30:54,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:54,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903407444] [2025-04-13 20:30:54,520 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:54,525 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:54,544 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:54,545 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:54,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:54,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903407444] [2025-04-13 20:30:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903407444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:54,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23055334] [2025-04-13 20:30:54,953 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:30:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:30:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:30:54,956 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:30:54,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:30:55,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:55,024 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:55,024 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:30:55,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:55,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:30:55,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:30:55,056 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-13 20:30:55,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:30:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:30:55,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:30:55,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-13 20:30:55,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23055334] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:30:55,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:30:55,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 18 [2025-04-13 20:30:55,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046376524] [2025-04-13 20:30:55,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:55,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:30:55,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:55,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:30:55,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:30:55,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:55,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 118 transitions, 1128 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:55,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:55,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:55,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:55,799 INFO L116 PetriNetUnfolderBase]: 1851/2731 cut-off events. [2025-04-13 20:30:55,799 INFO L117 PetriNetUnfolderBase]: For 11187/11187 co-relation queries the response was YES. [2025-04-13 20:30:55,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13487 conditions, 2731 events. 1851/2731 cut-off events. For 11187/11187 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12589 event pairs, 232 based on Foata normal form. 1/2487 useless extension candidates. Maximal degree in co-relation 13433. Up to 2087 conditions per place. [2025-04-13 20:30:55,816 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 180 selfloop transitions, 71 changer transitions 4/255 dead transitions. [2025-04-13 20:30:55,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 255 transitions, 2766 flow [2025-04-13 20:30:55,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:30:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:30:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2025-04-13 20:30:55,817 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2025-04-13 20:30:55,818 INFO L175 Difference]: Start difference. First operand has 103 places, 118 transitions, 1128 flow. Second operand 9 states and 122 transitions. [2025-04-13 20:30:55,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 255 transitions, 2766 flow [2025-04-13 20:30:55,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 255 transitions, 2577 flow, removed 50 selfloop flow, removed 5 redundant places. [2025-04-13 20:30:55,848 INFO L231 Difference]: Finished difference. Result has 112 places, 177 transitions, 1847 flow [2025-04-13 20:30:55,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1847, PETRI_PLACES=112, PETRI_TRANSITIONS=177} [2025-04-13 20:30:55,848 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 81 predicate places. [2025-04-13 20:30:55,848 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 177 transitions, 1847 flow [2025-04-13 20:30:55,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:55,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:55,848 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:55,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 20:30:56,049 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,SelfDestructingSolverStorable14 [2025-04-13 20:30:56,049 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:56,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1667310844, now seen corresponding path program 1 times [2025-04-13 20:30:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:56,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251038625] [2025-04-13 20:30:56,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:30:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:56,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:30:56,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:56,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:56,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:56,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:56,249 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251038625] [2025-04-13 20:30:56,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251038625] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:56,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:56,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:30:56,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931333917] [2025-04-13 20:30:56,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:56,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:30:56,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:56,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:30:56,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:30:56,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:56,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 177 transitions, 1847 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:56,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:56,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:56,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:56,729 INFO L116 PetriNetUnfolderBase]: 2119/3118 cut-off events. [2025-04-13 20:30:56,730 INFO L117 PetriNetUnfolderBase]: For 15647/15647 co-relation queries the response was YES. [2025-04-13 20:30:56,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16456 conditions, 3118 events. 2119/3118 cut-off events. For 15647/15647 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14915 event pairs, 162 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 16394. Up to 2305 conditions per place. [2025-04-13 20:30:56,748 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 158 selfloop transitions, 99 changer transitions 1/258 dead transitions. [2025-04-13 20:30:56,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 258 transitions, 2977 flow [2025-04-13 20:30:56,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 142 transitions. [2025-04-13 20:30:56,749 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44375 [2025-04-13 20:30:56,749 INFO L175 Difference]: Start difference. First operand has 112 places, 177 transitions, 1847 flow. Second operand 10 states and 142 transitions. [2025-04-13 20:30:56,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 258 transitions, 2977 flow [2025-04-13 20:30:56,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 258 transitions, 2943 flow, removed 17 selfloop flow, removed 0 redundant places. [2025-04-13 20:30:56,792 INFO L231 Difference]: Finished difference. Result has 125 places, 197 transitions, 2367 flow [2025-04-13 20:30:56,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2367, PETRI_PLACES=125, PETRI_TRANSITIONS=197} [2025-04-13 20:30:56,793 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2025-04-13 20:30:56,794 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 197 transitions, 2367 flow [2025-04-13 20:30:56,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:56,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:56,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:56,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:30:56,794 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:56,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:56,794 INFO L85 PathProgramCache]: Analyzing trace with hash -838551640, now seen corresponding path program 2 times [2025-04-13 20:30:56,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:56,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440085800] [2025-04-13 20:30:56,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:56,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:56,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:56,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:30:56,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:56,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30: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-13 20:30:56,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:56,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440085800] [2025-04-13 20:30:56,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440085800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:56,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:56,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:30:56,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575392741] [2025-04-13 20:30:56,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:56,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:30:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:56,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:30:56,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:30:56,982 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:56,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 197 transitions, 2367 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:56,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:56,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:56,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:57,426 INFO L116 PetriNetUnfolderBase]: 2427/3561 cut-off events. [2025-04-13 20:30:57,426 INFO L117 PetriNetUnfolderBase]: For 22546/22546 co-relation queries the response was YES. [2025-04-13 20:30:57,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20449 conditions, 3561 events. 2427/3561 cut-off events. For 22546/22546 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 17233 event pairs, 413 based on Foata normal form. 1/3263 useless extension candidates. Maximal degree in co-relation 20380. Up to 3105 conditions per place. [2025-04-13 20:30:57,448 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 211 selfloop transitions, 62 changer transitions 1/274 dead transitions. [2025-04-13 20:30:57,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 274 transitions, 3636 flow [2025-04-13 20:30:57,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:30:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:30:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-04-13 20:30:57,450 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 20:30:57,450 INFO L175 Difference]: Start difference. First operand has 125 places, 197 transitions, 2367 flow. Second operand 9 states and 120 transitions. [2025-04-13 20:30:57,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 274 transitions, 3636 flow [2025-04-13 20:30:57,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 274 transitions, 3520 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-04-13 20:30:57,514 INFO L231 Difference]: Finished difference. Result has 133 places, 229 transitions, 2929 flow [2025-04-13 20:30:57,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2281, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2929, PETRI_PLACES=133, PETRI_TRANSITIONS=229} [2025-04-13 20:30:57,515 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2025-04-13 20:30:57,515 INFO L485 AbstractCegarLoop]: Abstraction has has 133 places, 229 transitions, 2929 flow [2025-04-13 20:30:57,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:30:57,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:57,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:57,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:30:57,515 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:57,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -707615072, now seen corresponding path program 6 times [2025-04-13 20:30:57,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:57,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522597903] [2025-04-13 20:30:57,516 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:30:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:57,523 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:57,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:30:57,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:30:57,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:57,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522597903] [2025-04-13 20:30:57,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522597903] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:57,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:57,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:57,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687465369] [2025-04-13 20:30:57,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:57,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:57,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:57,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:57,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:57,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:57,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 229 transitions, 2929 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-13 20:30:57,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:57,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:57,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:58,401 INFO L116 PetriNetUnfolderBase]: 2427/3560 cut-off events. [2025-04-13 20:30:58,401 INFO L117 PetriNetUnfolderBase]: For 23574/23574 co-relation queries the response was YES. [2025-04-13 20:30:58,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20904 conditions, 3560 events. 2427/3560 cut-off events. For 23574/23574 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 17304 event pairs, 343 based on Foata normal form. 1/3262 useless extension candidates. Maximal degree in co-relation 20831. Up to 3150 conditions per place. [2025-04-13 20:30:58,489 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 173 selfloop transitions, 102 changer transitions 4/279 dead transitions. [2025-04-13 20:30:58,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 279 transitions, 3810 flow [2025-04-13 20:30:58,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:58,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:58,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2025-04-13 20:30:58,490 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39375 [2025-04-13 20:30:58,491 INFO L175 Difference]: Start difference. First operand has 133 places, 229 transitions, 2929 flow. Second operand 10 states and 126 transitions. [2025-04-13 20:30:58,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 279 transitions, 3810 flow [2025-04-13 20:30:58,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 279 transitions, 3710 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-04-13 20:30:58,585 INFO L231 Difference]: Finished difference. Result has 142 places, 237 transitions, 3134 flow [2025-04-13 20:30:58,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2829, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3134, PETRI_PLACES=142, PETRI_TRANSITIONS=237} [2025-04-13 20:30:58,586 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2025-04-13 20:30:58,586 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 237 transitions, 3134 flow [2025-04-13 20:30:58,587 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-13 20:30:58,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:58,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:30:58,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:30:58,587 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:58,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash -957201006, now seen corresponding path program 7 times [2025-04-13 20:30:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:58,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529738384] [2025-04-13 20:30:58,588 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:30:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:58,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:30:58,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:30:58,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:30:58,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:58,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:58,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529738384] [2025-04-13 20:30:58,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529738384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:58,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:58,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:58,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431190627] [2025-04-13 20:30:58,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:58,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:58,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:58,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:58,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:58,872 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:58,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 237 transitions, 3134 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-13 20:30:58,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:58,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:58,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:30:59,408 INFO L116 PetriNetUnfolderBase]: 2519/3690 cut-off events. [2025-04-13 20:30:59,408 INFO L117 PetriNetUnfolderBase]: For 24764/24764 co-relation queries the response was YES. [2025-04-13 20:30:59,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21830 conditions, 3690 events. 2519/3690 cut-off events. For 24764/24764 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 17964 event pairs, 373 based on Foata normal form. 1/3376 useless extension candidates. Maximal degree in co-relation 21754. Up to 3478 conditions per place. [2025-04-13 20:30:59,431 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 233 selfloop transitions, 57 changer transitions 3/293 dead transitions. [2025-04-13 20:30:59,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 293 transitions, 4229 flow [2025-04-13 20:30:59,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:30:59,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:30:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2025-04-13 20:30:59,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3625 [2025-04-13 20:30:59,434 INFO L175 Difference]: Start difference. First operand has 142 places, 237 transitions, 3134 flow. Second operand 10 states and 116 transitions. [2025-04-13 20:30:59,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 293 transitions, 4229 flow [2025-04-13 20:30:59,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 293 transitions, 4047 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-04-13 20:30:59,520 INFO L231 Difference]: Finished difference. Result has 147 places, 259 transitions, 3384 flow [2025-04-13 20:30:59,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2952, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3384, PETRI_PLACES=147, PETRI_TRANSITIONS=259} [2025-04-13 20:30:59,521 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2025-04-13 20:30:59,521 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 259 transitions, 3384 flow [2025-04-13 20:30:59,521 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-13 20:30:59,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:30:59,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-13 20:30:59,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:30:59,521 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:30:59,522 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:30:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 759358762, now seen corresponding path program 8 times [2025-04-13 20:30:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:30:59,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828222367] [2025-04-13 20:30:59,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:30:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:30:59,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:30:59,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:30:59,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:30:59,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:30:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:30:59,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:30:59,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828222367] [2025-04-13 20:30:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828222367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:30:59,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:30:59,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:30:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971204773] [2025-04-13 20:30:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:30:59,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:30:59,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:30:59,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:30:59,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:30:59,757 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:30:59,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 259 transitions, 3384 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-13 20:30:59,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:30:59,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:30:59,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:00,349 INFO L116 PetriNetUnfolderBase]: 2559/3760 cut-off events. [2025-04-13 20:31:00,349 INFO L117 PetriNetUnfolderBase]: For 28107/28107 co-relation queries the response was YES. [2025-04-13 20:31:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22769 conditions, 3760 events. 2559/3760 cut-off events. For 28107/28107 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 18500 event pairs, 379 based on Foata normal form. 1/3446 useless extension candidates. Maximal degree in co-relation 22691. Up to 3548 conditions per place. [2025-04-13 20:31:00,369 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 249 selfloop transitions, 53 changer transitions 3/305 dead transitions. [2025-04-13 20:31:00,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 305 transitions, 4409 flow [2025-04-13 20:31:00,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:00,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2025-04-13 20:31:00,371 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.353125 [2025-04-13 20:31:00,371 INFO L175 Difference]: Start difference. First operand has 147 places, 259 transitions, 3384 flow. Second operand 10 states and 113 transitions. [2025-04-13 20:31:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 305 transitions, 4409 flow [2025-04-13 20:31:00,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 305 transitions, 4187 flow, removed 88 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:00,476 INFO L231 Difference]: Finished difference. Result has 155 places, 271 transitions, 3491 flow [2025-04-13 20:31:00,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3162, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3491, PETRI_PLACES=155, PETRI_TRANSITIONS=271} [2025-04-13 20:31:00,476 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 124 predicate places. [2025-04-13 20:31:00,476 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 271 transitions, 3491 flow [2025-04-13 20:31:00,477 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-13 20:31:00,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:00,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:00,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 20:31:00,477 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:00,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1234257306, now seen corresponding path program 9 times [2025-04-13 20:31:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:00,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749619137] [2025-04-13 20:31:00,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:00,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:00,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:00,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:31:00,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:00,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:00,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749619137] [2025-04-13 20:31:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749619137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548110367] [2025-04-13 20:31:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:00,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:00,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:00,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:00,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:00,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 271 transitions, 3491 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-13 20:31:00,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:00,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:00,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:01,294 INFO L116 PetriNetUnfolderBase]: 2601/3829 cut-off events. [2025-04-13 20:31:01,294 INFO L117 PetriNetUnfolderBase]: For 31154/31154 co-relation queries the response was YES. [2025-04-13 20:31:01,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23572 conditions, 3829 events. 2601/3829 cut-off events. For 31154/31154 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 18983 event pairs, 381 based on Foata normal form. 1/3502 useless extension candidates. Maximal degree in co-relation 23490. Up to 3565 conditions per place. [2025-04-13 20:31:01,326 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 248 selfloop transitions, 62 changer transitions 4/314 dead transitions. [2025-04-13 20:31:01,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 314 transitions, 4463 flow [2025-04-13 20:31:01,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:31:01,329 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.371875 [2025-04-13 20:31:01,329 INFO L175 Difference]: Start difference. First operand has 155 places, 271 transitions, 3491 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:31:01,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 314 transitions, 4463 flow [2025-04-13 20:31:01,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 314 transitions, 4283 flow, removed 62 selfloop flow, removed 5 redundant places. [2025-04-13 20:31:01,445 INFO L231 Difference]: Finished difference. Result has 161 places, 277 transitions, 3566 flow [2025-04-13 20:31:01,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3566, PETRI_PLACES=161, PETRI_TRANSITIONS=277} [2025-04-13 20:31:01,445 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 130 predicate places. [2025-04-13 20:31:01,445 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 277 transitions, 3566 flow [2025-04-13 20:31:01,445 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-13 20:31:01,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:01,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:01,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:31:01,446 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:01,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -920332954, now seen corresponding path program 10 times [2025-04-13 20:31:01,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:01,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569943819] [2025-04-13 20:31:01,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:01,453 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:01,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:01,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:01,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569943819] [2025-04-13 20:31:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569943819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934455358] [2025-04-13 20:31:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:01,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:01,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:01,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:01,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:01,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 277 transitions, 3566 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-13 20:31:01,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:01,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:01,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:02,352 INFO L116 PetriNetUnfolderBase]: 2707/3993 cut-off events. [2025-04-13 20:31:02,352 INFO L117 PetriNetUnfolderBase]: For 35118/35118 co-relation queries the response was YES. [2025-04-13 20:31:02,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25178 conditions, 3993 events. 2707/3993 cut-off events. For 35118/35118 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19990 event pairs, 407 based on Foata normal form. 1/3674 useless extension candidates. Maximal degree in co-relation 25093. Up to 3722 conditions per place. [2025-04-13 20:31:02,376 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 268 selfloop transitions, 64 changer transitions 3/335 dead transitions. [2025-04-13 20:31:02,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 335 transitions, 4819 flow [2025-04-13 20:31:02,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-04-13 20:31:02,377 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38125 [2025-04-13 20:31:02,377 INFO L175 Difference]: Start difference. First operand has 161 places, 277 transitions, 3566 flow. Second operand 10 states and 122 transitions. [2025-04-13 20:31:02,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 335 transitions, 4819 flow [2025-04-13 20:31:02,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 335 transitions, 4672 flow, removed 38 selfloop flow, removed 6 redundant places. [2025-04-13 20:31:02,502 INFO L231 Difference]: Finished difference. Result has 167 places, 291 transitions, 3840 flow [2025-04-13 20:31:02,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3419, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3840, PETRI_PLACES=167, PETRI_TRANSITIONS=291} [2025-04-13 20:31:02,503 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2025-04-13 20:31:02,503 INFO L485 AbstractCegarLoop]: Abstraction has has 167 places, 291 transitions, 3840 flow [2025-04-13 20:31:02,503 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-13 20:31:02,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:02,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:02,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:31:02,503 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:02,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1190902504, now seen corresponding path program 11 times [2025-04-13 20:31:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:02,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400003041] [2025-04-13 20:31:02,504 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:02,513 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:02,523 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:02,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:02,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:02,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:02,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400003041] [2025-04-13 20:31:02,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400003041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:02,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200939692] [2025-04-13 20:31:02,803 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:02,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:02,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:02,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:02,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:31:02,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:02,861 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:02,861 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:02,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:02,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:02,873 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-13 20:31:02,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:02,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:02,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200939692] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:03,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 18 [2025-04-13 20:31:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378914286] [2025-04-13 20:31:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:03,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:03,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:03,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:31:03,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:03,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 291 transitions, 3840 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:03,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:03,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:03,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:03,760 INFO L116 PetriNetUnfolderBase]: 2904/4326 cut-off events. [2025-04-13 20:31:03,760 INFO L117 PetriNetUnfolderBase]: For 41711/41711 co-relation queries the response was YES. [2025-04-13 20:31:03,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28192 conditions, 4326 events. 2904/4326 cut-off events. For 41711/41711 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 22504 event pairs, 305 based on Foata normal form. 1/4013 useless extension candidates. Maximal degree in co-relation 28103. Up to 3518 conditions per place. [2025-04-13 20:31:03,788 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 275 selfloop transitions, 147 changer transitions 3/425 dead transitions. [2025-04-13 20:31:03,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 425 transitions, 6102 flow [2025-04-13 20:31:03,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:03,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2025-04-13 20:31:03,789 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.415625 [2025-04-13 20:31:03,789 INFO L175 Difference]: Start difference. First operand has 167 places, 291 transitions, 3840 flow. Second operand 10 states and 133 transitions. [2025-04-13 20:31:03,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 425 transitions, 6102 flow [2025-04-13 20:31:03,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 425 transitions, 5720 flow, removed 154 selfloop flow, removed 5 redundant places. [2025-04-13 20:31:03,928 INFO L231 Difference]: Finished difference. Result has 176 places, 344 transitions, 4747 flow [2025-04-13 20:31:03,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3613, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4747, PETRI_PLACES=176, PETRI_TRANSITIONS=344} [2025-04-13 20:31:03,929 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2025-04-13 20:31:03,929 INFO L485 AbstractCegarLoop]: Abstraction has has 176 places, 344 transitions, 4747 flow [2025-04-13 20:31:03,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:03,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:03,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:03,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:31:04,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:04,131 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:04,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1118250388, now seen corresponding path program 3 times [2025-04-13 20:31:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:04,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746979907] [2025-04-13 20:31:04,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:04,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:04,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:04,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:31:04,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:04,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:04,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746979907] [2025-04-13 20:31:04,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746979907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:04,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:04,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:04,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43155750] [2025-04-13 20:31:04,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:04,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:04,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:04,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:04,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:04,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:04,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 344 transitions, 4747 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-13 20:31:04,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:04,876 INFO L116 PetriNetUnfolderBase]: 3153/4684 cut-off events. [2025-04-13 20:31:04,876 INFO L117 PetriNetUnfolderBase]: For 52373/52373 co-relation queries the response was YES. [2025-04-13 20:31:04,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31639 conditions, 4684 events. 3153/4684 cut-off events. For 52373/52373 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 24494 event pairs, 427 based on Foata normal form. 1/4336 useless extension candidates. Maximal degree in co-relation 31543. Up to 4264 conditions per place. [2025-04-13 20:31:04,910 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 350 selfloop transitions, 53 changer transitions 1/404 dead transitions. [2025-04-13 20:31:04,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 404 transitions, 6025 flow [2025-04-13 20:31:04,910 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-04-13 20:31:04,911 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.409375 [2025-04-13 20:31:04,911 INFO L175 Difference]: Start difference. First operand has 176 places, 344 transitions, 4747 flow. Second operand 10 states and 131 transitions. [2025-04-13 20:31:04,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 404 transitions, 6025 flow [2025-04-13 20:31:05,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 404 transitions, 5799 flow, removed 16 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:05,078 INFO L231 Difference]: Finished difference. Result has 186 places, 358 transitions, 4884 flow [2025-04-13 20:31:05,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4521, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4884, PETRI_PLACES=186, PETRI_TRANSITIONS=358} [2025-04-13 20:31:05,079 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 155 predicate places. [2025-04-13 20:31:05,079 INFO L485 AbstractCegarLoop]: Abstraction has has 186 places, 358 transitions, 4884 flow [2025-04-13 20:31:05,079 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-13 20:31:05,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:05,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:05,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:31:05,079 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:05,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:05,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2021146600, now seen corresponding path program 12 times [2025-04-13 20:31:05,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:05,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50835859] [2025-04-13 20:31:05,080 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:05,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:05,084 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:05,088 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:05,089 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:31:05,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:05,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50835859] [2025-04-13 20:31:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50835859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316797601] [2025-04-13 20:31:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:05,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:05,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:05,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:05,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:05,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 358 transitions, 4884 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-13 20:31:05,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:05,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:05,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:05,926 INFO L116 PetriNetUnfolderBase]: 3153/4683 cut-off events. [2025-04-13 20:31:05,926 INFO L117 PetriNetUnfolderBase]: For 55252/55252 co-relation queries the response was YES. [2025-04-13 20:31:05,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32432 conditions, 4683 events. 3153/4683 cut-off events. For 55252/55252 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 24449 event pairs, 463 based on Foata normal form. 1/4335 useless extension candidates. Maximal degree in co-relation 32331. Up to 4375 conditions per place. [2025-04-13 20:31:05,958 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 315 selfloop transitions, 83 changer transitions 4/402 dead transitions. [2025-04-13 20:31:05,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 402 transitions, 6025 flow [2025-04-13 20:31:05,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-13 20:31:05,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.371875 [2025-04-13 20:31:05,959 INFO L175 Difference]: Start difference. First operand has 186 places, 358 transitions, 4884 flow. Second operand 10 states and 119 transitions. [2025-04-13 20:31:05,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 402 transitions, 6025 flow [2025-04-13 20:31:06,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 402 transitions, 5780 flow, removed 96 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:06,167 INFO L231 Difference]: Finished difference. Result has 194 places, 367 transitions, 4973 flow [2025-04-13 20:31:06,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4643, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4973, PETRI_PLACES=194, PETRI_TRANSITIONS=367} [2025-04-13 20:31:06,167 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 163 predicate places. [2025-04-13 20:31:06,167 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 367 transitions, 4973 flow [2025-04-13 20:31:06,168 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-13 20:31:06,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:06,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:06,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 20:31:06,168 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:06,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:06,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1511219342, now seen corresponding path program 4 times [2025-04-13 20:31:06,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:06,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006680559] [2025-04-13 20:31:06,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:06,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:06,172 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:06,176 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:06,176 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:06,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:06,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:06,294 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006680559] [2025-04-13 20:31:06,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006680559] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:06,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:06,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:31:06,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989791624] [2025-04-13 20:31:06,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:06,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:06,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:06,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:06,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:31:06,295 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:06,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 367 transitions, 4973 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:06,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:06,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:06,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:06,887 INFO L116 PetriNetUnfolderBase]: 3345/4960 cut-off events. [2025-04-13 20:31:06,887 INFO L117 PetriNetUnfolderBase]: For 56460/56460 co-relation queries the response was YES. [2025-04-13 20:31:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33758 conditions, 4960 events. 3345/4960 cut-off events. For 56460/56460 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 26058 event pairs, 586 based on Foata normal form. 1/4561 useless extension candidates. Maximal degree in co-relation 33653. Up to 4584 conditions per place. [2025-04-13 20:31:06,928 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 357 selfloop transitions, 55 changer transitions 1/413 dead transitions. [2025-04-13 20:31:06,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 413 transitions, 6274 flow [2025-04-13 20:31:06,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:31:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:31:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2025-04-13 20:31:06,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41015625 [2025-04-13 20:31:06,929 INFO L175 Difference]: Start difference. First operand has 194 places, 367 transitions, 4973 flow. Second operand 8 states and 105 transitions. [2025-04-13 20:31:06,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 413 transitions, 6274 flow [2025-04-13 20:31:07,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 413 transitions, 6087 flow, removed 24 selfloop flow, removed 6 redundant places. [2025-04-13 20:31:07,139 INFO L231 Difference]: Finished difference. Result has 197 places, 379 transitions, 5195 flow [2025-04-13 20:31:07,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5195, PETRI_PLACES=197, PETRI_TRANSITIONS=379} [2025-04-13 20:31:07,140 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 166 predicate places. [2025-04-13 20:31:07,140 INFO L485 AbstractCegarLoop]: Abstraction has has 197 places, 379 transitions, 5195 flow [2025-04-13 20:31:07,140 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:07,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:07,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:07,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:31:07,141 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:07,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:07,141 INFO L85 PathProgramCache]: Analyzing trace with hash -567566828, now seen corresponding path program 13 times [2025-04-13 20:31:07,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:07,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471830782] [2025-04-13 20:31:07,141 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:07,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:07,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:07,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471830782] [2025-04-13 20:31:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471830782] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:07,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169374806] [2025-04-13 20:31:07,377 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:07,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:07,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:31:07,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:07,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:07,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:07,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:07,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:07,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:07,455 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-13 20:31:07,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:07,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:07,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:07,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169374806] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:07,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:07,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-13 20:31:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661761541] [2025-04-13 20:31:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:07,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:07,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:07,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:31:07,728 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:07,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 379 transitions, 5195 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:07,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:07,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:07,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:08,737 INFO L116 PetriNetUnfolderBase]: 4286/6345 cut-off events. [2025-04-13 20:31:08,738 INFO L117 PetriNetUnfolderBase]: For 84140/84140 co-relation queries the response was YES. [2025-04-13 20:31:08,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46017 conditions, 6345 events. 4286/6345 cut-off events. For 84140/84140 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 34956 event pairs, 537 based on Foata normal form. 1/5889 useless extension candidates. Maximal degree in co-relation 45910. Up to 4782 conditions per place. [2025-04-13 20:31:08,784 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 314 selfloop transitions, 378 changer transitions 1/693 dead transitions. [2025-04-13 20:31:08,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 693 transitions, 10828 flow [2025-04-13 20:31:08,785 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 170 transitions. [2025-04-13 20:31:08,785 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40865384615384615 [2025-04-13 20:31:08,785 INFO L175 Difference]: Start difference. First operand has 197 places, 379 transitions, 5195 flow. Second operand 13 states and 170 transitions. [2025-04-13 20:31:08,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 693 transitions, 10828 flow [2025-04-13 20:31:09,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 693 transitions, 10613 flow, removed 70 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:09,052 INFO L231 Difference]: Finished difference. Result has 215 places, 621 transitions, 9942 flow [2025-04-13 20:31:09,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=5068, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9942, PETRI_PLACES=215, PETRI_TRANSITIONS=621} [2025-04-13 20:31:09,052 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 184 predicate places. [2025-04-13 20:31:09,052 INFO L485 AbstractCegarLoop]: Abstraction has has 215 places, 621 transitions, 9942 flow [2025-04-13 20:31:09,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:09,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:09,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:09,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:09,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:31:09,253 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:09,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -258836658, now seen corresponding path program 5 times [2025-04-13 20:31:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:09,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914010267] [2025-04-13 20:31:09,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:09,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:09,259 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:09,263 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:09,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:09,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:09,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914010267] [2025-04-13 20:31:09,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914010267] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:09,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455326375] [2025-04-13 20:31:09,405 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:09,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:09,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:09,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:31:09,453 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:09,469 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:09,469 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:09,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:09,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 20:31:09,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:09,509 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:09,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:31:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455326375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:31:09,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 8 [2025-04-13 20:31:09,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672015844] [2025-04-13 20:31:09,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:09,515 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:31:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:09,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:31:09,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:09,516 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:09,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 621 transitions, 9942 flow. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:09,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:09,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:09,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:10,637 INFO L116 PetriNetUnfolderBase]: 4535/6703 cut-off events. [2025-04-13 20:31:10,637 INFO L117 PetriNetUnfolderBase]: For 108534/108534 co-relation queries the response was YES. [2025-04-13 20:31:10,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53942 conditions, 6703 events. 4535/6703 cut-off events. For 108534/108534 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 37146 event pairs, 710 based on Foata normal form. 1/6212 useless extension candidates. Maximal degree in co-relation 53825. Up to 6247 conditions per place. [2025-04-13 20:31:10,697 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 594 selfloop transitions, 68 changer transitions 1/663 dead transitions. [2025-04-13 20:31:10,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 663 transitions, 11713 flow [2025-04-13 20:31:10,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:31:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:31:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-04-13 20:31:10,698 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2025-04-13 20:31:10,698 INFO L175 Difference]: Start difference. First operand has 215 places, 621 transitions, 9942 flow. Second operand 7 states and 103 transitions. [2025-04-13 20:31:10,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 663 transitions, 11713 flow [2025-04-13 20:31:11,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 663 transitions, 11409 flow, removed 152 selfloop flow, removed 0 redundant places. [2025-04-13 20:31:11,306 INFO L231 Difference]: Finished difference. Result has 222 places, 627 transitions, 9936 flow [2025-04-13 20:31:11,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9640, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=9936, PETRI_PLACES=222, PETRI_TRANSITIONS=627} [2025-04-13 20:31:11,307 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2025-04-13 20:31:11,307 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 627 transitions, 9936 flow [2025-04-13 20:31:11,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:11,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:11,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:11,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:11,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 20:31:11,511 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:11,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:11,511 INFO L85 PathProgramCache]: Analyzing trace with hash 540203346, now seen corresponding path program 6 times [2025-04-13 20:31:11,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:11,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615443151] [2025-04-13 20:31:11,511 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:11,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:11,515 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:11,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:11,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:31:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:11,645 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615443151] [2025-04-13 20:31:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615443151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:11,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:11,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214420028] [2025-04-13 20:31:11,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:11,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:11,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:11,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:11,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:11,646 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:11,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 627 transitions, 9936 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-13 20:31:11,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:11,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:12,900 INFO L116 PetriNetUnfolderBase]: 4856/7163 cut-off events. [2025-04-13 20:31:12,900 INFO L117 PetriNetUnfolderBase]: For 118487/118487 co-relation queries the response was YES. [2025-04-13 20:31:12,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57152 conditions, 7163 events. 4856/7163 cut-off events. For 118487/118487 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 40144 event pairs, 541 based on Foata normal form. 1/6627 useless extension candidates. Maximal degree in co-relation 57032. Up to 6053 conditions per place. [2025-04-13 20:31:12,961 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 595 selfloop transitions, 117 changer transitions 1/713 dead transitions. [2025-04-13 20:31:12,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 713 transitions, 12340 flow [2025-04-13 20:31:12,961 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 163 transitions. [2025-04-13 20:31:12,962 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3918269230769231 [2025-04-13 20:31:12,962 INFO L175 Difference]: Start difference. First operand has 222 places, 627 transitions, 9936 flow. Second operand 13 states and 163 transitions. [2025-04-13 20:31:12,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 713 transitions, 12340 flow [2025-04-13 20:31:13,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 713 transitions, 12076 flow, removed 95 selfloop flow, removed 3 redundant places. [2025-04-13 20:31:13,562 INFO L231 Difference]: Finished difference. Result has 235 places, 656 transitions, 10567 flow [2025-04-13 20:31:13,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9744, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10567, PETRI_PLACES=235, PETRI_TRANSITIONS=656} [2025-04-13 20:31:13,563 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2025-04-13 20:31:13,563 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 656 transitions, 10567 flow [2025-04-13 20:31:13,563 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-13 20:31:13,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:13,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:13,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:31:13,564 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:13,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 350080846, now seen corresponding path program 7 times [2025-04-13 20:31:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:13,564 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320668005] [2025-04-13 20:31:13,564 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:13,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:13,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:13,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:13,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:13,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:13,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320668005] [2025-04-13 20:31:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320668005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:31:13,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113287458] [2025-04-13 20:31:13,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:13,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:31:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:31:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:31:13,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:13,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 656 transitions, 10567 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:13,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:13,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:13,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:15,131 INFO L116 PetriNetUnfolderBase]: 4967/7335 cut-off events. [2025-04-13 20:31:15,132 INFO L117 PetriNetUnfolderBase]: For 129331/129331 co-relation queries the response was YES. [2025-04-13 20:31:15,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60381 conditions, 7335 events. 4967/7335 cut-off events. For 129331/129331 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 41060 event pairs, 761 based on Foata normal form. 1/6780 useless extension candidates. Maximal degree in co-relation 60255. Up to 6574 conditions per place. [2025-04-13 20:31:15,218 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 579 selfloop transitions, 133 changer transitions 1/713 dead transitions. [2025-04-13 20:31:15,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 713 transitions, 12613 flow [2025-04-13 20:31:15,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:31:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:31:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2025-04-13 20:31:15,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 20:31:15,219 INFO L175 Difference]: Start difference. First operand has 235 places, 656 transitions, 10567 flow. Second operand 9 states and 117 transitions. [2025-04-13 20:31:15,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 713 transitions, 12613 flow [2025-04-13 20:31:15,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 713 transitions, 12113 flow, removed 165 selfloop flow, removed 8 redundant places. [2025-04-13 20:31:15,890 INFO L231 Difference]: Finished difference. Result has 237 places, 667 transitions, 10642 flow [2025-04-13 20:31:15,891 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10077, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10642, PETRI_PLACES=237, PETRI_TRANSITIONS=667} [2025-04-13 20:31:15,891 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2025-04-13 20:31:15,891 INFO L485 AbstractCegarLoop]: Abstraction has has 237 places, 667 transitions, 10642 flow [2025-04-13 20:31:15,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:15,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:15,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:15,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:31:15,891 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:15,892 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash 375076852, now seen corresponding path program 14 times [2025-04-13 20:31:15,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:15,892 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153345111] [2025-04-13 20:31:15,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:15,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:15,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:15,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:15,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:31:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:16,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153345111] [2025-04-13 20:31:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153345111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:16,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295129899] [2025-04-13 20:31:16,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:16,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:16,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:16,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:16,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:16,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 667 transitions, 10642 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-13 20:31:16,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:16,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:16,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:17,262 INFO L116 PetriNetUnfolderBase]: 5017/7422 cut-off events. [2025-04-13 20:31:17,262 INFO L117 PetriNetUnfolderBase]: For 112395/112395 co-relation queries the response was YES. [2025-04-13 20:31:17,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59561 conditions, 7422 events. 5017/7422 cut-off events. For 112395/112395 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 41743 event pairs, 764 based on Foata normal form. 1/6811 useless extension candidates. Maximal degree in co-relation 59435. Up to 7188 conditions per place. [2025-04-13 20:31:17,330 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 632 selfloop transitions, 70 changer transitions 1/703 dead transitions. [2025-04-13 20:31:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 703 transitions, 12461 flow [2025-04-13 20:31:17,330 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2025-04-13 20:31:17,331 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.325 [2025-04-13 20:31:17,331 INFO L175 Difference]: Start difference. First operand has 237 places, 667 transitions, 10642 flow. Second operand 10 states and 104 transitions. [2025-04-13 20:31:17,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 703 transitions, 12461 flow [2025-04-13 20:31:17,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 703 transitions, 12091 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-04-13 20:31:17,905 INFO L231 Difference]: Finished difference. Result has 244 places, 679 transitions, 10702 flow [2025-04-13 20:31:17,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10282, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10702, PETRI_PLACES=244, PETRI_TRANSITIONS=679} [2025-04-13 20:31:17,906 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2025-04-13 20:31:17,906 INFO L485 AbstractCegarLoop]: Abstraction has has 244 places, 679 transitions, 10702 flow [2025-04-13 20:31:17,906 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-13 20:31:17,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:17,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:17,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 20:31:17,906 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:17,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:17,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1254614154, now seen corresponding path program 15 times [2025-04-13 20:31:17,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:17,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711862660] [2025-04-13 20:31:17,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:17,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:17,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:17,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:17,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:31:17,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:18,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711862660] [2025-04-13 20:31:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711862660] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:18,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:18,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:18,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430622251] [2025-04-13 20:31:18,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:18,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:18,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:18,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:18,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:18,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 679 transitions, 10702 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-13 20:31:18,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:18,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:18,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:19,277 INFO L116 PetriNetUnfolderBase]: 5075/7527 cut-off events. [2025-04-13 20:31:19,277 INFO L117 PetriNetUnfolderBase]: For 107156/107156 co-relation queries the response was YES. [2025-04-13 20:31:19,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58876 conditions, 7527 events. 5075/7527 cut-off events. For 107156/107156 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 42680 event pairs, 789 based on Foata normal form. 1/6904 useless extension candidates. Maximal degree in co-relation 58746. Up to 7267 conditions per place. [2025-04-13 20:31:19,344 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 643 selfloop transitions, 85 changer transitions 3/731 dead transitions. [2025-04-13 20:31:19,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 731 transitions, 12662 flow [2025-04-13 20:31:19,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:31:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:31:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2025-04-13 20:31:19,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3229166666666667 [2025-04-13 20:31:19,345 INFO L175 Difference]: Start difference. First operand has 244 places, 679 transitions, 10702 flow. Second operand 12 states and 124 transitions. [2025-04-13 20:31:19,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 731 transitions, 12662 flow [2025-04-13 20:31:19,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 731 transitions, 12512 flow, removed 26 selfloop flow, removed 3 redundant places. [2025-04-13 20:31:19,933 INFO L231 Difference]: Finished difference. Result has 255 places, 693 transitions, 11005 flow [2025-04-13 20:31:19,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10552, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11005, PETRI_PLACES=255, PETRI_TRANSITIONS=693} [2025-04-13 20:31:19,934 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2025-04-13 20:31:19,934 INFO L485 AbstractCegarLoop]: Abstraction has has 255 places, 693 transitions, 11005 flow [2025-04-13 20:31:19,934 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-13 20:31:19,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:19,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:19,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 20:31:19,934 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:19,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1601109538, now seen corresponding path program 16 times [2025-04-13 20:31:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:19,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200471357] [2025-04-13 20:31:19,935 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:19,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:19,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:19,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:19,942 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:19,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:20,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:20,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200471357] [2025-04-13 20:31:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200471357] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:20,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:31:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760803744] [2025-04-13 20:31:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:20,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:31:20,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:31:20,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:31:20,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:20,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 693 transitions, 11005 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:20,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:20,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:20,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:21,279 INFO L116 PetriNetUnfolderBase]: 5117/7593 cut-off events. [2025-04-13 20:31:21,279 INFO L117 PetriNetUnfolderBase]: For 111931/111931 co-relation queries the response was YES. [2025-04-13 20:31:21,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60013 conditions, 7593 events. 5117/7593 cut-off events. For 111931/111931 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 43149 event pairs, 816 based on Foata normal form. 1/6958 useless extension candidates. Maximal degree in co-relation 59880. Up to 7362 conditions per place. [2025-04-13 20:31:21,354 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 646 selfloop transitions, 75 changer transitions 1/722 dead transitions. [2025-04-13 20:31:21,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 722 transitions, 12796 flow [2025-04-13 20:31:21,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:31:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:31:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2025-04-13 20:31:21,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2025-04-13 20:31:21,355 INFO L175 Difference]: Start difference. First operand has 255 places, 693 transitions, 11005 flow. Second operand 9 states and 98 transitions. [2025-04-13 20:31:21,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 722 transitions, 12796 flow [2025-04-13 20:31:21,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 722 transitions, 12489 flow, removed 77 selfloop flow, removed 7 redundant places. [2025-04-13 20:31:21,934 INFO L231 Difference]: Finished difference. Result has 259 places, 701 transitions, 11065 flow [2025-04-13 20:31:21,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10698, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11065, PETRI_PLACES=259, PETRI_TRANSITIONS=701} [2025-04-13 20:31:21,934 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 228 predicate places. [2025-04-13 20:31:21,935 INFO L485 AbstractCegarLoop]: Abstraction has has 259 places, 701 transitions, 11065 flow [2025-04-13 20:31:21,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:21,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:21,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:21,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 20:31:21,935 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:21,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:21,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1887906722, now seen corresponding path program 17 times [2025-04-13 20:31:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:21,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629276173] [2025-04-13 20:31:21,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:21,939 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:21,947 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:21,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:21,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:22,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:22,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629276173] [2025-04-13 20:31:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629276173] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:22,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070596239] [2025-04-13 20:31:22,170 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:22,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:22,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:22,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:22,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:31:22,219 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:22,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:22,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:22,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:22,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:22,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:22,254 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-13 20:31:22,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:22,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:22,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070596239] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 19 [2025-04-13 20:31:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715329173] [2025-04-13 20:31:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:22,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:22,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:22,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:31:22,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:22,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 701 transitions, 11065 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:22,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:22,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:22,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:23,705 INFO L116 PetriNetUnfolderBase]: 5144/7651 cut-off events. [2025-04-13 20:31:23,705 INFO L117 PetriNetUnfolderBase]: For 116877/116877 co-relation queries the response was YES. [2025-04-13 20:31:23,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61095 conditions, 7651 events. 5144/7651 cut-off events. For 116877/116877 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 43786 event pairs, 778 based on Foata normal form. 1/7010 useless extension candidates. Maximal degree in co-relation 60960. Up to 6591 conditions per place. [2025-04-13 20:31:23,779 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 548 selfloop transitions, 206 changer transitions 1/755 dead transitions. [2025-04-13 20:31:23,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 755 transitions, 13230 flow [2025-04-13 20:31:23,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:31:23,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:31:23,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2025-04-13 20:31:23,780 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2025-04-13 20:31:23,780 INFO L175 Difference]: Start difference. First operand has 259 places, 701 transitions, 11065 flow. Second operand 9 states and 114 transitions. [2025-04-13 20:31:23,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 755 transitions, 13230 flow [2025-04-13 20:31:24,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 755 transitions, 13009 flow, removed 76 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:24,429 INFO L231 Difference]: Finished difference. Result has 265 places, 709 transitions, 11482 flow [2025-04-13 20:31:24,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=10844, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=499, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11482, PETRI_PLACES=265, PETRI_TRANSITIONS=709} [2025-04-13 20:31:24,429 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2025-04-13 20:31:24,429 INFO L485 AbstractCegarLoop]: Abstraction has has 265 places, 709 transitions, 11482 flow [2025-04-13 20:31:24,430 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:24,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:24,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:24,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:31:24,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:24,634 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:24,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1323793374, now seen corresponding path program 18 times [2025-04-13 20:31:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:24,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808495117] [2025-04-13 20:31:24,635 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:24,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:24,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:24,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:24,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:31:24,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:24,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:24,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808495117] [2025-04-13 20:31:24,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808495117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:24,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:31:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184463499] [2025-04-13 20:31:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:24,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:31:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:24,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:31:24,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:31:24,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:24,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 709 transitions, 11482 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:24,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:24,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:24,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:26,035 INFO L116 PetriNetUnfolderBase]: 5160/7691 cut-off events. [2025-04-13 20:31:26,035 INFO L117 PetriNetUnfolderBase]: For 123372/123372 co-relation queries the response was YES. [2025-04-13 20:31:26,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62391 conditions, 7691 events. 5160/7691 cut-off events. For 123372/123372 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 44211 event pairs, 794 based on Foata normal form. 1/7050 useless extension candidates. Maximal degree in co-relation 62252. Up to 7392 conditions per place. [2025-04-13 20:31:26,112 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 658 selfloop transitions, 94 changer transitions 3/755 dead transitions. [2025-04-13 20:31:26,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 755 transitions, 13456 flow [2025-04-13 20:31:26,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 130 transitions. [2025-04-13 20:31:26,113 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:31:26,113 INFO L175 Difference]: Start difference. First operand has 265 places, 709 transitions, 11482 flow. Second operand 13 states and 130 transitions. [2025-04-13 20:31:26,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 755 transitions, 13456 flow [2025-04-13 20:31:26,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 755 transitions, 13110 flow, removed 74 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:26,776 INFO L231 Difference]: Finished difference. Result has 276 places, 716 transitions, 11545 flow [2025-04-13 20:31:26,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11162, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=11545, PETRI_PLACES=276, PETRI_TRANSITIONS=716} [2025-04-13 20:31:26,776 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2025-04-13 20:31:26,776 INFO L485 AbstractCegarLoop]: Abstraction has has 276 places, 716 transitions, 11545 flow [2025-04-13 20:31:26,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:26,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:26,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:26,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 20:31:26,777 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:26,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -193524238, now seen corresponding path program 19 times [2025-04-13 20:31:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:26,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105870869] [2025-04-13 20:31:26,777 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:26,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:26,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:26,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:26,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:26,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:26,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105870869] [2025-04-13 20:31:26,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105870869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:26,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149900649] [2025-04-13 20:31:26,982 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:26,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:26,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:26,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:31:26,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:31:27,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:27,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:27,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:27,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:27,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:27,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:27,054 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-13 20:31:27,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:27,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:27,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:27,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149900649] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:27,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:27,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-13 20:31:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312378772] [2025-04-13 20:31:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:27,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:27,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:27,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:31:27,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:27,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 716 transitions, 11545 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:27,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:27,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:27,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:28,679 INFO L116 PetriNetUnfolderBase]: 5192/7743 cut-off events. [2025-04-13 20:31:28,679 INFO L117 PetriNetUnfolderBase]: For 123621/123621 co-relation queries the response was YES. [2025-04-13 20:31:28,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63099 conditions, 7743 events. 5192/7743 cut-off events. For 123621/123621 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 44621 event pairs, 732 based on Foata normal form. 1/7094 useless extension candidates. Maximal degree in co-relation 62955. Up to 6730 conditions per place. [2025-04-13 20:31:28,768 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 510 selfloop transitions, 272 changer transitions 1/783 dead transitions. [2025-04-13 20:31:28,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 783 transitions, 13844 flow [2025-04-13 20:31:28,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:31:28,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:31:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 148 transitions. [2025-04-13 20:31:28,769 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-04-13 20:31:28,769 INFO L175 Difference]: Start difference. First operand has 276 places, 716 transitions, 11545 flow. Second operand 11 states and 148 transitions. [2025-04-13 20:31:28,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 783 transitions, 13844 flow [2025-04-13 20:31:29,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 783 transitions, 13635 flow, removed 50 selfloop flow, removed 9 redundant places. [2025-04-13 20:31:29,569 INFO L231 Difference]: Finished difference. Result has 283 places, 740 transitions, 12582 flow [2025-04-13 20:31:29,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11340, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=12582, PETRI_PLACES=283, PETRI_TRANSITIONS=740} [2025-04-13 20:31:29,569 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 252 predicate places. [2025-04-13 20:31:29,569 INFO L485 AbstractCegarLoop]: Abstraction has has 283 places, 740 transitions, 12582 flow [2025-04-13 20:31:29,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:29,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:29,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:29,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:31:29,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:29,770 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:29,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash -416380560, now seen corresponding path program 20 times [2025-04-13 20:31:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:29,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479926038] [2025-04-13 20:31:29,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:29,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:29,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:29,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:29,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:31:29,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:29,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:29,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479926038] [2025-04-13 20:31:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479926038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:29,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:29,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935107187] [2025-04-13 20:31:29,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:29,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:29,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:29,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:29,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:29,946 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:29,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 740 transitions, 12582 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-13 20:31:29,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:29,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:29,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:31,542 INFO L116 PetriNetUnfolderBase]: 5401/8053 cut-off events. [2025-04-13 20:31:31,542 INFO L117 PetriNetUnfolderBase]: For 147987/147987 co-relation queries the response was YES. [2025-04-13 20:31:31,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68861 conditions, 8053 events. 5401/8053 cut-off events. For 147987/147987 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 46622 event pairs, 817 based on Foata normal form. 1/7370 useless extension candidates. Maximal degree in co-relation 68710. Up to 6601 conditions per place. [2025-04-13 20:31:31,610 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 545 selfloop transitions, 278 changer transitions 1/824 dead transitions. [2025-04-13 20:31:31,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 824 transitions, 15696 flow [2025-04-13 20:31:31,611 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:31:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:31:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2025-04-13 20:31:31,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3723958333333333 [2025-04-13 20:31:31,611 INFO L175 Difference]: Start difference. First operand has 283 places, 740 transitions, 12582 flow. Second operand 12 states and 143 transitions. [2025-04-13 20:31:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 824 transitions, 15696 flow [2025-04-13 20:31:32,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 824 transitions, 15601 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:32,419 INFO L231 Difference]: Finished difference. Result has 299 places, 783 transitions, 14595 flow [2025-04-13 20:31:32,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=12489, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=14595, PETRI_PLACES=299, PETRI_TRANSITIONS=783} [2025-04-13 20:31:32,419 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 268 predicate places. [2025-04-13 20:31:32,420 INFO L485 AbstractCegarLoop]: Abstraction has has 299 places, 783 transitions, 14595 flow [2025-04-13 20:31:32,420 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-13 20:31:32,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:32,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:32,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 20:31:32,420 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:32,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1695136194, now seen corresponding path program 21 times [2025-04-13 20:31:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:32,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411524007] [2025-04-13 20:31:32,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:32,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:32,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:32,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:31:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:32,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:32,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:32,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411524007] [2025-04-13 20:31:32,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411524007] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:32,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:32,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051026263] [2025-04-13 20:31:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:32,581 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:32,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:32,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:32,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:32,581 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:32,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 783 transitions, 14595 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-13 20:31:32,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:32,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:32,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:34,184 INFO L116 PetriNetUnfolderBase]: 5609/8352 cut-off events. [2025-04-13 20:31:34,184 INFO L117 PetriNetUnfolderBase]: For 179727/179727 co-relation queries the response was YES. [2025-04-13 20:31:34,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75150 conditions, 8352 events. 5609/8352 cut-off events. For 179727/179727 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 48628 event pairs, 874 based on Foata normal form. 1/7639 useless extension candidates. Maximal degree in co-relation 74990. Up to 7918 conditions per place. [2025-04-13 20:31:34,272 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 696 selfloop transitions, 167 changer transitions 3/866 dead transitions. [2025-04-13 20:31:34,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 866 transitions, 17826 flow [2025-04-13 20:31:34,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:31:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:31:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2025-04-13 20:31:34,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3489583333333333 [2025-04-13 20:31:34,273 INFO L175 Difference]: Start difference. First operand has 299 places, 783 transitions, 14595 flow. Second operand 12 states and 134 transitions. [2025-04-13 20:31:34,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 866 transitions, 17826 flow [2025-04-13 20:31:35,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 866 transitions, 17612 flow, removed 106 selfloop flow, removed 1 redundant places. [2025-04-13 20:31:35,585 INFO L231 Difference]: Finished difference. Result has 313 places, 825 transitions, 15944 flow [2025-04-13 20:31:35,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=14381, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=15944, PETRI_PLACES=313, PETRI_TRANSITIONS=825} [2025-04-13 20:31:35,587 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 282 predicate places. [2025-04-13 20:31:35,587 INFO L485 AbstractCegarLoop]: Abstraction has has 313 places, 825 transitions, 15944 flow [2025-04-13 20:31:35,587 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-13 20:31:35,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:35,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:35,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 20:31:35,587 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:35,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:35,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1256326998, now seen corresponding path program 22 times [2025-04-13 20:31:35,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:35,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903234169] [2025-04-13 20:31:35,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:31:35,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:35,594 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:35,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:35,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:31:35,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:35,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903234169] [2025-04-13 20:31:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903234169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:35,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:35,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:35,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542576317] [2025-04-13 20:31:35,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:35,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:35,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:35,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:35,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:35,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:35,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 825 transitions, 15944 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-13 20:31:35,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:35,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:35,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:37,811 INFO L116 PetriNetUnfolderBase]: 5825/8672 cut-off events. [2025-04-13 20:31:37,811 INFO L117 PetriNetUnfolderBase]: For 205772/205772 co-relation queries the response was YES. [2025-04-13 20:31:37,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81144 conditions, 8672 events. 5825/8672 cut-off events. For 205772/205772 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 50727 event pairs, 832 based on Foata normal form. 1/7927 useless extension candidates. Maximal degree in co-relation 80978. Up to 8117 conditions per place. [2025-04-13 20:31:37,906 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 734 selfloop transitions, 182 changer transitions 1/917 dead transitions. [2025-04-13 20:31:37,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 917 transitions, 19826 flow [2025-04-13 20:31:37,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:31:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:31:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 149 transitions. [2025-04-13 20:31:37,907 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3104166666666667 [2025-04-13 20:31:37,907 INFO L175 Difference]: Start difference. First operand has 313 places, 825 transitions, 15944 flow. Second operand 15 states and 149 transitions. [2025-04-13 20:31:37,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 917 transitions, 19826 flow [2025-04-13 20:31:39,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 917 transitions, 19012 flow, removed 321 selfloop flow, removed 5 redundant places. [2025-04-13 20:31:39,152 INFO L231 Difference]: Finished difference. Result has 327 places, 884 transitions, 17434 flow [2025-04-13 20:31:39,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=15250, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=17434, PETRI_PLACES=327, PETRI_TRANSITIONS=884} [2025-04-13 20:31:39,153 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 296 predicate places. [2025-04-13 20:31:39,153 INFO L485 AbstractCegarLoop]: Abstraction has has 327 places, 884 transitions, 17434 flow [2025-04-13 20:31:39,153 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-13 20:31:39,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:39,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:39,153 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 20:31:39,153 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:39,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -852169966, now seen corresponding path program 23 times [2025-04-13 20:31:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:39,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111594870] [2025-04-13 20:31:39,154 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:39,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:39,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:39,161 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:39,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:39,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111594870] [2025-04-13 20:31:39,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111594870] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:39,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903942749] [2025-04-13 20:31:39,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:31:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:39,398 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-13 20:31:39,399 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-13 20:31:39,446 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:39,461 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:39,461 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:31:39,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:39,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:39,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:39,483 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-13 20:31:39,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:31:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:39,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:39,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903942749] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:39,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:39,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 20 [2025-04-13 20:31:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792668284] [2025-04-13 20:31:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:39,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:39,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:39,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:39,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:31:39,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:39,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 884 transitions, 17434 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:39,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:39,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:39,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:41,799 INFO L116 PetriNetUnfolderBase]: 5875/8757 cut-off events. [2025-04-13 20:31:41,799 INFO L117 PetriNetUnfolderBase]: For 202829/202829 co-relation queries the response was YES. [2025-04-13 20:31:41,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82360 conditions, 8757 events. 5875/8757 cut-off events. For 202829/202829 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 51495 event pairs, 751 based on Foata normal form. 1/7956 useless extension candidates. Maximal degree in co-relation 82188. Up to 7629 conditions per place. [2025-04-13 20:31:41,882 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 634 selfloop transitions, 292 changer transitions 1/927 dead transitions. [2025-04-13 20:31:41,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 927 transitions, 19840 flow [2025-04-13 20:31:41,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:41,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2025-04-13 20:31:41,882 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.396875 [2025-04-13 20:31:41,883 INFO L175 Difference]: Start difference. First operand has 327 places, 884 transitions, 17434 flow. Second operand 10 states and 127 transitions. [2025-04-13 20:31:41,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 927 transitions, 19840 flow [2025-04-13 20:31:43,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 927 transitions, 19026 flow, removed 406 selfloop flow, removed 1 redundant places. [2025-04-13 20:31:43,167 INFO L231 Difference]: Finished difference. Result has 337 places, 890 transitions, 17425 flow [2025-04-13 20:31:43,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=16668, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=286, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17425, PETRI_PLACES=337, PETRI_TRANSITIONS=890} [2025-04-13 20:31:43,168 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 306 predicate places. [2025-04-13 20:31:43,168 INFO L485 AbstractCegarLoop]: Abstraction has has 337 places, 890 transitions, 17425 flow [2025-04-13 20:31:43,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:43,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:43,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:43,174 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-13 20:31:43,369 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,SelfDestructingSolverStorable39 [2025-04-13 20:31:43,369 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:43,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 882186918, now seen corresponding path program 24 times [2025-04-13 20:31:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:43,370 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757673904] [2025-04-13 20:31:43,370 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:31:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:43,373 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:43,376 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:43,376 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:31:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:43,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:43,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757673904] [2025-04-13 20:31:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757673904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:31:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016936078] [2025-04-13 20:31:43,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:43,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:31:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:43,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:31:43,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:31:43,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:43,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 890 transitions, 17425 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-13 20:31:43,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:43,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:43,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:45,621 INFO L116 PetriNetUnfolderBase]: 5875/8756 cut-off events. [2025-04-13 20:31:45,621 INFO L117 PetriNetUnfolderBase]: For 195408/195408 co-relation queries the response was YES. [2025-04-13 20:31:45,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81117 conditions, 8756 events. 5875/8756 cut-off events. For 195408/195408 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 51469 event pairs, 823 based on Foata normal form. 1/7955 useless extension candidates. Maximal degree in co-relation 80940. Up to 8520 conditions per place. [2025-04-13 20:31:45,701 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 826 selfloop transitions, 88 changer transitions 1/915 dead transitions. [2025-04-13 20:31:45,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 915 transitions, 19530 flow [2025-04-13 20:31:45,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:31:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:31:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-04-13 20:31:45,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.321875 [2025-04-13 20:31:45,702 INFO L175 Difference]: Start difference. First operand has 337 places, 890 transitions, 17425 flow. Second operand 10 states and 103 transitions. [2025-04-13 20:31:45,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 915 transitions, 19530 flow [2025-04-13 20:31:46,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 915 transitions, 19154 flow, removed 48 selfloop flow, removed 4 redundant places. [2025-04-13 20:31:46,861 INFO L231 Difference]: Finished difference. Result has 344 places, 894 transitions, 17351 flow [2025-04-13 20:31:46,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=17065, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=802, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17351, PETRI_PLACES=344, PETRI_TRANSITIONS=894} [2025-04-13 20:31:46,862 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 313 predicate places. [2025-04-13 20:31:46,862 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 894 transitions, 17351 flow [2025-04-13 20:31:46,862 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-13 20:31:46,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:46,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:46,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 20:31:46,862 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:46,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:46,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1233730450, now seen corresponding path program 25 times [2025-04-13 20:31:46,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:46,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008152573] [2025-04-13 20:31:46,863 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:46,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:46,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:46,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:46,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:46,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:47,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:47,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008152573] [2025-04-13 20:31:47,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008152573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:47,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519682081] [2025-04-13 20:31:47,029 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:31:47,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:47,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:31:47,031 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-13 20:31:47,032 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-13 20:31:47,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:31:47,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:31:47,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:31:47,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:47,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:31:47,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:31:47,101 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-13 20:31:47,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:31:47,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-13 20:31:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:31:47,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:31:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519682081] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:31:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:31:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-13 20:31:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905219131] [2025-04-13 20:31:47,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:47,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:31:47,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:47,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:31:47,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:31:47,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:47,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 894 transitions, 17351 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:47,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:47,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:47,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:49,919 INFO L116 PetriNetUnfolderBase]: 6276/9349 cut-off events. [2025-04-13 20:31:49,919 INFO L117 PetriNetUnfolderBase]: For 227303/227303 co-relation queries the response was YES. [2025-04-13 20:31:49,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87695 conditions, 9349 events. 6276/9349 cut-off events. For 227303/227303 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 55687 event pairs, 728 based on Foata normal form. 1/8490 useless extension candidates. Maximal degree in co-relation 87515. Up to 6448 conditions per place. [2025-04-13 20:31:50,009 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 440 selfloop transitions, 621 changer transitions 1/1062 dead transitions. [2025-04-13 20:31:50,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 1062 transitions, 22208 flow [2025-04-13 20:31:50,009 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:31:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:31:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 182 transitions. [2025-04-13 20:31:50,010 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40625 [2025-04-13 20:31:50,010 INFO L175 Difference]: Start difference. First operand has 344 places, 894 transitions, 17351 flow. Second operand 14 states and 182 transitions. [2025-04-13 20:31:50,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 1062 transitions, 22208 flow [2025-04-13 20:31:51,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1062 transitions, 21979 flow, removed 26 selfloop flow, removed 7 redundant places. [2025-04-13 20:31:51,258 INFO L231 Difference]: Finished difference. Result has 358 places, 1003 transitions, 21418 flow [2025-04-13 20:31:51,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=17122, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=531, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=21418, PETRI_PLACES=358, PETRI_TRANSITIONS=1003} [2025-04-13 20:31:51,259 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 327 predicate places. [2025-04-13 20:31:51,259 INFO L485 AbstractCegarLoop]: Abstraction has has 358 places, 1003 transitions, 21418 flow [2025-04-13 20:31:51,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:51,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:51,259 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:51,265 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-13 20:31:51,460 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:31:51,460 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:51,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash 300276454, now seen corresponding path program 26 times [2025-04-13 20:31:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:51,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229060789] [2025-04-13 20:31:51,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:31:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:51,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:51,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:51,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:31:51,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:51,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:51,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:51,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229060789] [2025-04-13 20:31:51,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229060789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:51,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:51,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:31:51,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388557223] [2025-04-13 20:31:51,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:51,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:31:51,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:51,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:31:51,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:31:51,601 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:51,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 1003 transitions, 21418 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:51,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:51,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:51,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:53,961 INFO L116 PetriNetUnfolderBase]: 6367/9519 cut-off events. [2025-04-13 20:31:53,961 INFO L117 PetriNetUnfolderBase]: For 268867/268867 co-relation queries the response was YES. [2025-04-13 20:31:54,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96527 conditions, 9519 events. 6367/9519 cut-off events. For 268867/268867 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 57100 event pairs, 873 based on Foata normal form. 2/8637 useless extension candidates. Maximal degree in co-relation 96339. Up to 9082 conditions per place. [2025-04-13 20:31:54,107 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 941 selfloop transitions, 130 changer transitions 4/1075 dead transitions. [2025-04-13 20:31:54,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 1075 transitions, 24735 flow [2025-04-13 20:31:54,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:31:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:31:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2025-04-13 20:31:54,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29375 [2025-04-13 20:31:54,108 INFO L175 Difference]: Start difference. First operand has 358 places, 1003 transitions, 21418 flow. Second operand 15 states and 141 transitions. [2025-04-13 20:31:54,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 1075 transitions, 24735 flow [2025-04-13 20:31:56,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 1075 transitions, 23840 flow, removed 408 selfloop flow, removed 2 redundant places. [2025-04-13 20:31:56,505 INFO L231 Difference]: Finished difference. Result has 374 places, 1038 transitions, 21762 flow [2025-04-13 20:31:56,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20697, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=880, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=21762, PETRI_PLACES=374, PETRI_TRANSITIONS=1038} [2025-04-13 20:31:56,506 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 343 predicate places. [2025-04-13 20:31:56,506 INFO L485 AbstractCegarLoop]: Abstraction has has 374 places, 1038 transitions, 21762 flow [2025-04-13 20:31:56,506 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:56,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:31:56,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:31:56,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 20:31:56,506 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:31:56,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:31:56,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2113348650, now seen corresponding path program 27 times [2025-04-13 20:31:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:31:56,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380600266] [2025-04-13 20:31:56,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:31:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:31:56,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:31:56,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:31:56,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:31:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:31:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:31:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:31:56,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380600266] [2025-04-13 20:31:56,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380600266] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:31:56,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:31:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:31:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015855350] [2025-04-13 20:31:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:31:56,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:31:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:31:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:31:56,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:31:56,681 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:31:56,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 1038 transitions, 21762 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:31:56,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:31:56,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:31:56,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:31:59,028 INFO L116 PetriNetUnfolderBase]: 6421/9634 cut-off events. [2025-04-13 20:31:59,029 INFO L117 PetriNetUnfolderBase]: For 251117/251117 co-relation queries the response was YES. [2025-04-13 20:31:59,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95597 conditions, 9634 events. 6421/9634 cut-off events. For 251117/251117 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 58329 event pairs, 925 based on Foata normal form. 2/8746 useless extension candidates. Maximal degree in co-relation 95402. Up to 9179 conditions per place. [2025-04-13 20:31:59,157 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 903 selfloop transitions, 205 changer transitions 4/1112 dead transitions. [2025-04-13 20:31:59,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1112 transitions, 25073 flow [2025-04-13 20:31:59,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:31:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:31:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2025-04-13 20:31:59,158 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3269230769230769 [2025-04-13 20:31:59,158 INFO L175 Difference]: Start difference. First operand has 374 places, 1038 transitions, 21762 flow. Second operand 13 states and 136 transitions. [2025-04-13 20:31:59,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1112 transitions, 25073 flow [2025-04-13 20:32:01,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 1112 transitions, 24590 flow, removed 187 selfloop flow, removed 5 redundant places. [2025-04-13 20:32:01,452 INFO L231 Difference]: Finished difference. Result has 386 places, 1075 transitions, 22610 flow [2025-04-13 20:32:01,453 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21279, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=848, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=22610, PETRI_PLACES=386, PETRI_TRANSITIONS=1075} [2025-04-13 20:32:01,454 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 355 predicate places. [2025-04-13 20:32:01,454 INFO L485 AbstractCegarLoop]: Abstraction has has 386 places, 1075 transitions, 22610 flow [2025-04-13 20:32:01,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:01,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:01,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:01,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 20:32:01,454 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:01,455 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1639724934, now seen corresponding path program 28 times [2025-04-13 20:32:01,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:01,455 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187389465] [2025-04-13 20:32:01,455 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:32:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:01,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:32:01,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:01,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:32:01,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:01,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187389465] [2025-04-13 20:32:01,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187389465] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:01,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:01,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:32:01,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256703026] [2025-04-13 20:32:01,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:01,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:32:01,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:01,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:32:01,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:32:01,613 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:01,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 1075 transitions, 22610 flow. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:01,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:01,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:01,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:04,103 INFO L116 PetriNetUnfolderBase]: 6637/9981 cut-off events. [2025-04-13 20:32:04,104 INFO L117 PetriNetUnfolderBase]: For 267592/267592 co-relation queries the response was YES. [2025-04-13 20:32:04,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99691 conditions, 9981 events. 6637/9981 cut-off events. For 267592/267592 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 61104 event pairs, 887 based on Foata normal form. 1/9035 useless extension candidates. Maximal degree in co-relation 99490. Up to 8459 conditions per place. [2025-04-13 20:32:04,237 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 851 selfloop transitions, 310 changer transitions 2/1163 dead transitions. [2025-04-13 20:32:04,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 1163 transitions, 26460 flow [2025-04-13 20:32:04,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:32:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:32:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-04-13 20:32:04,238 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.384375 [2025-04-13 20:32:04,238 INFO L175 Difference]: Start difference. First operand has 386 places, 1075 transitions, 22610 flow. Second operand 10 states and 123 transitions. [2025-04-13 20:32:04,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 1163 transitions, 26460 flow [2025-04-13 20:32:06,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1163 transitions, 25940 flow, removed 207 selfloop flow, removed 5 redundant places. [2025-04-13 20:32:06,488 INFO L231 Difference]: Finished difference. Result has 393 places, 1113 transitions, 24113 flow [2025-04-13 20:32:06,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22198, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1075, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=768, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=24113, PETRI_PLACES=393, PETRI_TRANSITIONS=1113} [2025-04-13 20:32:06,489 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 362 predicate places. [2025-04-13 20:32:06,489 INFO L485 AbstractCegarLoop]: Abstraction has has 393 places, 1113 transitions, 24113 flow [2025-04-13 20:32:06,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:06,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:06,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:06,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 20:32:06,489 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:06,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:06,490 INFO L85 PathProgramCache]: Analyzing trace with hash -926085846, now seen corresponding path program 29 times [2025-04-13 20:32:06,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:06,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827536801] [2025-04-13 20:32:06,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:06,494 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:32:06,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:06,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:06,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:06,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:06,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827536801] [2025-04-13 20:32:06,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827536801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:06,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091742538] [2025-04-13 20:32:06,686 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:32:06,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:06,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:06,687 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-13 20:32:06,688 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-13 20:32:06,729 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:32:06,741 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:06,741 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:32:06,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:06,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:32:06,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:06,758 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-13 20:32:06,851 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:32:06,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2025-04-13 20:32:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:06,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091742538] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-13 20:32:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013078226] [2025-04-13 20:32:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:06,978 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:32:06,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:06,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:32:06,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:32:06,979 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:06,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1113 transitions, 24113 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:06,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:06,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:10,163 INFO L116 PetriNetUnfolderBase]: 7133/10735 cut-off events. [2025-04-13 20:32:10,164 INFO L117 PetriNetUnfolderBase]: For 316219/316219 co-relation queries the response was YES. [2025-04-13 20:32:10,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110385 conditions, 10735 events. 7133/10735 cut-off events. For 316219/316219 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 66621 event pairs, 814 based on Foata normal form. 1/9746 useless extension candidates. Maximal degree in co-relation 110180. Up to 7926 conditions per place. [2025-04-13 20:32:10,314 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 646 selfloop transitions, 701 changer transitions 1/1348 dead transitions. [2025-04-13 20:32:10,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 1348 transitions, 31190 flow [2025-04-13 20:32:10,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:32:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:32:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 202 transitions. [2025-04-13 20:32:10,315 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2025-04-13 20:32:10,315 INFO L175 Difference]: Start difference. First operand has 393 places, 1113 transitions, 24113 flow. Second operand 16 states and 202 transitions. [2025-04-13 20:32:10,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 1348 transitions, 31190 flow [2025-04-13 20:32:12,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 1348 transitions, 30897 flow, removed 94 selfloop flow, removed 4 redundant places. [2025-04-13 20:32:12,900 INFO L231 Difference]: Finished difference. Result has 413 places, 1266 transitions, 29626 flow [2025-04-13 20:32:12,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23827, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=558, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=29626, PETRI_PLACES=413, PETRI_TRANSITIONS=1266} [2025-04-13 20:32:12,901 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 382 predicate places. [2025-04-13 20:32:12,901 INFO L485 AbstractCegarLoop]: Abstraction has has 413 places, 1266 transitions, 29626 flow [2025-04-13 20:32:12,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:12,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:12,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:12,906 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-13 20:32:13,101 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,SelfDestructingSolverStorable45 [2025-04-13 20:32:13,102 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:13,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1785555022, now seen corresponding path program 30 times [2025-04-13 20:32:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:13,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311429489] [2025-04-13 20:32:13,102 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:32:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:13,106 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:32:13,108 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:32:13,109 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:32:13,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:13,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:13,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311429489] [2025-04-13 20:32:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311429489] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:13,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:32:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257676896] [2025-04-13 20:32:13,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:13,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:32:13,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:13,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:32:13,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:32:13,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:13,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1266 transitions, 29626 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:13,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:13,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:13,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:16,709 INFO L116 PetriNetUnfolderBase]: 7182/10814 cut-off events. [2025-04-13 20:32:16,709 INFO L117 PetriNetUnfolderBase]: For 347626/347626 co-relation queries the response was YES. [2025-04-13 20:32:16,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117438 conditions, 10814 events. 7182/10814 cut-off events. For 347626/347626 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 67283 event pairs, 1022 based on Foata normal form. 1/9825 useless extension candidates. Maximal degree in co-relation 117222. Up to 10283 conditions per place. [2025-04-13 20:32:16,834 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 1103 selfloop transitions, 234 changer transitions 3/1340 dead transitions. [2025-04-13 20:32:16,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1340 transitions, 33481 flow [2025-04-13 20:32:16,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:32:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:32:16,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 167 transitions. [2025-04-13 20:32:16,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3069852941176471 [2025-04-13 20:32:16,835 INFO L175 Difference]: Start difference. First operand has 413 places, 1266 transitions, 29626 flow. Second operand 17 states and 167 transitions. [2025-04-13 20:32:16,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1340 transitions, 33481 flow [2025-04-13 20:32:19,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 1340 transitions, 32709 flow, removed 339 selfloop flow, removed 3 redundant places. [2025-04-13 20:32:19,573 INFO L231 Difference]: Finished difference. Result has 431 places, 1298 transitions, 30372 flow [2025-04-13 20:32:19,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28881, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=30372, PETRI_PLACES=431, PETRI_TRANSITIONS=1298} [2025-04-13 20:32:19,574 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 400 predicate places. [2025-04-13 20:32:19,574 INFO L485 AbstractCegarLoop]: Abstraction has has 431 places, 1298 transitions, 30372 flow [2025-04-13 20:32:19,575 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:19,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:19,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:32:19,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 20:32:19,575 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:19,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:19,575 INFO L85 PathProgramCache]: Analyzing trace with hash 365867290, now seen corresponding path program 31 times [2025-04-13 20:32:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:19,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831988301] [2025-04-13 20:32:19,575 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:19,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:32:19,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:19,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:19,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:32:19,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:19,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831988301] [2025-04-13 20:32:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831988301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:19,791 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705543410] [2025-04-13 20:32:19,791 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:32:19,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:19,793 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-13 20:32:19,794 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-13 20:32:19,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:32:19,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:32:19,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:19,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:19,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:32:19,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:19,861 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-13 20:32:19,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 20:32:19,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-13 20:32:19,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705543410] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:32:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 8] total 21 [2025-04-13 20:32:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840852850] [2025-04-13 20:32:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:20,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:32:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:32:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:32:20,061 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:20,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1298 transitions, 30372 flow. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:20,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:20,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:20,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:23,704 INFO L116 PetriNetUnfolderBase]: 7311/10987 cut-off events. [2025-04-13 20:32:23,704 INFO L117 PetriNetUnfolderBase]: For 341799/341799 co-relation queries the response was YES. [2025-04-13 20:32:23,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119222 conditions, 10987 events. 7311/10987 cut-off events. For 341799/341799 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 68323 event pairs, 892 based on Foata normal form. 1/9970 useless extension candidates. Maximal degree in co-relation 118998. Up to 8425 conditions per place. [2025-04-13 20:32:23,831 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 649 selfloop transitions, 738 changer transitions 1/1388 dead transitions. [2025-04-13 20:32:23,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 1388 transitions, 34752 flow [2025-04-13 20:32:23,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:32:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:32:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 174 transitions. [2025-04-13 20:32:23,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2025-04-13 20:32:23,832 INFO L175 Difference]: Start difference. First operand has 431 places, 1298 transitions, 30372 flow. Second operand 14 states and 174 transitions. [2025-04-13 20:32:23,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 1388 transitions, 34752 flow [2025-04-13 20:32:26,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 1388 transitions, 34468 flow, removed 106 selfloop flow, removed 5 redundant places. [2025-04-13 20:32:26,498 INFO L231 Difference]: Finished difference. Result has 445 places, 1348 transitions, 33778 flow [2025-04-13 20:32:26,499 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=30072, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=688, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=33778, PETRI_PLACES=445, PETRI_TRANSITIONS=1348} [2025-04-13 20:32:26,499 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 414 predicate places. [2025-04-13 20:32:26,499 INFO L485 AbstractCegarLoop]: Abstraction has has 445 places, 1348 transitions, 33778 flow [2025-04-13 20:32:26,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:26,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:26,500 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-13 20:32:26,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 20:32:26,700 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,SelfDestructingSolverStorable47 [2025-04-13 20:32:26,700 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:26,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash -973074183, now seen corresponding path program 1 times [2025-04-13 20:32:26,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:26,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454631389] [2025-04-13 20:32:26,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:26,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:26,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:26,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:26,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:26,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:26,735 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454631389] [2025-04-13 20:32:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454631389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:32:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765674062] [2025-04-13 20:32:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:26,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:32:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:26,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:32:26,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:32:26,736 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:26,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1348 transitions, 33778 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-13 20:32:26,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:26,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:26,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:30,359 INFO L116 PetriNetUnfolderBase]: 7686/11613 cut-off events. [2025-04-13 20:32:30,360 INFO L117 PetriNetUnfolderBase]: For 394652/394652 co-relation queries the response was YES. [2025-04-13 20:32:30,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130881 conditions, 11613 events. 7686/11613 cut-off events. For 394652/394652 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 73634 event pairs, 1034 based on Foata normal form. 23/10530 useless extension candidates. Maximal degree in co-relation 130649. Up to 4301 conditions per place. [2025-04-13 20:32:30,701 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1442 selfloop transitions, 292 changer transitions 6/1740 dead transitions. [2025-04-13 20:32:30,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1740 transitions, 46437 flow [2025-04-13 20:32:30,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:32:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:32:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2025-04-13 20:32:30,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2025-04-13 20:32:30,702 INFO L175 Difference]: Start difference. First operand has 445 places, 1348 transitions, 33778 flow. Second operand 7 states and 108 transitions. [2025-04-13 20:32:30,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 1740 transitions, 46437 flow [2025-04-13 20:32:34,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 1740 transitions, 46024 flow, removed 88 selfloop flow, removed 7 redundant places. [2025-04-13 20:32:34,834 INFO L231 Difference]: Finished difference. Result has 447 places, 1377 transitions, 35200 flow [2025-04-13 20:32:34,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33353, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1081, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=35200, PETRI_PLACES=447, PETRI_TRANSITIONS=1377} [2025-04-13 20:32:34,836 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 416 predicate places. [2025-04-13 20:32:34,836 INFO L485 AbstractCegarLoop]: Abstraction has has 447 places, 1377 transitions, 35200 flow [2025-04-13 20:32:34,836 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-13 20:32:34,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:34,836 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-13 20:32:34,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 20:32:34,836 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:34,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1891767003, now seen corresponding path program 1 times [2025-04-13 20:32:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:34,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699940139] [2025-04-13 20:32:34,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:34,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:34,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:34,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:34,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:34,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:34,886 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-13 20:32:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:34,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699940139] [2025-04-13 20:32:34,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699940139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:32:34,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15856955] [2025-04-13 20:32:34,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:34,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:32:34,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:32:34,888 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-13 20:32:34,890 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-13 20:32:34,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:34,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:34,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:34,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:34,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:32:34,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:32:35,005 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-13 20:32:35,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:32:35,045 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-13 20:32:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15856955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:32:35,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:32:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:32:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779076413] [2025-04-13 20:32:35,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:32:35,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:32:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:35,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:32:35,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:32:35,046 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:35,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 1377 transitions, 35200 flow. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:35,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:35,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:35,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:32:42,549 INFO L116 PetriNetUnfolderBase]: 14305/21813 cut-off events. [2025-04-13 20:32:42,549 INFO L117 PetriNetUnfolderBase]: For 817544/817544 co-relation queries the response was YES. [2025-04-13 20:32:42,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257136 conditions, 21813 events. 14305/21813 cut-off events. For 817544/817544 co-relation queries the response was YES. Maximal size of possible extension queue 1703. Compared 153571 event pairs, 3427 based on Foata normal form. 0/20278 useless extension candidates. Maximal degree in co-relation 255601. Up to 8882 conditions per place. [2025-04-13 20:32:43,027 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 2746 selfloop transitions, 63 changer transitions 32/2841 dead transitions. [2025-04-13 20:32:43,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 2841 transitions, 77682 flow [2025-04-13 20:32:43,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:32:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:32:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2025-04-13 20:32:43,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45982142857142855 [2025-04-13 20:32:43,028 INFO L175 Difference]: Start difference. First operand has 447 places, 1377 transitions, 35200 flow. Second operand 7 states and 103 transitions. [2025-04-13 20:32:43,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 2841 transitions, 77682 flow [2025-04-13 20:32:54,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 2841 transitions, 77530 flow, removed 65 selfloop flow, removed 2 redundant places. [2025-04-13 20:32:54,376 INFO L231 Difference]: Finished difference. Result has 455 places, 1438 transitions, 37105 flow [2025-04-13 20:32:54,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=35141, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=37105, PETRI_PLACES=455, PETRI_TRANSITIONS=1438} [2025-04-13 20:32:54,377 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 424 predicate places. [2025-04-13 20:32:54,377 INFO L485 AbstractCegarLoop]: Abstraction has has 455 places, 1438 transitions, 37105 flow [2025-04-13 20:32:54,377 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:54,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:32:54,377 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-13 20:32:54,383 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-13 20:32:54,578 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,SelfDestructingSolverStorable49 [2025-04-13 20:32:54,578 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:32:54,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:32:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash -953093585, now seen corresponding path program 1 times [2025-04-13 20:32:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:32:54,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851971537] [2025-04-13 20:32:54,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:32:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:32:54,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:32:54,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:32:54,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:32:54,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:32:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:32:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:32:54,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851971537] [2025-04-13 20:32:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851971537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:32:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:32:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:32:54,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626562649] [2025-04-13 20:32:54,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:32:54,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:32:54,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:32:54,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:32:54,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:32:54,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:32:54,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 1438 transitions, 37105 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:32:54,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:32:54,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:32:54,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:02,123 INFO L116 PetriNetUnfolderBase]: 14504/22174 cut-off events. [2025-04-13 20:33:02,123 INFO L117 PetriNetUnfolderBase]: For 861740/861740 co-relation queries the response was YES. [2025-04-13 20:33:02,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262435 conditions, 22174 events. 14504/22174 cut-off events. For 861740/861740 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 158013 event pairs, 1930 based on Foata normal form. 39/20624 useless extension candidates. Maximal degree in co-relation 260772. Up to 7553 conditions per place. [2025-04-13 20:33:02,457 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1553 selfloop transitions, 296 changer transitions 5/1854 dead transitions. [2025-04-13 20:33:02,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1854 transitions, 50510 flow [2025-04-13 20:33:02,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:33:02,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:33:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2025-04-13 20:33:02,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-04-13 20:33:02,457 INFO L175 Difference]: Start difference. First operand has 455 places, 1438 transitions, 37105 flow. Second operand 7 states and 122 transitions. [2025-04-13 20:33:02,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 1854 transitions, 50510 flow [2025-04-13 20:33:13,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 1854 transitions, 50502 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-13 20:33:13,641 INFO L231 Difference]: Finished difference. Result has 462 places, 1447 transitions, 38345 flow [2025-04-13 20:33:13,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36945, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38345, PETRI_PLACES=462, PETRI_TRANSITIONS=1447} [2025-04-13 20:33:13,642 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 431 predicate places. [2025-04-13 20:33:13,642 INFO L485 AbstractCegarLoop]: Abstraction has has 462 places, 1447 transitions, 38345 flow [2025-04-13 20:33:13,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:13,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:13,643 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-13 20:33:13,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 20:33:13,643 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-13 20:33:13,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1129465979, now seen corresponding path program 2 times [2025-04-13 20:33:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:13,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855983098] [2025-04-13 20:33:13,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:13,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:13,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:33:13,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:33:13,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:13,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855983098] [2025-04-13 20:33:13,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855983098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:33:13,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:33:13,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:33:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132260005] [2025-04-13 20:33:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:13,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:33:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:13,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:33:13,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:33:13,668 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:13,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 1447 transitions, 38345 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:13,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:13,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:13,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:21,799 INFO L116 PetriNetUnfolderBase]: 14387/21998 cut-off events. [2025-04-13 20:33:21,800 INFO L117 PetriNetUnfolderBase]: For 924748/924748 co-relation queries the response was YES. [2025-04-13 20:33:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264835 conditions, 21998 events. 14387/21998 cut-off events. For 924748/924748 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 155717 event pairs, 1965 based on Foata normal form. 18/20463 useless extension candidates. Maximal degree in co-relation 263760. Up to 6861 conditions per place. [2025-04-13 20:33:22,178 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1410 selfloop transitions, 351 changer transitions 20/1781 dead transitions. [2025-04-13 20:33:22,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 1781 transitions, 48922 flow [2025-04-13 20:33:22,178 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:33:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:33:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2025-04-13 20:33:22,179 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5580357142857143 [2025-04-13 20:33:22,179 INFO L175 Difference]: Start difference. First operand has 462 places, 1447 transitions, 38345 flow. Second operand 7 states and 125 transitions. [2025-04-13 20:33:22,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 1781 transitions, 48922 flow [2025-04-13 20:33:33,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 1781 transitions, 48270 flow, removed 38 selfloop flow, removed 3 redundant places. [2025-04-13 20:33:33,686 INFO L231 Difference]: Finished difference. Result has 466 places, 1477 transitions, 38946 flow [2025-04-13 20:33:33,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=37510, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=38946, PETRI_PLACES=466, PETRI_TRANSITIONS=1477} [2025-04-13 20:33:33,687 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 435 predicate places. [2025-04-13 20:33:33,687 INFO L485 AbstractCegarLoop]: Abstraction has has 466 places, 1477 transitions, 38946 flow [2025-04-13 20:33:33,688 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:33,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:33,688 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-13 20:33:33,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 20:33:33,688 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-13 20:33:33,688 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1996234721, now seen corresponding path program 1 times [2025-04-13 20:33:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:33,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405923110] [2025-04-13 20:33:33,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:33:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:33,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:33,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:33,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:33,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:33,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:33,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405923110] [2025-04-13 20:33:33,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405923110] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:33,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814339481] [2025-04-13 20:33:33,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:33:33,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:33,729 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-13 20:33:33,731 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-13 20:33:33,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:33:33,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:33,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:33:33,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:33,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:33:33,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:33,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:33:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814339481] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:33:33,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:33:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:33:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602623745] [2025-04-13 20:33:33,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:33:33,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:33:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:33,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:33:33,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:33:33,844 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:33,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 1477 transitions, 38946 flow. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:33,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:33,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:33,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:40,644 INFO L116 PetriNetUnfolderBase]: 11610/18110 cut-off events. [2025-04-13 20:33:40,644 INFO L117 PetriNetUnfolderBase]: For 776573/776573 co-relation queries the response was YES. [2025-04-13 20:33:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216836 conditions, 18110 events. 11610/18110 cut-off events. For 776573/776573 co-relation queries the response was YES. Maximal size of possible extension queue 1415. Compared 128854 event pairs, 3504 based on Foata normal form. 602/17449 useless extension candidates. Maximal degree in co-relation 216092. Up to 11652 conditions per place. [2025-04-13 20:33:40,927 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2279 selfloop transitions, 138 changer transitions 61/2478 dead transitions. [2025-04-13 20:33:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 2478 transitions, 70652 flow [2025-04-13 20:33:40,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:33:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:33:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2025-04-13 20:33:40,929 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2025-04-13 20:33:40,929 INFO L175 Difference]: Start difference. First operand has 466 places, 1477 transitions, 38946 flow. Second operand 6 states and 85 transitions. [2025-04-13 20:33:40,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 2478 transitions, 70652 flow [2025-04-13 20:33:49,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 2478 transitions, 70270 flow, removed 67 selfloop flow, removed 3 redundant places. [2025-04-13 20:33:49,954 INFO L231 Difference]: Finished difference. Result has 470 places, 1589 transitions, 43284 flow [2025-04-13 20:33:49,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=38228, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=43284, PETRI_PLACES=470, PETRI_TRANSITIONS=1589} [2025-04-13 20:33:49,956 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 439 predicate places. [2025-04-13 20:33:49,956 INFO L485 AbstractCegarLoop]: Abstraction has has 470 places, 1589 transitions, 43284 flow [2025-04-13 20:33:49,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:33:49,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:33:49,956 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-13 20:33:49,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:33:50,157 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,SelfDestructingSolverStorable52 [2025-04-13 20:33:50,157 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-13 20:33:50,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:33:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1093763331, now seen corresponding path program 2 times [2025-04-13 20:33:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:33:50,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242796419] [2025-04-13 20:33:50,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:33:50,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:50,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:50,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:50,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:50,202 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-13 20:33:50,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:33:50,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242796419] [2025-04-13 20:33:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242796419] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:50,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426905042] [2025-04-13 20:33:50,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:33:50,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:33:50,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:33:50,205 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-13 20:33:50,206 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-13 20:33:50,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:33:50,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:33:50,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:33:50,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:33:50,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:33:50,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:33:50,339 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-13 20:33:50,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:33:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:33:50,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426905042] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:33:50,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:33:50,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 20:33:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95723534] [2025-04-13 20:33:50,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:33:50,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:33:50,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:33:50,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:33:50,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:33:50,417 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:33:50,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1589 transitions, 43284 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-13 20:33:50,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:33:50,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:33:50,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:33:58,469 INFO L116 PetriNetUnfolderBase]: 13099/20431 cut-off events. [2025-04-13 20:33:58,469 INFO L117 PetriNetUnfolderBase]: For 922371/922371 co-relation queries the response was YES. [2025-04-13 20:33:58,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246000 conditions, 20431 events. 13099/20431 cut-off events. For 922371/922371 co-relation queries the response was YES. Maximal size of possible extension queue 1418. Compared 147024 event pairs, 1786 based on Foata normal form. 192/19051 useless extension candidates. Maximal degree in co-relation 244119. Up to 10566 conditions per place. [2025-04-13 20:33:58,850 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1622 selfloop transitions, 350 changer transitions 7/1979 dead transitions. [2025-04-13 20:33:58,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 1979 transitions, 56701 flow [2025-04-13 20:33:58,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:33:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:33:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-04-13 20:33:58,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-04-13 20:33:58,851 INFO L175 Difference]: Start difference. First operand has 470 places, 1589 transitions, 43284 flow. Second operand 6 states and 98 transitions. [2025-04-13 20:33:58,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 1979 transitions, 56701 flow [2025-04-13 20:34:09,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 1979 transitions, 56678 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 20:34:09,520 INFO L231 Difference]: Finished difference. Result has 475 places, 1625 transitions, 45566 flow [2025-04-13 20:34:09,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43267, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=314, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=45566, PETRI_PLACES=475, PETRI_TRANSITIONS=1625} [2025-04-13 20:34:09,522 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 444 predicate places. [2025-04-13 20:34:09,522 INFO L485 AbstractCegarLoop]: Abstraction has has 475 places, 1625 transitions, 45566 flow [2025-04-13 20:34:09,522 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-13 20:34:09,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:09,522 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-13 20:34:09,528 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-13 20:34:09,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:34:09,723 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-13 20:34:09,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:09,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1192804239, now seen corresponding path program 3 times [2025-04-13 20:34:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:09,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817547360] [2025-04-13 20:34:09,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:34:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:09,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:09,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:34:09,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:34:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:09,762 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817547360] [2025-04-13 20:34:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817547360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:34:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059324148] [2025-04-13 20:34:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:09,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:34:09,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:09,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:34:09,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:34:09,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:34:09,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 1625 transitions, 45566 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-13 20:34:09,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:09,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:34:09,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:17,635 INFO L116 PetriNetUnfolderBase]: 12423/19455 cut-off events. [2025-04-13 20:34:17,635 INFO L117 PetriNetUnfolderBase]: For 912855/912855 co-relation queries the response was YES. [2025-04-13 20:34:17,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239654 conditions, 19455 events. 12423/19455 cut-off events. For 912855/912855 co-relation queries the response was YES. Maximal size of possible extension queue 1557. Compared 141914 event pairs, 2371 based on Foata normal form. 276/18451 useless extension candidates. Maximal degree in co-relation 237944. Up to 11726 conditions per place. [2025-04-13 20:34:17,939 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1287 selfloop transitions, 509 changer transitions 31/1827 dead transitions. [2025-04-13 20:34:17,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1827 transitions, 54127 flow [2025-04-13 20:34:17,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:34:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:34:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-13 20:34:17,940 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2025-04-13 20:34:17,940 INFO L175 Difference]: Start difference. First operand has 475 places, 1625 transitions, 45566 flow. Second operand 6 states and 86 transitions. [2025-04-13 20:34:17,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 1827 transitions, 54127 flow [2025-04-13 20:34:28,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1827 transitions, 53787 flow, removed 47 selfloop flow, removed 2 redundant places. [2025-04-13 20:34:28,926 INFO L231 Difference]: Finished difference. Result has 480 places, 1598 transitions, 46070 flow [2025-04-13 20:34:28,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44739, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=489, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=46070, PETRI_PLACES=480, PETRI_TRANSITIONS=1598} [2025-04-13 20:34:28,928 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 449 predicate places. [2025-04-13 20:34:28,928 INFO L485 AbstractCegarLoop]: Abstraction has has 480 places, 1598 transitions, 46070 flow [2025-04-13 20:34:28,928 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-13 20:34:28,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:28,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, 1, 1] [2025-04-13 20:34:28,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 20:34:28,929 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-13 20:34:28,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:28,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1798149569, now seen corresponding path program 3 times [2025-04-13 20:34:28,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:28,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925086249] [2025-04-13 20:34:28,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:34:28,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:28,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:28,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:34:28,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:34:28,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:28,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:28,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925086249] [2025-04-13 20:34:28,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925086249] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:28,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:28,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:34:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767041874] [2025-04-13 20:34:28,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:28,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:34:28,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:28,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:34:28,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:34:28,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:34:28,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 1598 transitions, 46070 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:34:28,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:28,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:34:28,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:34:37,295 INFO L116 PetriNetUnfolderBase]: 13714/21122 cut-off events. [2025-04-13 20:34:37,295 INFO L117 PetriNetUnfolderBase]: For 1176757/1176757 co-relation queries the response was YES. [2025-04-13 20:34:37,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269997 conditions, 21122 events. 13714/21122 cut-off events. For 1176757/1176757 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 151011 event pairs, 2730 based on Foata normal form. 140/20461 useless extension candidates. Maximal degree in co-relation 268427. Up to 13123 conditions per place. [2025-04-13 20:34:37,604 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1361 selfloop transitions, 555 changer transitions 2/1918 dead transitions. [2025-04-13 20:34:37,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 1918 transitions, 58861 flow [2025-04-13 20:34:37,604 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:34:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:34:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-04-13 20:34:37,605 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-04-13 20:34:37,605 INFO L175 Difference]: Start difference. First operand has 480 places, 1598 transitions, 46070 flow. Second operand 5 states and 84 transitions. [2025-04-13 20:34:37,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 1918 transitions, 58861 flow [2025-04-13 20:34:51,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1918 transitions, 58099 flow, removed 80 selfloop flow, removed 6 redundant places. [2025-04-13 20:34:51,221 INFO L231 Difference]: Finished difference. Result has 479 places, 1666 transitions, 49240 flow [2025-04-13 20:34:51,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44794, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=469, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=49240, PETRI_PLACES=479, PETRI_TRANSITIONS=1666} [2025-04-13 20:34:51,222 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 448 predicate places. [2025-04-13 20:34:51,222 INFO L485 AbstractCegarLoop]: Abstraction has has 479 places, 1666 transitions, 49240 flow [2025-04-13 20:34:51,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:34:51,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:34:51,222 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-13 20:34:51,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 20:34:51,222 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-13 20:34:51,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:34:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1478132865, now seen corresponding path program 4 times [2025-04-13 20:34:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:34:51,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623111227] [2025-04-13 20:34:51,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:34:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:34:51,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:34:51,228 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-13 20:34:51,228 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:34:51,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:34:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:34:51,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:34:51,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623111227] [2025-04-13 20:34:51,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623111227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:34:51,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:34:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:34:51,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287854953] [2025-04-13 20:34:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:34:51,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:34:51,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:34:51,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:34:51,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:34:51,242 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:34:51,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1666 transitions, 49240 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:34:51,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:34:51,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:34:51,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:00,138 INFO L116 PetriNetUnfolderBase]: 14035/21719 cut-off events. [2025-04-13 20:35:00,139 INFO L117 PetriNetUnfolderBase]: For 1215151/1215151 co-relation queries the response was YES. [2025-04-13 20:35:00,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277186 conditions, 21719 events. 14035/21719 cut-off events. For 1215151/1215151 co-relation queries the response was YES. Maximal size of possible extension queue 1558. Compared 156877 event pairs, 2317 based on Foata normal form. 91/20948 useless extension candidates. Maximal degree in co-relation 275586. Up to 10103 conditions per place. [2025-04-13 20:35:00,482 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1545 selfloop transitions, 577 changer transitions 10/2132 dead transitions. [2025-04-13 20:35:00,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 2132 transitions, 65011 flow [2025-04-13 20:35:00,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:35:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:35:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-04-13 20:35:00,483 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49609375 [2025-04-13 20:35:00,483 INFO L175 Difference]: Start difference. First operand has 479 places, 1666 transitions, 49240 flow. Second operand 8 states and 127 transitions. [2025-04-13 20:35:00,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 2132 transitions, 65011 flow [2025-04-13 20:35:14,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 2132 transitions, 64455 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-04-13 20:35:14,720 INFO L231 Difference]: Finished difference. Result has 487 places, 1664 transitions, 50273 flow [2025-04-13 20:35:14,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=48411, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=563, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1087, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=50273, PETRI_PLACES=487, PETRI_TRANSITIONS=1664} [2025-04-13 20:35:14,721 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 456 predicate places. [2025-04-13 20:35:14,722 INFO L485 AbstractCegarLoop]: Abstraction has has 487 places, 1664 transitions, 50273 flow [2025-04-13 20:35:14,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:14,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:14,722 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-13 20:35:14,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 20:35:14,722 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-13 20:35:14,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:14,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2128679621, now seen corresponding path program 5 times [2025-04-13 20:35:14,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:14,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875707845] [2025-04-13 20:35:14,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:35:14,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:14,727 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:35:14,730 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:35:14,730 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:35:14,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:35:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:14,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875707845] [2025-04-13 20:35:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875707845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:35:14,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:35:14,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:35:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386978728] [2025-04-13 20:35:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:14,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:35:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:14,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:35:14,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:35:14,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:35:14,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 1664 transitions, 50273 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:14,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:14,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:35:14,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:23,682 INFO L116 PetriNetUnfolderBase]: 13320/20566 cut-off events. [2025-04-13 20:35:23,682 INFO L117 PetriNetUnfolderBase]: For 1270703/1270703 co-relation queries the response was YES. [2025-04-13 20:35:23,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264095 conditions, 20566 events. 13320/20566 cut-off events. For 1270703/1270703 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 146984 event pairs, 2589 based on Foata normal form. 140/19851 useless extension candidates. Maximal degree in co-relation 262694. Up to 12804 conditions per place. [2025-04-13 20:35:23,972 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1319 selfloop transitions, 499 changer transitions 11/1829 dead transitions. [2025-04-13 20:35:23,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 491 places, 1829 transitions, 56567 flow [2025-04-13 20:35:23,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:35:23,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:35:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-13 20:35:23,973 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-13 20:35:23,974 INFO L175 Difference]: Start difference. First operand has 487 places, 1664 transitions, 50273 flow. Second operand 5 states and 82 transitions. [2025-04-13 20:35:23,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 491 places, 1829 transitions, 56567 flow [2025-04-13 20:35:37,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 489 places, 1829 transitions, 55871 flow, removed 103 selfloop flow, removed 2 redundant places. [2025-04-13 20:35:37,356 INFO L231 Difference]: Finished difference. Result has 490 places, 1597 transitions, 47882 flow [2025-04-13 20:35:37,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=46610, PETRI_DIFFERENCE_MINUEND_PLACES=485, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=493, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=47882, PETRI_PLACES=490, PETRI_TRANSITIONS=1597} [2025-04-13 20:35:37,357 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2025-04-13 20:35:37,357 INFO L485 AbstractCegarLoop]: Abstraction has has 490 places, 1597 transitions, 47882 flow [2025-04-13 20:35:37,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:37,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:37,357 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-13 20:35:37,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 20:35:37,357 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:37,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:37,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1130711741, now seen corresponding path program 6 times [2025-04-13 20:35:37,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:37,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335572400] [2025-04-13 20:35:37,358 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:35:37,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:37,362 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:35:37,364 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:35:37,364 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:35:37,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:35:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:37,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335572400] [2025-04-13 20:35:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335572400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:35:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:35:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:35:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442154923] [2025-04-13 20:35:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:37,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:35:37,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:37,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:35:37,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:35:37,385 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:35:37,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1597 transitions, 47882 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:37,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:37,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:35:37,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:35:45,713 INFO L116 PetriNetUnfolderBase]: 12623/19453 cut-off events. [2025-04-13 20:35:45,714 INFO L117 PetriNetUnfolderBase]: For 1187160/1187160 co-relation queries the response was YES. [2025-04-13 20:35:45,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247915 conditions, 19453 events. 12623/19453 cut-off events. For 1187160/1187160 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 136825 event pairs, 1867 based on Foata normal form. 96/18700 useless extension candidates. Maximal degree in co-relation 246793. Up to 8761 conditions per place. [2025-04-13 20:35:46,017 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1227 selfloop transitions, 540 changer transitions 31/1798 dead transitions. [2025-04-13 20:35:46,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 1798 transitions, 55746 flow [2025-04-13 20:35:46,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:35:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:35:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2025-04-13 20:35:46,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-04-13 20:35:46,018 INFO L175 Difference]: Start difference. First operand has 490 places, 1597 transitions, 47882 flow. Second operand 7 states and 118 transitions. [2025-04-13 20:35:46,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 1798 transitions, 55746 flow [2025-04-13 20:35:58,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 1798 transitions, 54142 flow, removed 560 selfloop flow, removed 1 redundant places. [2025-04-13 20:35:59,019 INFO L231 Difference]: Finished difference. Result has 496 places, 1549 transitions, 46187 flow [2025-04-13 20:35:59,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=45279, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=527, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1035, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=46187, PETRI_PLACES=496, PETRI_TRANSITIONS=1549} [2025-04-13 20:35:59,021 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 465 predicate places. [2025-04-13 20:35:59,021 INFO L485 AbstractCegarLoop]: Abstraction has has 496 places, 1549 transitions, 46187 flow [2025-04-13 20:35:59,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:59,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:35:59,021 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-13 20:35:59,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 20:35:59,021 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:35:59,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:35:59,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2053615803, now seen corresponding path program 7 times [2025-04-13 20:35:59,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:35:59,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979384726] [2025-04-13 20:35:59,022 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:35:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:35:59,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:35:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:35:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:35:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:35:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:35:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:35:59,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979384726] [2025-04-13 20:35:59,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979384726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:35:59,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:35:59,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:35:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952021614] [2025-04-13 20:35:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:35:59,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:35:59,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:35:59,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:35:59,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:35:59,053 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:35:59,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 1549 transitions, 46187 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:35:59,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:35:59,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:35:59,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:06,382 INFO L116 PetriNetUnfolderBase]: 12134/18506 cut-off events. [2025-04-13 20:36:06,382 INFO L117 PetriNetUnfolderBase]: For 1085750/1085750 co-relation queries the response was YES. [2025-04-13 20:36:06,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235163 conditions, 18506 events. 12134/18506 cut-off events. For 1085750/1085750 co-relation queries the response was YES. Maximal size of possible extension queue 1307. Compared 126756 event pairs, 1715 based on Foata normal form. 102/17768 useless extension candidates. Maximal degree in co-relation 234343. Up to 7404 conditions per place. [2025-04-13 20:36:06,650 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1578 selfloop transitions, 284 changer transitions 7/1869 dead transitions. [2025-04-13 20:36:06,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 1869 transitions, 57893 flow [2025-04-13 20:36:06,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:36:06,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:36:06,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2025-04-13 20:36:06,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5044642857142857 [2025-04-13 20:36:06,651 INFO L175 Difference]: Start difference. First operand has 496 places, 1549 transitions, 46187 flow. Second operand 7 states and 113 transitions. [2025-04-13 20:36:06,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 1869 transitions, 57893 flow [2025-04-13 20:36:17,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 1869 transitions, 56789 flow, removed 89 selfloop flow, removed 17 redundant places. [2025-04-13 20:36:17,697 INFO L231 Difference]: Finished difference. Result has 484 places, 1537 transitions, 45601 flow [2025-04-13 20:36:17,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44831, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=45601, PETRI_PLACES=484, PETRI_TRANSITIONS=1537} [2025-04-13 20:36:17,698 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 453 predicate places. [2025-04-13 20:36:17,698 INFO L485 AbstractCegarLoop]: Abstraction has has 484 places, 1537 transitions, 45601 flow [2025-04-13 20:36:17,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:17,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:17,699 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-13 20:36:17,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 20:36:17,699 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:17,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash -641717659, now seen corresponding path program 8 times [2025-04-13 20:36:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:17,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376780639] [2025-04-13 20:36:17,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:36:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:17,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:36:17,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:36:17,717 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:36:17,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:17,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:17,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376780639] [2025-04-13 20:36:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376780639] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:17,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287028571] [2025-04-13 20:36:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:17,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:36:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:17,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:36:17,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:36:17,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:36:17,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1537 transitions, 45601 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:17,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:17,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:36:17,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:24,519 INFO L116 PetriNetUnfolderBase]: 11586/17611 cut-off events. [2025-04-13 20:36:24,519 INFO L117 PetriNetUnfolderBase]: For 1003353/1003353 co-relation queries the response was YES. [2025-04-13 20:36:24,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223652 conditions, 17611 events. 11586/17611 cut-off events. For 1003353/1003353 co-relation queries the response was YES. Maximal size of possible extension queue 1234. Compared 118668 event pairs, 1799 based on Foata normal form. 140/16932 useless extension candidates. Maximal degree in co-relation 222987. Up to 10233 conditions per place. [2025-04-13 20:36:24,773 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1401 selfloop transitions, 212 changer transitions 6/1619 dead transitions. [2025-04-13 20:36:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1619 transitions, 50064 flow [2025-04-13 20:36:24,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:36:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:36:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-13 20:36:24,775 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-13 20:36:24,775 INFO L175 Difference]: Start difference. First operand has 484 places, 1537 transitions, 45601 flow. Second operand 5 states and 82 transitions. [2025-04-13 20:36:24,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1619 transitions, 50064 flow [2025-04-13 20:36:33,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 1619 transitions, 48420 flow, removed 244 selfloop flow, removed 21 redundant places. [2025-04-13 20:36:33,825 INFO L231 Difference]: Finished difference. Result has 449 places, 1441 transitions, 41578 flow [2025-04-13 20:36:33,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41137, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=41578, PETRI_PLACES=449, PETRI_TRANSITIONS=1441} [2025-04-13 20:36:33,826 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 418 predicate places. [2025-04-13 20:36:33,826 INFO L485 AbstractCegarLoop]: Abstraction has has 449 places, 1441 transitions, 41578 flow [2025-04-13 20:36:33,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:33,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:33,826 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-13 20:36:33,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 20:36:33,827 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:33,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:33,827 INFO L85 PathProgramCache]: Analyzing trace with hash 839980139, now seen corresponding path program 4 times [2025-04-13 20:36:33,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:33,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404414234] [2025-04-13 20:36:33,827 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:33,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:33,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:36:33,833 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-13 20:36:33,833 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:36:33,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:33,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404414234] [2025-04-13 20:36:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404414234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:33,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662308484] [2025-04-13 20:36:33,856 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:36:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:33,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:36:33,858 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-13 20:36:33,860 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-13 20:36:33,908 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:36:33,917 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-13 20:36:33,917 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:36:33,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:33,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:36:33,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:36:33,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:33,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:36:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:34,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662308484] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:36:34,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:36:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 20:36:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271427862] [2025-04-13 20:36:34,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:34,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:36:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:34,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:36:34,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:36:34,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:36:34,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 1441 transitions, 41578 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-13 20:36:34,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:34,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:36:34,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:41,499 INFO L116 PetriNetUnfolderBase]: 11990/18290 cut-off events. [2025-04-13 20:36:41,500 INFO L117 PetriNetUnfolderBase]: For 1039686/1039686 co-relation queries the response was YES. [2025-04-13 20:36:41,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227226 conditions, 18290 events. 11990/18290 cut-off events. For 1039686/1039686 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 125735 event pairs, 1673 based on Foata normal form. 328/17748 useless extension candidates. Maximal degree in co-relation 225767. Up to 7588 conditions per place. [2025-04-13 20:36:41,734 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1769 selfloop transitions, 283 changer transitions 56/2108 dead transitions. [2025-04-13 20:36:41,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 2108 transitions, 62965 flow [2025-04-13 20:36:41,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:36:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:36:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2025-04-13 20:36:41,735 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2025-04-13 20:36:41,735 INFO L175 Difference]: Start difference. First operand has 449 places, 1441 transitions, 41578 flow. Second operand 7 states and 101 transitions. [2025-04-13 20:36:41,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 2108 transitions, 62965 flow [2025-04-13 20:36:49,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 2108 transitions, 61239 flow, removed 187 selfloop flow, removed 5 redundant places. [2025-04-13 20:36:49,869 INFO L231 Difference]: Finished difference. Result has 454 places, 1542 transitions, 44753 flow [2025-04-13 20:36:49,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40291, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44753, PETRI_PLACES=454, PETRI_TRANSITIONS=1542} [2025-04-13 20:36:49,871 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 423 predicate places. [2025-04-13 20:36:49,871 INFO L485 AbstractCegarLoop]: Abstraction has has 454 places, 1542 transitions, 44753 flow [2025-04-13 20:36:49,871 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-13 20:36:49,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:36:49,871 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-13 20:36:49,877 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-13 20:36:50,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:36:50,071 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:36:50,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:36:50,072 INFO L85 PathProgramCache]: Analyzing trace with hash -843419857, now seen corresponding path program 9 times [2025-04-13 20:36:50,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:36:50,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729418161] [2025-04-13 20:36:50,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:36:50,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:36:50,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:36:50,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 22 statements. [2025-04-13 20:36:50,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:36:50,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:36:50,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:36:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:36:50,100 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729418161] [2025-04-13 20:36:50,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729418161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:36:50,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:36:50,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:36:50,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138913763] [2025-04-13 20:36:50,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:36:50,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:36:50,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:36:50,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:36:50,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:36:50,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:36:50,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1542 transitions, 44753 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:36:50,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:36:50,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:36:50,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:36:57,588 INFO L116 PetriNetUnfolderBase]: 13045/19788 cut-off events. [2025-04-13 20:36:57,589 INFO L117 PetriNetUnfolderBase]: For 1076630/1076630 co-relation queries the response was YES. [2025-04-13 20:36:57,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248511 conditions, 19788 events. 13045/19788 cut-off events. For 1076630/1076630 co-relation queries the response was YES. Maximal size of possible extension queue 1480. Compared 135700 event pairs, 1786 based on Foata normal form. 134/19248 useless extension candidates. Maximal degree in co-relation 247129. Up to 11257 conditions per place. [2025-04-13 20:36:57,850 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1696 selfloop transitions, 126 changer transitions 14/1836 dead transitions. [2025-04-13 20:36:57,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 1836 transitions, 54512 flow [2025-04-13 20:36:57,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:36:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:36:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-13 20:36:57,851 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.51875 [2025-04-13 20:36:57,851 INFO L175 Difference]: Start difference. First operand has 454 places, 1542 transitions, 44753 flow. Second operand 5 states and 83 transitions. [2025-04-13 20:36:57,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 1836 transitions, 54512 flow [2025-04-13 20:37:07,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 1836 transitions, 54244 flow, removed 133 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:07,698 INFO L231 Difference]: Finished difference. Result has 459 places, 1536 transitions, 44898 flow [2025-04-13 20:37:07,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43995, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=44898, PETRI_PLACES=459, PETRI_TRANSITIONS=1536} [2025-04-13 20:37:07,699 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 428 predicate places. [2025-04-13 20:37:07,699 INFO L485 AbstractCegarLoop]: Abstraction has has 459 places, 1536 transitions, 44898 flow [2025-04-13 20:37:07,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:07,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:07,700 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-13 20:37:07,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 20:37:07,700 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:07,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:07,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1549076127, now seen corresponding path program 5 times [2025-04-13 20:37:07,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:07,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771808111] [2025-04-13 20:37:07,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:07,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:07,706 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:37:07,709 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:37:07,709 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:07,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:07,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771808111] [2025-04-13 20:37:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771808111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:07,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150163749] [2025-04-13 20:37:07,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:07,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:07,747 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-13 20:37:07,750 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-13 20:37:07,799 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:37:07,815 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:37:07,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:07,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:37:07,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:07,882 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-13 20:37:07,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:07,930 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-13 20:37:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150163749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:07,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-04-13 20:37:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762918514] [2025-04-13 20:37:07,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:07,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 20:37:07,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:07,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 20:37:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:37:07,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:37:07,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 1536 transitions, 44898 flow. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:07,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:07,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:37:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:15,289 INFO L116 PetriNetUnfolderBase]: 12371/18603 cut-off events. [2025-04-13 20:37:15,289 INFO L117 PetriNetUnfolderBase]: For 1028371/1028371 co-relation queries the response was YES. [2025-04-13 20:37:15,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232237 conditions, 18603 events. 12371/18603 cut-off events. For 1028371/1028371 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 123057 event pairs, 1220 based on Foata normal form. 349/18146 useless extension candidates. Maximal degree in co-relation 230971. Up to 5406 conditions per place. [2025-04-13 20:37:15,563 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 1976 selfloop transitions, 326 changer transitions 106/2408 dead transitions. [2025-04-13 20:37:15,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 2408 transitions, 72030 flow [2025-04-13 20:37:15,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:37:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:37:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 176 transitions. [2025-04-13 20:37:15,564 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2025-04-13 20:37:15,564 INFO L175 Difference]: Start difference. First operand has 459 places, 1536 transitions, 44898 flow. Second operand 13 states and 176 transitions. [2025-04-13 20:37:15,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 2408 transitions, 72030 flow [2025-04-13 20:37:23,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 470 places, 2408 transitions, 71522 flow, removed 200 selfloop flow, removed 1 redundant places. [2025-04-13 20:37:23,859 INFO L231 Difference]: Finished difference. Result has 476 places, 1589 transitions, 47890 flow [2025-04-13 20:37:23,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43789, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1513, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=47890, PETRI_PLACES=476, PETRI_TRANSITIONS=1589} [2025-04-13 20:37:23,865 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 445 predicate places. [2025-04-13 20:37:23,865 INFO L485 AbstractCegarLoop]: Abstraction has has 476 places, 1589 transitions, 47890 flow [2025-04-13 20:37:23,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:23,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:23,865 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-13 20:37:23,879 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-13 20:37:24,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:24,066 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:24,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:24,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1895160009, now seen corresponding path program 10 times [2025-04-13 20:37:24,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:24,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771150322] [2025-04-13 20:37:24,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:37:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:24,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:37:24,073 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 22 statements. [2025-04-13 20:37:24,073 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:37:24,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:37:24,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:24,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771150322] [2025-04-13 20:37:24,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771150322] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:24,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:24,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:37:24,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221394335] [2025-04-13 20:37:24,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:24,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:37:24,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:24,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:37:24,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:37:24,088 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:37:24,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 476 places, 1589 transitions, 47890 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:24,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:24,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:37:24,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:30,784 INFO L116 PetriNetUnfolderBase]: 11742/17425 cut-off events. [2025-04-13 20:37:30,785 INFO L117 PetriNetUnfolderBase]: For 1020284/1020284 co-relation queries the response was YES. [2025-04-13 20:37:30,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226380 conditions, 17425 events. 11742/17425 cut-off events. For 1020284/1020284 co-relation queries the response was YES. Maximal size of possible extension queue 1182. Compared 111087 event pairs, 1409 based on Foata normal form. 96/16745 useless extension candidates. Maximal degree in co-relation 225204. Up to 6898 conditions per place. [2025-04-13 20:37:31,031 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1818 selfloop transitions, 124 changer transitions 21/1963 dead transitions. [2025-04-13 20:37:31,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 1963 transitions, 59786 flow [2025-04-13 20:37:31,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:37:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:37:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-13 20:37:31,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.50625 [2025-04-13 20:37:31,032 INFO L175 Difference]: Start difference. First operand has 476 places, 1589 transitions, 47890 flow. Second operand 5 states and 81 transitions. [2025-04-13 20:37:31,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 1963 transitions, 59786 flow [2025-04-13 20:37:38,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 1963 transitions, 59341 flow, removed 186 selfloop flow, removed 5 redundant places. [2025-04-13 20:37:38,946 INFO L231 Difference]: Finished difference. Result has 477 places, 1557 transitions, 46667 flow [2025-04-13 20:37:38,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=46585, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=46667, PETRI_PLACES=477, PETRI_TRANSITIONS=1557} [2025-04-13 20:37:38,948 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 446 predicate places. [2025-04-13 20:37:38,948 INFO L485 AbstractCegarLoop]: Abstraction has has 477 places, 1557 transitions, 46667 flow [2025-04-13 20:37:38,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:38,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:38,948 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-13 20:37:38,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 20:37:38,948 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:38,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash 924694299, now seen corresponding path program 11 times [2025-04-13 20:37:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:38,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073733609] [2025-04-13 20:37:38,949 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:38,953 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:37:38,955 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:37:38,955 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:38,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:38,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:38,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073733609] [2025-04-13 20:37:38,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073733609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:37:38,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499342021] [2025-04-13 20:37:38,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:37:38,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:38,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:37:38,983 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-13 20:37:38,984 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-13 20:37:39,030 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 20:37:39,043 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:37:39,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:39,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:39,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:37:39,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:37:39,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:39,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:37:39,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:37:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499342021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:37:39,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:37:39,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 20:37:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274963867] [2025-04-13 20:37:39,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:37:39,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:37:39,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:39,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:37:39,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:37:39,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:37:39,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 1557 transitions, 46667 flow. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:39,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:39,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:37:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:45,416 INFO L116 PetriNetUnfolderBase]: 11267/16645 cut-off events. [2025-04-13 20:37:45,416 INFO L117 PetriNetUnfolderBase]: For 985541/985541 co-relation queries the response was YES. [2025-04-13 20:37:45,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216098 conditions, 16645 events. 11267/16645 cut-off events. For 985541/985541 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 104276 event pairs, 3149 based on Foata normal form. 50/15919 useless extension candidates. Maximal degree in co-relation 214976. Up to 14093 conditions per place. [2025-04-13 20:37:45,665 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1501 selfloop transitions, 37 changer transitions 29/1567 dead transitions. [2025-04-13 20:37:45,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1567 transitions, 49133 flow [2025-04-13 20:37:45,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:37:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:37:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2025-04-13 20:37:45,666 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2025-04-13 20:37:45,666 INFO L175 Difference]: Start difference. First operand has 477 places, 1557 transitions, 46667 flow. Second operand 7 states and 81 transitions. [2025-04-13 20:37:45,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1567 transitions, 49133 flow [2025-04-13 20:37:53,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 1567 transitions, 48807 flow, removed 129 selfloop flow, removed 3 redundant places. [2025-04-13 20:37:53,082 INFO L231 Difference]: Finished difference. Result has 479 places, 1505 transitions, 44408 flow [2025-04-13 20:37:53,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44683, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44408, PETRI_PLACES=479, PETRI_TRANSITIONS=1505} [2025-04-13 20:37:53,084 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 448 predicate places. [2025-04-13 20:37:53,084 INFO L485 AbstractCegarLoop]: Abstraction has has 479 places, 1505 transitions, 44408 flow [2025-04-13 20:37:53,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:37:53,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:37:53,084 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-13 20:37:53,090 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-13 20:37:53,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:37:53,285 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:37:53,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:37:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1065453250, now seen corresponding path program 2 times [2025-04-13 20:37:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:37:53,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160935417] [2025-04-13 20:37:53,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:37:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:37:53,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:37:53,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:37:53,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:37:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:37:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:37:53,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:37:53,327 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160935417] [2025-04-13 20:37:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160935417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:37:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:37:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:37:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117409241] [2025-04-13 20:37:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:37:53,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:37:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:37:53,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:37:53,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:37:53,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:37:53,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 1505 transitions, 44408 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-13 20:37:53,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:37:53,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:37:53,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:37:59,532 INFO L116 PetriNetUnfolderBase]: 11146/16424 cut-off events. [2025-04-13 20:37:59,533 INFO L117 PetriNetUnfolderBase]: For 949645/949645 co-relation queries the response was YES. [2025-04-13 20:37:59,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211917 conditions, 16424 events. 11146/16424 cut-off events. For 949645/949645 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 102602 event pairs, 1707 based on Foata normal form. 0/15679 useless extension candidates. Maximal degree in co-relation 211678. Up to 6481 conditions per place. [2025-04-13 20:37:59,974 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1173 selfloop transitions, 503 changer transitions 18/1694 dead transitions. [2025-04-13 20:37:59,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 1694 transitions, 52096 flow [2025-04-13 20:37:59,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:37:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:37:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-04-13 20:37:59,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2025-04-13 20:37:59,975 INFO L175 Difference]: Start difference. First operand has 479 places, 1505 transitions, 44408 flow. Second operand 7 states and 110 transitions. [2025-04-13 20:37:59,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 1694 transitions, 52096 flow [2025-04-13 20:38:06,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1694 transitions, 51771 flow, removed 52 selfloop flow, removed 9 redundant places. [2025-04-13 20:38:06,855 INFO L231 Difference]: Finished difference. Result has 471 places, 1497 transitions, 44998 flow [2025-04-13 20:38:06,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44104, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44998, PETRI_PLACES=471, PETRI_TRANSITIONS=1497} [2025-04-13 20:38:06,857 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 440 predicate places. [2025-04-13 20:38:06,857 INFO L485 AbstractCegarLoop]: Abstraction has has 471 places, 1497 transitions, 44998 flow [2025-04-13 20:38:06,857 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-13 20:38:06,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:06,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] [2025-04-13 20:38:06,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 20:38:06,857 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:06,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1165114570, now seen corresponding path program 2 times [2025-04-13 20:38:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:06,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737819868] [2025-04-13 20:38:06,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:06,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:06,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:06,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:06,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:06,900 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-13 20:38:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:06,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737819868] [2025-04-13 20:38:06,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737819868] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:06,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348081148] [2025-04-13 20:38:06,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:06,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:06,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:06,903 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-13 20:38:06,904 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-13 20:38:06,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:06,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:06,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:06,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:06,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:38:06,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:07,025 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-13 20:38:07,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:07,069 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-13 20:38:07,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348081148] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:07,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:07,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:38:07,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481384426] [2025-04-13 20:38:07,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:07,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:38:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:07,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:38:07,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:38:07,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:07,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 1497 transitions, 44998 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-13 20:38:07,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:07,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:07,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:13,043 INFO L116 PetriNetUnfolderBase]: 11061/16258 cut-off events. [2025-04-13 20:38:13,044 INFO L117 PetriNetUnfolderBase]: For 969043/969043 co-relation queries the response was YES. [2025-04-13 20:38:13,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212682 conditions, 16258 events. 11061/16258 cut-off events. For 969043/969043 co-relation queries the response was YES. Maximal size of possible extension queue 1110. Compared 100562 event pairs, 3064 based on Foata normal form. 56/15569 useless extension candidates. Maximal degree in co-relation 212450. Up to 13884 conditions per place. [2025-04-13 20:38:13,310 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1495 selfloop transitions, 53 changer transitions 0/1548 dead transitions. [2025-04-13 20:38:13,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 1548 transitions, 49053 flow [2025-04-13 20:38:13,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:38:13,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:38:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-13 20:38:13,311 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2025-04-13 20:38:13,311 INFO L175 Difference]: Start difference. First operand has 471 places, 1497 transitions, 44998 flow. Second operand 7 states and 75 transitions. [2025-04-13 20:38:13,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 1548 transitions, 49053 flow [2025-04-13 20:38:20,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 1548 transitions, 47905 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-04-13 20:38:20,236 INFO L231 Difference]: Finished difference. Result has 470 places, 1492 transitions, 43839 flow [2025-04-13 20:38:20,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43594, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1487, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=43839, PETRI_PLACES=470, PETRI_TRANSITIONS=1492} [2025-04-13 20:38:20,237 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 439 predicate places. [2025-04-13 20:38:20,238 INFO L485 AbstractCegarLoop]: Abstraction has has 470 places, 1492 transitions, 43839 flow [2025-04-13 20:38:20,238 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-13 20:38:20,238 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:20,238 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-13 20:38:20,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:20,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:20,438 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:20,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1778106472, now seen corresponding path program 1 times [2025-04-13 20:38:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:20,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573633067] [2025-04-13 20:38:20,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:20,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:38:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:20,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:20,486 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-13 20:38:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:20,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573633067] [2025-04-13 20:38:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573633067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:20,486 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610986741] [2025-04-13 20:38:20,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:38:20,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:20,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:20,488 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-13 20:38:20,492 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-13 20:38:20,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 20:38:20,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:20,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:38:20,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:20,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:38:20,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:20,612 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-13 20:38:20,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:20,660 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-13 20:38:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610986741] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:38:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690438421] [2025-04-13 20:38:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:20,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:38:20,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:20,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:38:20,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:38:20,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:20,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1492 transitions, 43839 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-13 20:38:20,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:20,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:20,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:27,357 INFO L116 PetriNetUnfolderBase]: 12941/18818 cut-off events. [2025-04-13 20:38:27,357 INFO L117 PetriNetUnfolderBase]: For 1106418/1106418 co-relation queries the response was YES. [2025-04-13 20:38:27,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241613 conditions, 18818 events. 12941/18818 cut-off events. For 1106418/1106418 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 115873 event pairs, 2627 based on Foata normal form. 0/17757 useless extension candidates. Maximal degree in co-relation 241381. Up to 10410 conditions per place. [2025-04-13 20:38:27,616 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1613 selfloop transitions, 80 changer transitions 0/1693 dead transitions. [2025-04-13 20:38:27,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 1693 transitions, 52477 flow [2025-04-13 20:38:27,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:38:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:38:27,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2025-04-13 20:38:27,617 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2025-04-13 20:38:27,617 INFO L175 Difference]: Start difference. First operand has 470 places, 1492 transitions, 43839 flow. Second operand 7 states and 75 transitions. [2025-04-13 20:38:27,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 1693 transitions, 52477 flow [2025-04-13 20:38:36,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 1693 transitions, 52401 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-04-13 20:38:36,495 INFO L231 Difference]: Finished difference. Result has 474 places, 1503 transitions, 44197 flow [2025-04-13 20:38:36,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=43771, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44197, PETRI_PLACES=474, PETRI_TRANSITIONS=1503} [2025-04-13 20:38:36,496 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 443 predicate places. [2025-04-13 20:38:36,496 INFO L485 AbstractCegarLoop]: Abstraction has has 474 places, 1503 transitions, 44197 flow [2025-04-13 20:38:36,496 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-13 20:38:36,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:36,496 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-13 20:38:36,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 20:38:36,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:36,697 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:36,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:36,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1492112872, now seen corresponding path program 2 times [2025-04-13 20:38:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:36,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761732177] [2025-04-13 20:38:36,698 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:36,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:36,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:36,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:36,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:36,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:36,745 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-13 20:38:36,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:36,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761732177] [2025-04-13 20:38:36,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761732177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:36,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825628011] [2025-04-13 20:38:36,745 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:38:36,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:36,747 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-13 20:38:36,747 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-13 20:38:36,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:36,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:36,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:38:36,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:36,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:38:36,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:36,861 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-13 20:38:36,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:36,902 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-13 20:38:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825628011] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:36,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:38:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416259231] [2025-04-13 20:38:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:36,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:38:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:38:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:38:36,903 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:36,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1503 transitions, 44197 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-13 20:38:36,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:36,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:36,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:38:44,468 INFO L116 PetriNetUnfolderBase]: 13874/20101 cut-off events. [2025-04-13 20:38:44,468 INFO L117 PetriNetUnfolderBase]: For 1180162/1180162 co-relation queries the response was YES. [2025-04-13 20:38:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260459 conditions, 20101 events. 13874/20101 cut-off events. For 1180162/1180162 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 123512 event pairs, 1352 based on Foata normal form. 70/19530 useless extension candidates. Maximal degree in co-relation 260225. Up to 10015 conditions per place. [2025-04-13 20:38:44,741 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1658 selfloop transitions, 107 changer transitions 8/1773 dead transitions. [2025-04-13 20:38:44,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 1773 transitions, 53792 flow [2025-04-13 20:38:44,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:38:44,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:38:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2025-04-13 20:38:44,742 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:38:44,742 INFO L175 Difference]: Start difference. First operand has 474 places, 1503 transitions, 44197 flow. Second operand 8 states and 96 transitions. [2025-04-13 20:38:44,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 1773 transitions, 53792 flow [2025-04-13 20:38:53,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1773 transitions, 53779 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 20:38:53,786 INFO L231 Difference]: Finished difference. Result has 481 places, 1521 transitions, 44976 flow [2025-04-13 20:38:53,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44184, PETRI_DIFFERENCE_MINUEND_PLACES=471, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=44976, PETRI_PLACES=481, PETRI_TRANSITIONS=1521} [2025-04-13 20:38:53,787 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 450 predicate places. [2025-04-13 20:38:53,787 INFO L485 AbstractCegarLoop]: Abstraction has has 481 places, 1521 transitions, 44976 flow [2025-04-13 20:38:53,788 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-13 20:38:53,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:38:53,788 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-13 20:38:53,794 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-13 20:38:53,988 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,SelfDestructingSolverStorable69 [2025-04-13 20:38:53,988 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:38:53,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:38:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1789978260, now seen corresponding path program 3 times [2025-04-13 20:38:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:38:53,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859065348] [2025-04-13 20:38:53,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:38:53,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:53,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:53,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:53,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:54,026 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-13 20:38:54,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:38:54,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859065348] [2025-04-13 20:38:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859065348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:54,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226223876] [2025-04-13 20:38:54,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:38:54,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:38:54,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:38:54,028 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-13 20:38:54,030 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-13 20:38:54,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:38:54,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:38:54,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:38:54,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:38:54,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:38:54,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:38:54,140 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-13 20:38:54,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:38:54,174 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-13 20:38:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226223876] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:38:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:38:54,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2025-04-13 20:38:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100525379] [2025-04-13 20:38:54,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:38:54,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:38:54,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:38:54,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:38:54,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:38:54,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:38:54,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 1521 transitions, 44976 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-13 20:38:54,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:38:54,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:38:54,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:01,844 INFO L116 PetriNetUnfolderBase]: 13756/19884 cut-off events. [2025-04-13 20:39:01,844 INFO L117 PetriNetUnfolderBase]: For 1238616/1238616 co-relation queries the response was YES. [2025-04-13 20:39:02,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263580 conditions, 19884 events. 13756/19884 cut-off events. For 1238616/1238616 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 121102 event pairs, 4249 based on Foata normal form. 79/19923 useless extension candidates. Maximal degree in co-relation 263342. Up to 18047 conditions per place. [2025-04-13 20:39:02,145 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1628 selfloop transitions, 43 changer transitions 0/1671 dead transitions. [2025-04-13 20:39:02,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1671 transitions, 51757 flow [2025-04-13 20:39:02,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:39:02,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:39:02,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-04-13 20:39:02,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-04-13 20:39:02,146 INFO L175 Difference]: Start difference. First operand has 481 places, 1521 transitions, 44976 flow. Second operand 7 states and 72 transitions. [2025-04-13 20:39:02,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1671 transitions, 51757 flow [2025-04-13 20:39:11,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 1671 transitions, 51594 flow, removed 35 selfloop flow, removed 6 redundant places. [2025-04-13 20:39:11,070 INFO L231 Difference]: Finished difference. Result has 482 places, 1525 transitions, 45023 flow [2025-04-13 20:39:11,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44858, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=45023, PETRI_PLACES=482, PETRI_TRANSITIONS=1525} [2025-04-13 20:39:11,071 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 451 predicate places. [2025-04-13 20:39:11,071 INFO L485 AbstractCegarLoop]: Abstraction has has 482 places, 1525 transitions, 45023 flow [2025-04-13 20:39:11,072 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-13 20:39:11,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:11,072 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-13 20:39:11,078 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-13 20:39:11,272 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:11,272 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:11,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:11,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1786720982, now seen corresponding path program 3 times [2025-04-13 20:39:11,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:11,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774053493] [2025-04-13 20:39:11,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:11,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:11,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:11,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:11,314 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-13 20:39:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:11,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774053493] [2025-04-13 20:39:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774053493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:11,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440036231] [2025-04-13 20:39:11,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:11,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:11,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:11,317 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-13 20:39:11,319 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-13 20:39:11,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:11,384 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:11,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:39:11,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:11,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:39:11,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:11,425 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-13 20:39:11,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:11,462 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-13 20:39:11,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440036231] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:11,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:39:11,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 20:39:11,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584330852] [2025-04-13 20:39:11,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:11,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:39:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:11,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:39:11,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:39:11,463 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:11,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 1525 transitions, 45023 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-13 20:39:11,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:11,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:19,422 INFO L116 PetriNetUnfolderBase]: 15194/21820 cut-off events. [2025-04-13 20:39:19,423 INFO L117 PetriNetUnfolderBase]: For 1373301/1373301 co-relation queries the response was YES. [2025-04-13 20:39:19,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287866 conditions, 21820 events. 15194/21820 cut-off events. For 1373301/1373301 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 133137 event pairs, 2244 based on Foata normal form. 146/21926 useless extension candidates. Maximal degree in co-relation 287629. Up to 12547 conditions per place. [2025-04-13 20:39:20,010 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1587 selfloop transitions, 214 changer transitions 0/1801 dead transitions. [2025-04-13 20:39:20,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1801 transitions, 55325 flow [2025-04-13 20:39:20,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:39:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:39:20,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-04-13 20:39:20,011 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-13 20:39:20,011 INFO L175 Difference]: Start difference. First operand has 482 places, 1525 transitions, 45023 flow. Second operand 7 states and 83 transitions. [2025-04-13 20:39:20,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 1801 transitions, 55325 flow [2025-04-13 20:39:30,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 1801 transitions, 55039 flow, removed 36 selfloop flow, removed 7 redundant places. [2025-04-13 20:39:30,338 INFO L231 Difference]: Finished difference. Result has 484 places, 1565 transitions, 47296 flow [2025-04-13 20:39:30,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44224, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1500, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=47296, PETRI_PLACES=484, PETRI_TRANSITIONS=1565} [2025-04-13 20:39:30,339 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 453 predicate places. [2025-04-13 20:39:30,339 INFO L485 AbstractCegarLoop]: Abstraction has has 484 places, 1565 transitions, 47296 flow [2025-04-13 20:39:30,339 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-13 20:39:30,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:30,340 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-13 20:39:30,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:30,540 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:30,540 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:30,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1414915440, now seen corresponding path program 4 times [2025-04-13 20:39:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:30,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234572135] [2025-04-13 20:39:30,541 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:30,546 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:30,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-13 20:39:30,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:39:30,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:30,566 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-13 20:39:30,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:30,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234572135] [2025-04-13 20:39:30,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234572135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:30,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113445645] [2025-04-13 20:39:30,567 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:30,569 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-13 20:39:30,570 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-13 20:39:30,621 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:30,629 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-13 20:39:30,629 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:39:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:30,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:39:30,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:30,648 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-13 20:39:30,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:30,675 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-13 20:39:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113445645] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:30,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 20:39:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848277816] [2025-04-13 20:39:30,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:30,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 20:39:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:30,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 20:39:30,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:39:30,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:30,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 1565 transitions, 47296 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:30,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:30,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:30,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:39,896 INFO L116 PetriNetUnfolderBase]: 15774/22617 cut-off events. [2025-04-13 20:39:39,896 INFO L117 PetriNetUnfolderBase]: For 1465968/1465968 co-relation queries the response was YES. [2025-04-13 20:39:40,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303274 conditions, 22617 events. 15774/22617 cut-off events. For 1465968/1465968 co-relation queries the response was YES. Maximal size of possible extension queue 1292. Compared 138539 event pairs, 769 based on Foata normal form. 7/22580 useless extension candidates. Maximal degree in co-relation 303037. Up to 7367 conditions per place. [2025-04-13 20:39:40,379 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1633 selfloop transitions, 718 changer transitions 1/2352 dead transitions. [2025-04-13 20:39:40,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2352 transitions, 70831 flow [2025-04-13 20:39:40,379 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:39:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:39:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 258 transitions. [2025-04-13 20:39:40,380 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4742647058823529 [2025-04-13 20:39:40,380 INFO L175 Difference]: Start difference. First operand has 484 places, 1565 transitions, 47296 flow. Second operand 17 states and 258 transitions. [2025-04-13 20:39:40,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 2352 transitions, 70831 flow [2025-04-13 20:39:52,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 2352 transitions, 70682 flow, removed 72 selfloop flow, removed 3 redundant places. [2025-04-13 20:39:52,540 INFO L231 Difference]: Finished difference. Result has 509 places, 1727 transitions, 54828 flow [2025-04-13 20:39:52,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=47241, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=54828, PETRI_PLACES=509, PETRI_TRANSITIONS=1727} [2025-04-13 20:39:52,542 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 478 predicate places. [2025-04-13 20:39:52,542 INFO L485 AbstractCegarLoop]: Abstraction has has 509 places, 1727 transitions, 54828 flow [2025-04-13 20:39:52,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:52,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:52,542 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-13 20:39:52,548 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-13 20:39:52,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:52,743 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:52,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:52,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2063136448, now seen corresponding path program 5 times [2025-04-13 20:39:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:52,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465561730] [2025-04-13 20:39:52,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:52,749 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:52,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:52,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:52,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:52,790 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-13 20:39:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:52,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465561730] [2025-04-13 20:39:52,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465561730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:52,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006433383] [2025-04-13 20:39:52,790 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:52,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:52,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:52,792 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-13 20:39:52,794 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-13 20:39:52,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:39:52,859 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:39:52,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:52,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:52,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:39:52,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:52,888 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-13 20:39:52,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:52,923 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-13 20:39:52,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006433383] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:52,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:52,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:39:52,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747849131] [2025-04-13 20:39:52,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:52,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:39:52,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:52,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:39:52,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:39:52,924 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:52,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 1727 transitions, 54828 flow. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:52,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:52,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:52,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:02,838 INFO L116 PetriNetUnfolderBase]: 15691/22435 cut-off events. [2025-04-13 20:40:02,839 INFO L117 PetriNetUnfolderBase]: For 1553436/1553436 co-relation queries the response was YES. [2025-04-13 20:40:03,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307164 conditions, 22435 events. 15691/22435 cut-off events. For 1553436/1553436 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 136129 event pairs, 767 based on Foata normal form. 48/22483 useless extension candidates. Maximal degree in co-relation 306917. Up to 7456 conditions per place. [2025-04-13 20:40:03,285 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1584 selfloop transitions, 574 changer transitions 0/2158 dead transitions. [2025-04-13 20:40:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 2158 transitions, 69198 flow [2025-04-13 20:40:03,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:40:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:40:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 175 transitions. [2025-04-13 20:40:03,286 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2025-04-13 20:40:03,286 INFO L175 Difference]: Start difference. First operand has 509 places, 1727 transitions, 54828 flow. Second operand 15 states and 175 transitions. [2025-04-13 20:40:03,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 2158 transitions, 69198 flow [2025-04-13 20:40:17,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 2158 transitions, 68206 flow, removed 307 selfloop flow, removed 9 redundant places. [2025-04-13 20:40:17,407 INFO L231 Difference]: Finished difference. Result has 518 places, 1759 transitions, 57045 flow [2025-04-13 20:40:17,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=53448, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=525, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=57045, PETRI_PLACES=518, PETRI_TRANSITIONS=1759} [2025-04-13 20:40:17,409 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 487 predicate places. [2025-04-13 20:40:17,409 INFO L485 AbstractCegarLoop]: Abstraction has has 518 places, 1759 transitions, 57045 flow [2025-04-13 20:40:17,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:17,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:17,409 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-13 20:40:17,414 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-13 20:40:17,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:17,610 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:17,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1785226004, now seen corresponding path program 3 times [2025-04-13 20:40:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:17,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523941173] [2025-04-13 20:40:17,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:17,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:17,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:17,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:17,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:17,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:17,657 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523941173] [2025-04-13 20:40:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523941173] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:17,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:17,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:40:17,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048440358] [2025-04-13 20:40:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:17,658 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:40:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:17,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:40:17,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:40:17,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:17,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1759 transitions, 57045 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-13 20:40:17,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:17,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:17,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:27,102 INFO L116 PetriNetUnfolderBase]: 15603/22353 cut-off events. [2025-04-13 20:40:27,103 INFO L117 PetriNetUnfolderBase]: For 1581924/1581924 co-relation queries the response was YES. [2025-04-13 20:40:27,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308118 conditions, 22353 events. 15603/22353 cut-off events. For 1581924/1581924 co-relation queries the response was YES. Maximal size of possible extension queue 1264. Compared 136304 event pairs, 2805 based on Foata normal form. 95/22448 useless extension candidates. Maximal degree in co-relation 307873. Up to 12313 conditions per place. [2025-04-13 20:40:27,531 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1514 selfloop transitions, 515 changer transitions 23/2052 dead transitions. [2025-04-13 20:40:27,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 523 places, 2052 transitions, 68738 flow [2025-04-13 20:40:27,532 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-13 20:40:27,532 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-04-13 20:40:27,532 INFO L175 Difference]: Start difference. First operand has 518 places, 1759 transitions, 57045 flow. Second operand 6 states and 88 transitions. [2025-04-13 20:40:27,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 523 places, 2052 transitions, 68738 flow [2025-04-13 20:40:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 2052 transitions, 67295 flow, removed 271 selfloop flow, removed 9 redundant places. [2025-04-13 20:40:42,979 INFO L231 Difference]: Finished difference. Result has 516 places, 1777 transitions, 57353 flow [2025-04-13 20:40:42,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55729, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=57353, PETRI_PLACES=516, PETRI_TRANSITIONS=1777} [2025-04-13 20:40:42,981 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 485 predicate places. [2025-04-13 20:40:42,981 INFO L485 AbstractCegarLoop]: Abstraction has has 516 places, 1777 transitions, 57353 flow [2025-04-13 20:40:42,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:42,981 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-13 20:40:42,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 20:40:42,981 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:42,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash -387868036, now seen corresponding path program 4 times [2025-04-13 20:40:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:42,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003111467] [2025-04-13 20:40:42,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:42,986 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:42,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-13 20:40:42,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:40:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:43,006 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-13 20:40:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:43,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003111467] [2025-04-13 20:40:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003111467] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:43,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990137429] [2025-04-13 20:40:43,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:43,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:43,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:43,008 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-13 20:40:43,009 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-13 20:40:43,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:43,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 23 statements. [2025-04-13 20:40:43,069 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:40:43,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:43,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:40:43,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:43,125 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-13 20:40:43,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:43,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990137429] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:40:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 20:40:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083549236] [2025-04-13 20:40:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:43,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:40:43,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:43,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:40:43,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:40:43,167 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:43,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 1777 transitions, 57353 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-13 20:40:43,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:43,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:43,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:53,122 INFO L116 PetriNetUnfolderBase]: 15587/22411 cut-off events. [2025-04-13 20:40:53,123 INFO L117 PetriNetUnfolderBase]: For 1609386/1609386 co-relation queries the response was YES. [2025-04-13 20:40:53,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311821 conditions, 22411 events. 15587/22411 cut-off events. For 1609386/1609386 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 137709 event pairs, 2594 based on Foata normal form. 84/22495 useless extension candidates. Maximal degree in co-relation 311579. Up to 10713 conditions per place. [2025-04-13 20:40:53,572 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1587 selfloop transitions, 525 changer transitions 5/2117 dead transitions. [2025-04-13 20:40:53,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 2117 transitions, 70431 flow [2025-04-13 20:40:53,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-13 20:40:53,573 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2025-04-13 20:40:53,573 INFO L175 Difference]: Start difference. First operand has 516 places, 1777 transitions, 57353 flow. Second operand 6 states and 97 transitions. [2025-04-13 20:40:53,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 2117 transitions, 70431 flow [2025-04-13 20:41:08,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 2117 transitions, 69215 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-13 20:41:08,788 INFO L231 Difference]: Finished difference. Result has 520 places, 1817 transitions, 59264 flow [2025-04-13 20:41:08,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56099, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=474, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=59264, PETRI_PLACES=520, PETRI_TRANSITIONS=1817} [2025-04-13 20:41:08,789 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 489 predicate places. [2025-04-13 20:41:08,789 INFO L485 AbstractCegarLoop]: Abstraction has has 520 places, 1817 transitions, 59264 flow [2025-04-13 20:41:08,789 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-13 20:41:08,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:08,789 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-13 20:41:08,795 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-13 20:41:08,990 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,SelfDestructingSolverStorable75 [2025-04-13 20:41:08,990 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:08,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:08,991 INFO L85 PathProgramCache]: Analyzing trace with hash 359164776, now seen corresponding path program 5 times [2025-04-13 20:41:08,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:08,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599624989] [2025-04-13 20:41:08,991 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:08,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:09,028 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:41:09,031 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:41:09,031 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:09,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599624989] [2025-04-13 20:41:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599624989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:41:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79493019] [2025-04-13 20:41:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:09,061 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:41:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:09,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:41:09,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:41:09,062 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:09,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 1817 transitions, 59264 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-13 20:41:09,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:09,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:18,923 INFO L116 PetriNetUnfolderBase]: 15490/22277 cut-off events. [2025-04-13 20:41:18,923 INFO L117 PetriNetUnfolderBase]: For 1604965/1604965 co-relation queries the response was YES. [2025-04-13 20:41:19,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313021 conditions, 22277 events. 15490/22277 cut-off events. For 1604965/1604965 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 136527 event pairs, 2149 based on Foata normal form. 67/22344 useless extension candidates. Maximal degree in co-relation 312777. Up to 11679 conditions per place. [2025-04-13 20:41:19,336 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1834 selfloop transitions, 252 changer transitions 17/2103 dead transitions. [2025-04-13 20:41:19,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 2103 transitions, 71303 flow [2025-04-13 20:41:19,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:41:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:41:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2025-04-13 20:41:19,337 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 20:41:19,337 INFO L175 Difference]: Start difference. First operand has 520 places, 1817 transitions, 59264 flow. Second operand 6 states and 80 transitions. [2025-04-13 20:41:19,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 2103 transitions, 71303 flow [2025-04-13 20:41:35,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 2103 transitions, 70655 flow, removed 70 selfloop flow, removed 2 redundant places. [2025-04-13 20:41:35,135 INFO L231 Difference]: Finished difference. Result has 526 places, 1853 transitions, 60928 flow [2025-04-13 20:41:35,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=58662, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60928, PETRI_PLACES=526, PETRI_TRANSITIONS=1853} [2025-04-13 20:41:35,137 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 495 predicate places. [2025-04-13 20:41:35,137 INFO L485 AbstractCegarLoop]: Abstraction has has 526 places, 1853 transitions, 60928 flow [2025-04-13 20:41:35,137 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-13 20:41:35,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:35,137 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-13 20:41:35,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 20:41:35,137 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:35,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash -2089585156, now seen corresponding path program 6 times [2025-04-13 20:41:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:35,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961094479] [2025-04-13 20:41:35,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:41:35,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:35,143 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:41:35,145 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-13 20:41:35,145 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:41:35,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:35,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:35,172 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961094479] [2025-04-13 20:41:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961094479] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:41:35,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:41:35,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:41:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195024334] [2025-04-13 20:41:35,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:35,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:41:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:35,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:41:35,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:41:35,173 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:35,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 1853 transitions, 60928 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-13 20:41:35,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:35,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:35,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:45,163 INFO L116 PetriNetUnfolderBase]: 15000/21492 cut-off events. [2025-04-13 20:41:45,163 INFO L117 PetriNetUnfolderBase]: For 1614314/1614314 co-relation queries the response was YES. [2025-04-13 20:41:45,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306309 conditions, 21492 events. 15000/21492 cut-off events. For 1614314/1614314 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 129939 event pairs, 2242 based on Foata normal form. 108/21600 useless extension candidates. Maximal degree in co-relation 306062. Up to 8747 conditions per place. [2025-04-13 20:41:45,522 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1680 selfloop transitions, 408 changer transitions 20/2108 dead transitions. [2025-04-13 20:41:45,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 2108 transitions, 70708 flow [2025-04-13 20:41:45,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:41:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:41:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2025-04-13 20:41:45,523 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4114583333333333 [2025-04-13 20:41:45,523 INFO L175 Difference]: Start difference. First operand has 526 places, 1853 transitions, 60928 flow. Second operand 6 states and 79 transitions. [2025-04-13 20:41:45,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 2108 transitions, 70708 flow [2025-04-13 20:42:01,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 2108 transitions, 70436 flow, removed 71 selfloop flow, removed 2 redundant places. [2025-04-13 20:42:01,536 INFO L231 Difference]: Finished difference. Result has 529 places, 1813 transitions, 60276 flow [2025-04-13 20:42:01,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60013, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1833, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=408, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=60276, PETRI_PLACES=529, PETRI_TRANSITIONS=1813} [2025-04-13 20:42:01,537 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 498 predicate places. [2025-04-13 20:42:01,537 INFO L485 AbstractCegarLoop]: Abstraction has has 529 places, 1813 transitions, 60276 flow [2025-04-13 20:42:01,537 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-13 20:42:01,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:01,537 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-13 20:42:01,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 20:42:01,537 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:01,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash -138139652, now seen corresponding path program 6 times [2025-04-13 20:42:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:01,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424168473] [2025-04-13 20:42:01,538 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:01,543 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:01,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:01,547 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:01,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,580 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-13 20:42:01,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:01,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424168473] [2025-04-13 20:42:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424168473] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:01,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958380501] [2025-04-13 20:42:01,581 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:01,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:01,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:01,585 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-13 20:42:01,586 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-13 20:42:01,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:42:01,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:42:01,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:01,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:42:01,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:01,690 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-13 20:42:01,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:01,727 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-13 20:42:01,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958380501] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:01,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:42:01,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-04-13 20:42:01,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584128000] [2025-04-13 20:42:01,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:42:01,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:42:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:01,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:42:01,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:42:01,729 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:01,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 1813 transitions, 60276 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-13 20:42:01,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:01,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:01,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:10,942 INFO L116 PetriNetUnfolderBase]: 14557/20663 cut-off events. [2025-04-13 20:42:10,942 INFO L117 PetriNetUnfolderBase]: For 1623967/1623967 co-relation queries the response was YES. [2025-04-13 20:42:11,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297230 conditions, 20663 events. 14557/20663 cut-off events. For 1623967/1623967 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 121571 event pairs, 2762 based on Foata normal form. 194/20857 useless extension candidates. Maximal degree in co-relation 296983. Up to 11111 conditions per place. [2025-04-13 20:42:11,405 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1321 selfloop transitions, 504 changer transitions 0/1825 dead transitions. [2025-04-13 20:42:11,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 1825 transitions, 63054 flow [2025-04-13 20:42:11,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:42:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:42:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2025-04-13 20:42:11,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-13 20:42:11,406 INFO L175 Difference]: Start difference. First operand has 529 places, 1813 transitions, 60276 flow. Second operand 6 states and 65 transitions. [2025-04-13 20:42:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 1825 transitions, 63054 flow [2025-04-13 20:42:24,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 1825 transitions, 60864 flow, removed 184 selfloop flow, removed 17 redundant places. [2025-04-13 20:42:24,677 INFO L231 Difference]: Finished difference. Result has 508 places, 1750 transitions, 56548 flow [2025-04-13 20:42:24,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55540, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=504, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=56548, PETRI_PLACES=508, PETRI_TRANSITIONS=1750} [2025-04-13 20:42:24,678 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 477 predicate places. [2025-04-13 20:42:24,678 INFO L485 AbstractCegarLoop]: Abstraction has has 508 places, 1750 transitions, 56548 flow [2025-04-13 20:42:24,678 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-13 20:42:24,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:24,679 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-13 20:42:24,684 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-13 20:42:24,879 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,SelfDestructingSolverStorable78 [2025-04-13 20:42:24,879 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:24,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1622649413, now seen corresponding path program 1 times [2025-04-13 20:42:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:24,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668634344] [2025-04-13 20:42:24,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:24,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:24,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:24,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:24,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:25,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668634344] [2025-04-13 20:42:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668634344] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:25,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463442886] [2025-04-13 20:42:25,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:25,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:25,356 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-13 20:42:25,357 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-13 20:42:25,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:25,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:25,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:25,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:25,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 20:42:25,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:25,775 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:25,776 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 33 treesize of output 27 [2025-04-13 20:42:25,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:25,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:26,118 INFO L325 Elim1Store]: treesize reduction 26, result has 46.9 percent of original size [2025-04-13 20:42:26,118 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 43 treesize of output 32 [2025-04-13 20:42:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:26,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463442886] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:26,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:26,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 12] total 38 [2025-04-13 20:42:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647625323] [2025-04-13 20:42:26,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:26,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 20:42:26,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:26,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 20:42:26,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 20:42:26,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:26,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 1750 transitions, 56548 flow. Second operand has 40 states, 40 states have (on average 4.65) internal successors, (186), 40 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-13 20:42:26,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:26,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:44,297 INFO L116 PetriNetUnfolderBase]: 19396/27806 cut-off events. [2025-04-13 20:42:44,297 INFO L117 PetriNetUnfolderBase]: For 1940055/1940055 co-relation queries the response was YES. [2025-04-13 20:42:44,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387013 conditions, 27806 events. 19396/27806 cut-off events. For 1940055/1940055 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 174751 event pairs, 1421 based on Foata normal form. 1/27807 useless extension candidates. Maximal degree in co-relation 386548. Up to 20329 conditions per place. [2025-04-13 20:42:44,928 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1824 selfloop transitions, 1715 changer transitions 3/3542 dead transitions. [2025-04-13 20:42:44,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 3542 transitions, 110577 flow [2025-04-13 20:42:44,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-04-13 20:42:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-04-13 20:42:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 1121 transitions. [2025-04-13 20:42:44,930 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31559684684684686 [2025-04-13 20:42:44,930 INFO L175 Difference]: Start difference. First operand has 508 places, 1750 transitions, 56548 flow. Second operand 111 states and 1121 transitions. [2025-04-13 20:42:44,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 3542 transitions, 110577 flow [2025-04-13 20:43:07,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 3542 transitions, 109291 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-13 20:43:07,386 INFO L231 Difference]: Finished difference. Result has 648 places, 2945 transitions, 97850 flow [2025-04-13 20:43:07,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=55534, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=992, PETRI_DIFFERENCE_SUBTRAHEND_STATES=111, PETRI_FLOW=97850, PETRI_PLACES=648, PETRI_TRANSITIONS=2945} [2025-04-13 20:43:07,387 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 617 predicate places. [2025-04-13 20:43:07,387 INFO L485 AbstractCegarLoop]: Abstraction has has 648 places, 2945 transitions, 97850 flow [2025-04-13 20:43:07,387 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.65) internal successors, (186), 40 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-13 20:43:07,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:07,387 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-13 20:43:07,394 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-13 20:43:07,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 20:43:07,588 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:07,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:07,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1538049739, now seen corresponding path program 2 times [2025-04-13 20:43:07,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:07,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115062167] [2025-04-13 20:43:07,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:07,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:07,604 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:07,604 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:07,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:07,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:07,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115062167] [2025-04-13 20:43:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115062167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:07,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468475919] [2025-04-13 20:43:07,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:07,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:07,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:07,908 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-13 20:43:07,908 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-13 20:43:07,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:07,982 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:07,982 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:07,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:07,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:43:07,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:08,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:43:08,300 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:08,300 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 31 treesize of output 19 [2025-04-13 20:43:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:43:08,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:08,532 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:08,532 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 24 treesize of output 18 [2025-04-13 20:43:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:08,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468475919] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:08,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:08,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 36 [2025-04-13 20:43:08,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830364471] [2025-04-13 20:43:08,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:08,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:43:08,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:08,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:43:08,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:43:08,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:08,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 2945 transitions, 97850 flow. Second operand has 38 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 38 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:08,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:08,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:08,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:30,917 INFO L116 PetriNetUnfolderBase]: 22752/32763 cut-off events. [2025-04-13 20:43:30,917 INFO L117 PetriNetUnfolderBase]: For 2511054/2511054 co-relation queries the response was YES. [2025-04-13 20:43:31,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477532 conditions, 32763 events. 22752/32763 cut-off events. For 2511054/2511054 co-relation queries the response was YES. Maximal size of possible extension queue 1803. Compared 213660 event pairs, 1319 based on Foata normal form. 3/32766 useless extension candidates. Maximal degree in co-relation 477082. Up to 20633 conditions per place. [2025-04-13 20:43:31,875 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1535 selfloop transitions, 2499 changer transitions 8/4042 dead transitions. [2025-04-13 20:43:31,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 4042 transitions, 137870 flow [2025-04-13 20:43:31,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 20:43:31,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-13 20:43:31,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 587 transitions. [2025-04-13 20:43:31,876 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3275669642857143 [2025-04-13 20:43:31,876 INFO L175 Difference]: Start difference. First operand has 648 places, 2945 transitions, 97850 flow. Second operand 56 states and 587 transitions. [2025-04-13 20:43:31,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 4042 transitions, 137870 flow Received shutdown request... [2025-04-13 20:43:50,634 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:43:50,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 20:43:50,653 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:43:50,653 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:43:50,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:50,839 WARN L610 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2025-04-13 20:43:50,841 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:43:50,841 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:43:50,841 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:43:50,841 INFO L422 BasicCegarLoop]: Path program histogram: [31, 11, 7, 6, 6, 5, 4, 3, 2, 2, 2, 1, 1] [2025-04-13 20:43:50,850 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:43:50,850 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:43:50,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:43:50 BasicIcfg [2025-04-13 20:43:50,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:43:50,857 INFO L158 Benchmark]: Toolchain (without parser) took 783560.45ms. Allocated memory was 125.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 87.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2025-04-13 20:43:50,857 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:43:50,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 72.8MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:43:50,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.13ms. Allocated memory is still 125.8MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:43:50,858 INFO L158 Benchmark]: Boogie Preprocessor took 53.86ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:43:50,858 INFO L158 Benchmark]: RCFGBuilder took 599.78ms. Allocated memory is still 125.8MB. Free memory was 68.3MB in the beginning and 70.5MB in the end (delta: -2.1MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. [2025-04-13 20:43:50,858 INFO L158 Benchmark]: TraceAbstraction took 782622.43ms. Allocated memory was 125.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 69.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2025-04-13 20:43:50,859 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.15ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 125.8MB. Free memory was 87.9MB in the beginning and 72.8MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.13ms. Allocated memory is still 125.8MB. Free memory was 72.8MB in the beginning and 70.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.86ms. Allocated memory is still 125.8MB. Free memory was 70.4MB in the beginning and 68.3MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 599.78ms. Allocated memory is still 125.8MB. Free memory was 68.3MB in the beginning and 70.5MB in the end (delta: -2.1MB). Peak memory consumption was 57.1MB. Max. memory is 8.0GB. * TraceAbstraction took 782622.43ms. Allocated memory was 125.8MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 69.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing RemoveRedundantFlow. - 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: 782.5s, OverallIterations: 81, TraceHistogramMax: 2, PathProgramHistogramMax: 31, EmptinessCheckTime: 0.0s, AutomataDifference: 758.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5232 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5232 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 613 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30921 IncrementalHoareTripleChecker+Invalid, 31534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 613 mSolverCounterUnsat, 0 mSDtfsCounter, 30921 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2070 GetRequests, 969 SyntacticMatches, 29 SemanticMatches, 1072 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8835 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97850occurred in iteration=80, InterpolantAutomatonStates: 800, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 2284 NumberOfCodeBlocks, 2210 NumberOfCodeBlocksAsserted, 152 NumberOfCheckSat, 2735 ConstructedInterpolants, 0 QuantifiedInterpolants, 20594 SizeOfPredicates, 223 NumberOfNonLiveVariables, 5219 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 136 InterpolantComputations, 73 PerfectInterpolantSequences, 199/300 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